Solving inversion problems with neural networks

NASA Technical Reports Server (NTRS)

Kamgar-Parsi, Behzad; Gualtieri, J. A.

1990-01-01

A class of inverse problems in remote sensing can be characterized by Q = F(x), where F is a nonlinear and noninvertible (or hard to invert) operator, and the objective is to infer the unknowns, x, from the observed quantities, Q. Since the number of observations is usually greater than the number of unknowns, these problems are formulated as optimization problems, which can be solved by a variety of techniques. The feasibility of neural networks for solving such problems is presently investigated. As an example, the problem of finding the atmospheric ozone profile from measured ultraviolet radiances is studied.

An Efficient Rank Based Approach for Closest String and Closest Substring

PubMed Central

2012-01-01

This paper aims to present a new genetic approach that uses rank distance for solving two known NP-hard problems, and to compare rank distance with other distance measures for strings. The two NP-hard problems we are trying to solve are closest string and closest substring. For each problem we build a genetic algorithm and we describe the genetic operations involved. Both genetic algorithms use a fitness function based on rank distance. We compare our algorithms with other genetic algorithms that use different distance measures, such as Hamming distance or Levenshtein distance, on real DNA sequences. Our experiments show that the genetic algorithms based on rank distance have the best results. PMID:22675483

Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs

NASA Astrophysics Data System (ADS)

Dorn, Britta; Hüffner, Falk; Krüger, Dominikus; Niedermeier, Rolf; Uhlmann, Johannes

We consider the following problem: Given an undirected network and a set of sender-receiver pairs, direct all edges such that the maximum number of "signal flows" defined by the pairs can be routed respecting edge directions. This problem has applications in communication networks and in understanding protein interaction based cell regulation mechanisms. Since this problem is NP-hard, research so far concentrated on polynomial-time approximation algorithms and tractable special cases. We take the viewpoint of parameterized algorithmics and examine several parameters related to the maximum signal flow over vertices or edges. We provide several fixed-parameter tractability results, and in one case a sharp complexity dichotomy between a linear-time solvable case and a slightly more general NP-hard case. We examine the value of these parameters for several real-world network instances. For many relevant cases, the NP-hard problem can be solved to optimality. In this way, parameterized analysis yields both deeper insight into the computational complexity and practical solving strategies.

Computational Study for Planar Connected Dominating Set Problem

NASA Astrophysics Data System (ADS)

Marzban, Marjan; Gu, Qian-Ping; Jia, Xiaohua

The connected dominating set (CDS) problem is a well studied NP-hard problem with many important applications. Dorn et al. [ESA2005, LNCS3669,pp95-106] introduce a new technique to generate 2^{O(sqrt{n})} time and fixed-parameter algorithms for a number of non-local hard problems, including the CDS problem in planar graphs. The practical performance of this algorithm is yet to be evaluated. We perform a computational study for such an evaluation. The results show that the size of instances can be solved by the algorithm mainly depends on the branchwidth of the instances, coinciding with the theoretical result. For graphs with small or moderate branchwidth, the CDS problem instances with size up to a few thousands edges can be solved in a practical time and memory space. This suggests that the branch-decomposition based algorithms can be practical for the planar CDS problem.

Robust Programming Problems Based on the Mean-Variance Model Including Uncertainty Factors

NASA Astrophysics Data System (ADS)

Hasuike, Takashi; Ishii, Hiroaki

2009-01-01

This paper considers robust programming problems based on the mean-variance model including uncertainty sets and fuzzy factors. Since these problems are not well-defined problems due to fuzzy factors, it is hard to solve them directly. Therefore, introducing chance constraints, fuzzy goals and possibility measures, the proposed models are transformed into the deterministic equivalent problems. Furthermore, in order to solve these equivalent problems efficiently, the solution method is constructed introducing the mean-absolute deviation and doing the equivalent transformations.

A class of finite-time dual neural networks for solving quadratic programming problems and its k-winners-take-all application.

PubMed

Li, Shuai; Li, Yangming; Wang, Zheng

2013-03-01

This paper presents a class of recurrent neural networks to solve quadratic programming problems. Different from most existing recurrent neural networks for solving quadratic programming problems, the proposed neural network model converges in finite time and the activation function is not required to be a hard-limiting function for finite convergence time. The stability, finite-time convergence property and the optimality of the proposed neural network for solving the original quadratic programming problem are proven in theory. Extensive simulations are performed to evaluate the performance of the neural network with different parameters. In addition, the proposed neural network is applied to solving the k-winner-take-all (k-WTA) problem. Both theoretical analysis and numerical simulations validate the effectiveness of our method for solving the k-WTA problem. Copyright © 2012 Elsevier Ltd. All rights reserved.

Using Student-Developed, Inquiry-Based Experiments to Investigate the Contributions of Ca and Mg to Water Hardness

ERIC Educational Resources Information Center

Yang, Shui-Ping; Li, Chung-Chia

2009-01-01

This study provided a challenging opportunity for general chemistry students to mimic the scientific research process by solving a water-quality problem concerning individual calcium and magnesium concentrations. We found that general chemistry students were able to develop their own experiments to solve real-world, multivariable problems through…

Can I cut the Gordian tnok? The impact of pronounceability, actual solvability, and length on intuitive problem assessments of anagrams.

PubMed

Topolinski, Sascha; Bakhtiari, Giti; Erle, Thorsten M

2016-01-01

When assessing a problem, many cues can be used to predict solvability and solving effort. Some of these cues, however, can be misleading. The present approach shows that a feature of a problem that is actually related to solving difficulty is used as a cue for solving ease when assessing the problem in the first place. For anagrams, it is an established effect that easy-to-pronounce anagrams (e.g., NOGAL) take more time to being solved than hard-to-pronounce anagrams (e.g., HNWEI). However, when assessing an anagram in the first place, individuals use the feature of pronounceability to predict solving ease, because pronounceability is an instantiation of the general mechanism of processing fluency. Participants (total N=536) received short and long anagrams and nonanagrams and judged solvability and solving ease intuitively without actually solving the items. Easy-to-pronounce letter strings were more frequently judged as being solvable than hard-to-pronounce letters strings (Experiment 1), and were estimated to require less effort (Experiments 2, 4-7) and time to be solved (Experiment 3). This effect was robust for short and long items, anagrams and nonanagrams, and presentation timings from 4 down to 0.5s, and affected novices and experts alike. Spontaneous solutions did not mediate this effect. Participants were sensitive to actual solvability even for long anagrams (6-11 letters long) presented only for 500 ms. Copyright © 2015 Elsevier B.V. All rights reserved.

Global Optimal Trajectory in Chaos and NP-Hardness

NASA Astrophysics Data System (ADS)

Latorre, Vittorio; Gao, David Yang

This paper presents an unconventional theory and method for solving general nonlinear dynamical systems. Instead of the direct iterative methods, the discretized nonlinear system is first formulated as a global optimization problem via the least squares method. A newly developed canonical duality theory shows that this nonconvex minimization problem can be solved deterministically in polynomial time if a global optimality condition is satisfied. The so-called pseudo-chaos produced by linear iterative methods are mainly due to the intrinsic numerical error accumulations. Otherwise, the global optimization problem could be NP-hard and the nonlinear system can be really chaotic. A conjecture is proposed, which reveals the connection between chaos in nonlinear dynamics and NP-hardness in computer science. The methodology and the conjecture are verified by applications to the well-known logistic equation, a forced memristive circuit and the Lorenz system. Computational results show that the canonical duality theory can be used to identify chaotic systems and to obtain realistic global optimal solutions in nonlinear dynamical systems. The method and results presented in this paper should bring some new insights into nonlinear dynamical systems and NP-hardness in computational complexity theory.

Alternative Fuels Data Center: Green Fueling Station Powers Fleets in

Science.gov Websites

, hard work, and problem solving. "We've faced a few hurdles along the way--meeting strict grant that all the hard work on grant applications, training, and planning continues to pay off. First, there

Performance comparison of some evolutionary algorithms on job shop scheduling problems

NASA Astrophysics Data System (ADS)

Mishra, S. K.; Rao, C. S. P.

2016-09-01

Job Shop Scheduling as a state space search problem belonging to NP-hard category due to its complexity and combinational explosion of states. Several naturally inspire evolutionary methods have been developed to solve Job Shop Scheduling Problems. In this paper the evolutionary methods namely Particles Swarm Optimization, Artificial Intelligence, Invasive Weed Optimization, Bacterial Foraging Optimization, Music Based Harmony Search Algorithms are applied and find tuned to model and solve Job Shop Scheduling Problems. To compare about 250 Bench Mark instances have been used to evaluate the performance of these algorithms. The capabilities of each these algorithms in solving Job Shop Scheduling Problems are outlined.

Comparing genetic algorithm and particle swarm optimization for solving capacitated vehicle routing problem

NASA Astrophysics Data System (ADS)

Iswari, T.; Asih, A. M. S.

2018-04-01

In the logistics system, transportation plays an important role to connect every element in the supply chain, but it can produces the greatest cost. Therefore, it is important to make the transportation costs as minimum as possible. Reducing the transportation cost can be done in several ways. One of the ways to minimizing the transportation cost is by optimizing the routing of its vehicles. It refers to Vehicle Routing Problem (VRP). The most common type of VRP is Capacitated Vehicle Routing Problem (CVRP). In CVRP, the vehicles have their own capacity and the total demands from the customer should not exceed the capacity of the vehicle. CVRP belongs to the class of NP-hard problems. These NP-hard problems make it more complex to solve such that exact algorithms become highly time-consuming with the increases in problem sizes. Thus, for large-scale problem instances, as typically found in industrial applications, finding an optimal solution is not practicable. Therefore, this paper uses two kinds of metaheuristics approach to solving CVRP. Those are Genetic Algorithm and Particle Swarm Optimization. This paper compares the results of both algorithms and see the performance of each algorithm. The results show that both algorithms perform well in solving CVRP but still needs to be improved. From algorithm testing and numerical example, Genetic Algorithm yields a better solution than Particle Swarm Optimization in total distance travelled.

Empirical results on scheduling and dynamic backtracking

NASA Technical Reports Server (NTRS)

Boddy, Mark S.; Goldman, Robert P.

1994-01-01

At the Honeywell Technology Center (HTC), we have been working on a scheduling problem related to commercial avionics. This application is large, complex, and hard to solve. To be a little more concrete: 'large' means almost 20,000 activities, 'complex' means several activity types, periodic behavior, and assorted types of temporal constraints, and 'hard to solve' means that we have been unable to eliminate backtracking through the use of search heuristics. At this point, we can generate solutions, where solutions exist, or report failure and sometimes why the system failed. To the best of our knowledge, this is among the largest and most complex scheduling problems to have been solved as a constraint satisfaction problem, at least that has appeared in the published literature. This abstract is a preliminary report on what we have done and how. In the next section, we present our approach to treating scheduling as a constraint satisfaction problem. The following sections present the application in more detail and describe how we solve scheduling problems in the application domain. The implemented system makes use of Ginsberg's Dynamic Backtracking algorithm, with some minor extensions to improve its utility for scheduling. We describe those extensions and the performance of the resulting system. The paper concludes with some general remarks, open questions and plans for future work.

Design and implementation of reliability evaluation of SAS hard disk based on RAID card

NASA Astrophysics Data System (ADS)

Ren, Shaohua; Han, Sen

2015-10-01

Because of the huge advantage of RAID technology in storage, it has been widely used. However, the question associated with this technology is that the hard disk based on the RAID card can not be queried by Operating System. Therefore how to read the self-information and log data of hard disk has been a problem, while this data is necessary for reliability test of hard disk. In traditional way, this information can be read just suitable for SATA hard disk, but not for SAS hard disk. In this paper, we provide a method by using LSI RAID card's Application Program Interface, communicating with RAID card and analyzing the feedback data to solve the problem. Then we will get the necessary information to assess the SAS hard disk.

Smell Detection Agent Based Optimization Algorithm

NASA Astrophysics Data System (ADS)

Vinod Chandra, S. S.

2016-09-01

In this paper, a novel nature-inspired optimization algorithm has been employed and the trained behaviour of dogs in detecting smell trails is adapted into computational agents for problem solving. The algorithm involves creation of a surface with smell trails and subsequent iteration of the agents in resolving a path. This algorithm can be applied in different computational constraints that incorporate path-based problems. Implementation of the algorithm can be treated as a shortest path problem for a variety of datasets. The simulated agents have been used to evolve the shortest path between two nodes in a graph. This algorithm is useful to solve NP-hard problems that are related to path discovery. This algorithm is also useful to solve many practical optimization problems. The extensive derivation of the algorithm can be enabled to solve shortest path problems.

Artificial immune algorithm for multi-depot vehicle scheduling problems

NASA Astrophysics Data System (ADS)

Wu, Zhongyi; Wang, Donggen; Xia, Linyuan; Chen, Xiaoling

2008-10-01

In the fast-developing logistics and supply chain management fields, one of the key problems in the decision support system is that how to arrange, for a lot of customers and suppliers, the supplier-to-customer assignment and produce a detailed supply schedule under a set of constraints. Solutions to the multi-depot vehicle scheduling problems (MDVRP) help in solving this problem in case of transportation applications. The objective of the MDVSP is to minimize the total distance covered by all vehicles, which can be considered as delivery costs or time consumption. The MDVSP is one of nondeterministic polynomial-time hard (NP-hard) problem which cannot be solved to optimality within polynomial bounded computational time. Many different approaches have been developed to tackle MDVSP, such as exact algorithm (EA), one-stage approach (OSA), two-phase heuristic method (TPHM), tabu search algorithm (TSA), genetic algorithm (GA) and hierarchical multiplex structure (HIMS). Most of the methods mentioned above are time consuming and have high risk to result in local optimum. In this paper, a new search algorithm is proposed to solve MDVSP based on Artificial Immune Systems (AIS), which are inspirited by vertebrate immune systems. The proposed AIS algorithm is tested with 30 customers and 6 vehicles located in 3 depots. Experimental results show that the artificial immune system algorithm is an effective and efficient method for solving MDVSP problems.

Analysis the Purposes of Land Use Planning on the Hard Coal Tailing Dumps

NASA Astrophysics Data System (ADS)

Zástĕrová, Petra; Niemiec, Dominik; Marschalko, Marian; Durd'ák, Jan; Duraj, Miloš; Yilmaz, Işik; Drusa, Marian

2016-10-01

The aim of this publication is to analyse the purposes of land use planning on hard coal tailing dumps. This issue is very topical because there are 46 tailing dumps and 281 reservoirs in the Ostrava-Karvina Mining District. They significantly affect the landscape of this region. A major problem is solving problems of reclamation of these geological environment. This means that it is necessary to think about it and start to solve it. It is clear that such reclamation is not simple both economic as well as environmental point of view. It is necessary to think carefully about what purpose would be tailing dump or reservoirs to utilize in a given location.

Improved Monkey-King Genetic Algorithm for Solving Large Winner Determination in Combinatorial Auction

NASA Astrophysics Data System (ADS)

Li, Yuzhong

Using GA solve the winner determination problem (WDP) with large bids and items, run under different distribution, because the search space is large, constraint complex and it may easy to produce infeasible solution, would affect the efficiency and quality of algorithm. This paper present improved MKGA, including three operator: preprocessing, insert bid and exchange recombination, and use Monkey-king elite preservation strategy. Experimental results show that improved MKGA is better than SGA in population size and computation. The problem that traditional branch and bound algorithm hard to solve, improved MKGA can solve and achieve better effect.

Graphical models for optimal power flow

DOE PAGES

Dvijotham, Krishnamurthy; Chertkov, Michael; Van Hentenryck, Pascal; ...

2016-09-13

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithmmore » for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.« less

A Volunteer Computing Project for Solving Geoacoustic Inversion Problems

NASA Astrophysics Data System (ADS)

Zaikin, Oleg; Petrov, Pavel; Posypkin, Mikhail; Bulavintsev, Vadim; Kurochkin, Ilya

2017-12-01

A volunteer computing project aimed at solving computationally hard inverse problems in underwater acoustics is described. This project was used to study the possibilities of the sound speed profile reconstruction in a shallow-water waveguide using a dispersion-based geoacoustic inversion scheme. The computational capabilities provided by the project allowed us to investigate the accuracy of the inversion for different mesh sizes of the sound speed profile discretization grid. This problem suits well for volunteer computing because it can be easily decomposed into independent simpler subproblems.

On unified modeling, theory, and method for solving multi-scale global optimization problems

NASA Astrophysics Data System (ADS)

Gao, David Yang

2016-10-01

A unified model is proposed for general optimization problems in multi-scale complex systems. Based on this model and necessary assumptions in physics, the canonical duality theory is presented in a precise way to include traditional duality theories and popular methods as special applications. Two conjectures on NP-hardness are proposed, which should play important roles for correctly understanding and efficiently solving challenging real-world problems. Applications are illustrated for both nonconvex continuous optimization and mixed integer nonlinear programming.

Reply to "Comment on 'Calculations for the one-dimensional soft Coulomb problem and the hard Coulomb limit' ".

PubMed

Gebremedhin, Daniel H; Weatherford, Charles A

2015-02-01

This is a response to the comment we received on our recent paper "Calculations for the one-dimensional soft Coulomb problem and the hard Coulomb limit." In that paper, we introduced a computational algorithm that is appropriate for solving stiff initial value problems, and which we applied to the one-dimensional time-independent Schrödinger equation with a soft Coulomb potential. We solved for the eigenpairs using a shooting method and hence turned it into an initial value problem. In particular, we examined the behavior of the eigenpairs as the softening parameter approached zero (hard Coulomb limit). The commenters question the existence of the ground state of the hard Coulomb potential, which we inferred by extrapolation of the softening parameter to zero. A key distinction between the commenters' approach and ours is that they consider only the half-line while we considered the entire x axis. Based on mathematical considerations, the commenters consider only a vanishing solution function at the origin, and they question our conclusion that the ground state of the hard Coulomb potential exists. The ground state we inferred resembles a δ(x), and hence it cannot even be addressed based on their argument. For the excited states, there is agreement with the fact that the particle is always excluded from the origin. Our discussion with regard to the symmetry of the excited states is an extrapolation of the soft Coulomb case and is further explained herein.

Quantum Computing: Solving Complex Problems

ScienceCinema

DiVincenzo, David

2018-05-22

One of the motivating ideas of quantum computation was that there could be a new kind of machine that would solve hard problems in quantum mechanics. There has been significant progress towards the experimental realization of these machines (which I will review), but there are still many questions about how such a machine could solve computational problems of interest in quantum physics. New categorizations of the complexity of computational problems have now been invented to describe quantum simulation. The bad news is that some of these problems are believed to be intractable even on a quantum computer, falling into a quantum analog of the NP class. The good news is that there are many other new classifications of tractability that may apply to several situations of physical interest.

The effects of expected reward on creative problem solving.

PubMed

Cristofori, Irene; Salvi, Carola; Beeman, Mark; Grafman, Jordan

2018-06-12

Creative problem solving involves search processes, and it is known to be hard to motivate. Reward cues have been found to enhance performance across a range of tasks, even when cues are presented subliminally, without being consciously detected. It is uncertain whether motivational processes, such as reward, can influence problem solving. We tested the effect of supraliminal and subliminal reward on participant performance on problem solving that can be solved by deliberate analysis or by insight. Forty-one participants attempted to solve 100 compound remote associate problems. At the beginning of each problem, a potential reward cue (1 or 25 cents) was displayed, either subliminally (17 ms) or supraliminally (100 ms). Participants earned the displayed reward if they solved the problem correctly. Results showed that the higher subliminal reward increased the percentage of problems solved correctly overall. Second, we explored if subliminal rewards preferentially influenced solutions that were achieved via a sudden insight (mostly processed below awareness) or via a deliberate analysis. Participants solved more problems via insight following high subliminal reward when compared with low subliminal reward, and compared with high supraliminal reward, with no corresponding effect on analytic solving. Striatal dopamine (DA) is thought to influence motivation, reinforce behavior, and facilitate cognition. We speculate that subliminal rewards activate the striatal DA system, enhancing the kinds of automatic integrative processes that lead to more creative strategies for problem solving, without increasing the selectivity of attention, which could impede insight.

The Math Gap: a description of the mathematics performance of preschool-aged deaf/hard-of-hearing children.

PubMed

Pagliaro, Claudia M; Kritzer, Karen L

2013-04-01

Over decades and across grade levels, deaf/hard-of-hearing (d/hh) student performance in mathematics has shown a gap in achievement. It is unclear, however, exactly when this gap begins to emerge and in what areas. This study describes preschool d/hh children's knowledge of early mathematics concepts. Both standardized and nonstandardized measures were used to assess understanding in number, geometry, measurement, problem solving, and patterns, reasoning and algebra. Results present strong evidence that d/hh students' difficulty in mathematics may begin prior to the start of formal schooling. Findings also show areas of strength (geometry) and weakness (problem solving and measurement) for these children. Evidence of poor foundational performance may relate to later academic achievement.

A New Approach for Solving the Generalized Traveling Salesman Problem

NASA Astrophysics Data System (ADS)

Pop, P. C.; Matei, O.; Sabo, C.

The generalized traveling problem (GTSP) is an extension of the classical traveling salesman problem. The GTSP is known to be an NP-hard problem and has many interesting applications. In this paper we present a local-global approach for the generalized traveling salesman problem. Based on this approach we describe a novel hybrid metaheuristic algorithm for solving the problem using genetic algorithms. Computational results are reported for Euclidean TSPlib instances and compared with the existing ones. The obtained results point out that our hybrid algorithm is an appropriate method to explore the search space of this complex problem and leads to good solutions in a reasonable amount of time.

Acquiring Information from Wider Scope to Improve Event Extraction

DTIC Science & Technology

2012-05-01

solve all the problems might be hard or even impossible: Word sense disambiguation is already a hard NLP task, and normalizing different expressions...blindfolded woman seen being shot in the head by a hooded militant on a video obtained but not aired by the Arab television station Al-Jazeera. She...imbalance Why are we interested in unsupervised topic features? There is a problem that arises in the evaluation of almost all the tasks in NLP , concerning

Parceling the Power.

ERIC Educational Resources Information Center

Hiatt, Blanchard; Gwynne, Peter

1984-01-01

To make computing power broadly available and truly friendly, both soft and hard meshing and synchronization problems will have to be solved. Possible solutions and research related to these problems are discussed. Topics considered include compilers, parallelism, networks, distributed sensors, dataflow, CEDAR system (using dataflow principles),…

A similarity score-based two-phase heuristic approach to solve the dynamic cellular facility layout for manufacturing systems

NASA Astrophysics Data System (ADS)

Kumar, Ravi; Singh, Surya Prakash

2017-11-01

The dynamic cellular facility layout problem (DCFLP) is a well-known NP-hard problem. It has been estimated that the efficient design of DCFLP reduces the manufacturing cost of products by maintaining the minimum material flow among all machines in all cells, as the material flow contributes around 10-30% of the total product cost. However, being NP hard, solving the DCFLP optimally is very difficult in reasonable time. Therefore, this article proposes a novel similarity score-based two-phase heuristic approach to solve the DCFLP optimally considering multiple products in multiple times to be manufactured in the manufacturing layout. In the first phase of the proposed heuristic, a machine-cell cluster is created based on similarity scores between machines. This is provided as an input to the second phase to minimize inter/intracell material handling costs and rearrangement costs over the entire planning period. The solution methodology of the proposed approach is demonstrated. To show the efficiency of the two-phase heuristic approach, 21 instances are generated and solved using the optimization software package LINGO. The results show that the proposed approach can optimally solve the DCFLP in reasonable time.

The checkpoint ordering problem

PubMed Central

Hungerländer, P.

2017-01-01

Abstract We suggest a new variant of a row layout problem: Find an ordering of n departments with given lengths such that the total weighted sum of their distances to a given checkpoint is minimized. The Checkpoint Ordering Problem (COP) is both of theoretical and practical interest. It has several applications and is conceptually related to some well-studied combinatorial optimization problems, namely the Single-Row Facility Layout Problem, the Linear Ordering Problem and a variant of parallel machine scheduling. In this paper we study the complexity of the (COP) and its special cases. The general version of the (COP) with an arbitrary but fixed number of checkpoints is NP-hard in the weak sense. We propose both a dynamic programming algorithm and an integer linear programming approach for the (COP) . Our computational experiments indicate that the (COP) is hard to solve in practice. While the run time of the dynamic programming algorithm strongly depends on the length of the departments, the integer linear programming approach is able to solve instances with up to 25 departments to optimality. PMID:29170574

Analysis of Algorithms: Coping with Hard Problems

ERIC Educational Resources Information Center

Kolata, Gina Bari

1974-01-01

Although today's computers can perform as many as one million operations per second, there are many problems that are still too large to be solved in a straightforward manner. Recent work indicates that many approximate solutions are useful and more efficient than exact solutions. (Author/RH)

Applications of Evolutionary Technology to Manufacturing and Logistics Systems : State-of-the Art Survey

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin

Many combinatorial optimization problems from industrial engineering and operations research in real-world are very complex in nature and quite hard to solve them by conventional techniques. Since the 1960s, there has been an increasing interest in imitating living beings to solve such kinds of hard combinatorial optimization problems. Simulating the natural evolutionary process of human beings results in stochastic optimization techniques called evolutionary algorithms (EAs), which can often outperform conventional optimization methods when applied to difficult real-world problems. In this survey paper, we provide a comprehensive survey of the current state-of-the-art in the use of EA in manufacturing and logistics systems. In order to demonstrate the EAs which are powerful and broadly applicable stochastic search and optimization techniques, we deal with the following engineering design problems: transportation planning models, layout design models and two-stage logistics models in logistics systems; job-shop scheduling, resource constrained project scheduling in manufacturing system.

A meta-heuristic method for solving scheduling problem: crow search algorithm

NASA Astrophysics Data System (ADS)

Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

2018-04-01

Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.

9.9 Sales Grid Style Produces Results

ERIC Educational Resources Information Center

Blake, Robert R.; Mouton, Jane Srygley

1970-01-01

Selling effectiveness experiments have provided evidence that solution selling (problem solving) produces far better results than formula selling (sales technique oriented), hard sell, people-oriented selling, or order taking. (PT)

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem.

PubMed

Pourhassan, Mojgan; Neumann, Frank

2018-06-22

The generalized travelling salesperson problem is an important NP-hard combinatorial optimization problem for which meta-heuristics, such as local search and evolutionary algorithms, have been used very successfully. Two hierarchical approaches with different neighbourhood structures, namely a Cluster-Based approach and a Node-Based approach, have been proposed by Hu and Raidl (2008) for solving this problem. In this paper, local search algorithms and simple evolutionary algorithms based on these approaches are investigated from a theoretical perspective. For local search algorithms, we point out the complementary abilities of the two approaches by presenting instances where they mutually outperform each other. Afterwards, we introduce an instance which is hard for both approaches when initialized on a particular point of the search space, but where a variable neighbourhood search combining them finds the optimal solution in polynomial time. Then we turn our attention to analysing the behaviour of simple evolutionary algorithms that use these approaches. We show that the Node-Based approach solves the hard instance of the Cluster-Based approach presented in Corus et al. (2016) in polynomial time. Furthermore, we prove an exponential lower bound on the optimization time of the Node-Based approach for a class of Euclidean instances.

Satisfiability Test with Synchronous Simulated Annealing on the Fujitsu AP1000 Massively-Parallel Multiprocessor

NASA Technical Reports Server (NTRS)

Sohn, Andrew; Biswas, Rupak

1996-01-01

Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially difficult due to the ratio of clauses to variables. This report presents a parallel synchronous simulated annealing method for solving the Random L-SAT Problem on a large-scale distributed-memory multiprocessor. In particular, we use a parallel synchronous simulated annealing procedure, called Generalized Speculative Computation, which guarantees the same decision sequence as sequential simulated annealing. To demonstrate the performance of the parallel method, we have selected problem instances varying in size from 100-variables/425-clauses to 5000-variables/21,250-clauses. Experimental results on the AP1000 multiprocessor indicate that our approach can satisfy 99.9 percent of the clauses while giving almost a 70-fold speedup on 500 processors.

A Comparison of Approaches for Solving Hard Graph-Theoretic Problems

DTIC Science & Technology

2015-04-29

can be converted to a quadratic unconstrained binary optimization ( QUBO ) problem that uses 0/1-valued variables, and so they are often used...Frontiers in Physics, 2:5 (12 Feb 2014). [7] “Programming with QUBOs ,” (instructional document) D-Wave: The Quantum Computing Company, 2013. [8

Optical solver of combinatorial problems: nanotechnological approach.

PubMed

Cohen, Eyal; Dolev, Shlomi; Frenkel, Sergey; Kryzhanovsky, Boris; Palagushkin, Alexandr; Rosenblit, Michael; Zakharov, Victor

2013-09-01

We present an optical computing system to solve NP-hard problems. As nano-optical computing is a promising venue for the next generation of computers performing parallel computations, we investigate the application of submicron, or even subwavelength, computing device designs. The system utilizes a setup of exponential sized masks with exponential space complexity produced in polynomial time preprocessing. The masks are later used to solve the problem in polynomial time. The size of the masks is reduced to nanoscaled density. Simulations were done to choose a proper design, and actual implementations show the feasibility of such a system.

Predicting protein structures with a multiplayer online game.

PubMed

Cooper, Seth; Khatib, Firas; Treuille, Adrien; Barbero, Janos; Lee, Jeehyung; Beenen, Michael; Leaver-Fay, Andrew; Baker, David; Popović, Zoran; Players, Foldit

2010-08-05

People exert large amounts of problem-solving effort playing computer games. Simple image- and text-recognition tasks have been successfully 'crowd-sourced' through games, but it is not clear if more complex scientific problems can be solved with human-directed computing. Protein structure prediction is one such problem: locating the biologically relevant native conformation of a protein is a formidable computational challenge given the very large size of the search space. Here we describe Foldit, a multiplayer online game that engages non-scientists in solving hard prediction problems. Foldit players interact with protein structures using direct manipulation tools and user-friendly versions of algorithms from the Rosetta structure prediction methodology, while they compete and collaborate to optimize the computed energy. We show that top-ranked Foldit players excel at solving challenging structure refinement problems in which substantial backbone rearrangements are necessary to achieve the burial of hydrophobic residues. Players working collaboratively develop a rich assortment of new strategies and algorithms; unlike computational approaches, they explore not only the conformational space but also the space of possible search strategies. The integration of human visual problem-solving and strategy development capabilities with traditional computational algorithms through interactive multiplayer games is a powerful new approach to solving computationally-limited scientific problems.

Hard X-ray (greater than 10 keV) telescope for space astronomy from the Moon

NASA Astrophysics Data System (ADS)

Frontera, F.; de Chiara, P.; Pasqualini, G.

1994-06-01

The use of the Moon as site for deep observations of astrophysical sources in hard X-rays (greater than 10 keV) is very exciting, in spite of several technological problems to be solved. A strong limitation to the sensitivity of hard X-ray experiments is imposed by the use of direct-viewing (with or without masks) detectors. We propose a lunar hard X-ray observatory, (LHEXO), that makes use of a hard X-ray concentrator which is based on the use of confocal paraboloidal mirrors made of mosaic crystals of graphite (002). In this paper we describe telescope concept and its expected performances.

Trading a Problem-solving Task

NASA Astrophysics Data System (ADS)

Matsubara, Shigeo

This paper focuses on a task allocation problem, especially cases where the task is to find a solution in a search problem or a constraint satisfaction problem. If the search problem is hard to solve, a contractor may fail to find a solution. Here, the more computational resources such as the CPU time the contractor invests in solving the search problem, the more a solution is likely to be found. This brings about a new problem that a contractee has to find an appropriate level of the quality in a task achievement as well as to find an efficient allocation of a task among contractors. For example, if the contractee asks the contractor to find a solution with certainty, the payment from the contractee to the contractor may exceed the contractee's benefit from obtaining a solution, which discourages the contractee from trading a task. However, solving this problem is difficult because the contractee cannot ascertain the contractor's problem-solving ability such as the amount of available resources and knowledge (e.g. algorithms, heuristics) or monitor what amount of resources are actually invested in solving the allocated task. To solve this problem, we propose a task allocation mechanism that is able to choose an appropriate level of the quality in a task achievement and prove that this mechanism guarantees that each contractor reveals its true information. Moreover, we show that our mechanism can increase the contractee's utility compared with a simple auction mechanism by using computer simulation.

A Theoretical Analysis: Physical Unclonable Functions and The Software Protection Problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nithyanand, Rishab; Solis, John H.

2011-09-01

Physical Unclonable Functions (PUFs) or Physical One Way Functions (P-OWFs) are physical systems whose responses to input stimuli (i.e., challenges) are easy to measure (within reasonable error bounds) but hard to clone. This property of unclonability is due to the accepted hardness of replicating the multitude of uncontrollable manufacturing characteristics and makes PUFs useful in solving problems such as device authentication, software protection, licensing, and certified execution. In this paper, we focus on the effectiveness of PUFs for software protection and show that traditional non-computational (black-box) PUFs cannot solve the problem against real world adversaries in offline settings. Our contributionsmore » are the following: We provide two real world adversary models (weak and strong variants) and present definitions for security against the adversaries. We continue by proposing schemes secure against the weak adversary and show that no scheme is secure against a strong adversary without the use of trusted hardware. Finally, we present a protection scheme secure against strong adversaries based on trusted hardware.« less

An improved genetic algorithm and its application in the TSP problem

NASA Astrophysics Data System (ADS)

Li, Zheng; Qin, Jinlei

2011-12-01

Concept and research actuality of genetic algorithm are introduced in detail in the paper. Under this condition, the simple genetic algorithm and an improved algorithm are described and applied in an example of TSP problem, where the advantage of genetic algorithm is adequately shown in solving the NP-hard problem. In addition, based on partial matching crossover operator, the crossover operator method is improved into extended crossover operator in order to advance the efficiency when solving the TSP. In the extended crossover method, crossover operator can be performed between random positions of two random individuals, which will not be restricted by the position of chromosome. Finally, the nine-city TSP is solved using the improved genetic algorithm with extended crossover method, the efficiency of whose solution process is much higher, besides, the solving speed of the optimal solution is much faster.

Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

PubMed Central

Martín H., José Antonio

2013-01-01

Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular biology, e.g., genome sequencing; global alignment of multiple genomes; identifying siblings or discovery of dysregulated pathways. In almost all of these problems, there is the need for proving a hypothesis about certain property of an object that can be present if and only if it adopts some particular admissible structure (an NP-certificate) or be absent (no admissible structure), however, none of the standard approaches can discard the hypothesis when no solution can be found, since none can provide a proof that there is no admissible structure. This article presents an algorithm that introduces a novel type of solution method to “efficiently” solve the graph 3-coloring problem; an NP-complete problem. The proposed method provides certificates (proofs) in both cases: present or absent, so it is possible to accept or reject the hypothesis on the basis of a rigorous proof. It provides exact solutions and is polynomial-time (i.e., efficient) however parametric. The only requirement is sufficient computational power, which is controlled by the parameter . Nevertheless, here it is proved that the probability of requiring a value of to obtain a solution for a random graph decreases exponentially: , making tractable almost all problem instances. Thorough experimental analyses were performed. The algorithm was tested on random graphs, planar graphs and 4-regular planar graphs. The obtained experimental results are in accordance with the theoretical expected results. PMID:23349711

Characterizing L1-norm best-fit subspaces

NASA Astrophysics Data System (ADS)

Brooks, J. Paul; Dulá, José H.

2017-05-01

Fitting affine objects to data is the basis of many tools and methodologies in statistics, machine learning, and signal processing. The L1 norm is often employed to produce subspaces exhibiting a robustness to outliers and faulty observations. The L1-norm best-fit subspace problem is directly formulated as a nonlinear, nonconvex, and nondifferentiable optimization problem. The case when the subspace is a hyperplane can be solved to global optimality efficiently by solving a series of linear programs. The problem of finding the best-fit line has recently been shown to be NP-hard. We present necessary conditions for optimality for the best-fit subspace problem, and use them to characterize properties of optimal solutions.

Soundoff: Mathematics Is Getting Easier.

ERIC Educational Resources Information Center

Usiskin, Zalman

1984-01-01

Teaching mathematics in hard ways, rather than using easier methods or technology, is described. Employing the most efficient means possible to solve a problem is the essence of good mathematics, rather than wasting time in practicing obsolete skills. (MNS)

Simulated annealing algorithm for solving chambering student-case assignment problem

NASA Astrophysics Data System (ADS)

Ghazali, Saadiah; Abdul-Rahman, Syariza

2015-12-01

The problem related to project assignment problem is one of popular practical problem that appear nowadays. The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased. This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem. The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. The problem of assigning chambering students to cases has never been addressed in the literature before. For the proposed problem, it is essential for law graduates to peruse in chambers before they are qualified to become legal counselor. Thus, assigning the chambering students to cases is a critically needed especially when involving many preferences. Hence, this study presents a preliminary study of the proposed project assignment problem. The objective of the study is to minimize the total completion time for all students in solving the given cases. This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution. The search then is preceded with a simulated annealing algorithm for further improvement of solution quality. The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. Hence, this research has demonstrated the advantages of solving project assignment problem by using metaheuristic techniques.

Block clustering based on difference of convex functions (DC) programming and DC algorithms.

PubMed

Le, Hoai Minh; Le Thi, Hoai An; Dinh, Tao Pham; Huynh, Van Ngai

2013-10-01

We investigate difference of convex functions (DC) programming and the DC algorithm (DCA) to solve the block clustering problem in the continuous framework, which traditionally requires solving a hard combinatorial optimization problem. DC reformulation techniques and exact penalty in DC programming are developed to build an appropriate equivalent DC program of the block clustering problem. They lead to an elegant and explicit DCA scheme for the resulting DC program. Computational experiments show the robustness and efficiency of the proposed algorithm and its superiority over standard algorithms such as two-mode K-means, two-mode fuzzy clustering, and block classification EM.

Programming and Tuning a Quantum Annealing Device to Solve Real World Problems

NASA Astrophysics Data System (ADS)

Perdomo-Ortiz, Alejandro; O'Gorman, Bryan; Fluegemann, Joseph; Smelyanskiy, Vadim

2015-03-01

Solving real-world applications with quantum algorithms requires overcoming several challenges, ranging from translating the computational problem at hand to the quantum-machine language to tuning parameters of the quantum algorithm that have a significant impact on the performance of the device. In this talk, we discuss these challenges, strategies developed to enhance performance, and also a more efficient implementation of several applications. Although we will focus on applications of interest to NASA's Quantum Artificial Intelligence Laboratory, the methods and concepts presented here apply to a broader family of hard discrete optimization problems, including those that occur in many machine-learning algorithms.

Ant colony optimization for solving university facility layout problem

NASA Astrophysics Data System (ADS)

Mohd Jani, Nurul Hafiza; Mohd Radzi, Nor Haizan; Ngadiman, Mohd Salihin

2013-04-01

Quadratic Assignment Problems (QAP) is classified as the NP hard problem. It has been used to model a lot of problem in several areas such as operational research, combinatorial data analysis and also parallel and distributed computing, optimization problem such as graph portioning and Travel Salesman Problem (TSP). In the literature, researcher use exact algorithm, heuristics algorithm and metaheuristic approaches to solve QAP problem. QAP is largely applied in facility layout problem (FLP). In this paper we used QAP to model university facility layout problem. There are 8 facilities that need to be assigned to 8 locations. Hence we have modeled a QAP problem with n ≤ 10 and developed an Ant Colony Optimization (ACO) algorithm to solve the university facility layout problem. The objective is to assign n facilities to n locations such that the minimum product of flows and distances is obtained. Flow is the movement from one to another facility, whereas distance is the distance between one locations of a facility to other facilities locations. The objective of the QAP is to obtain minimum total walking (flow) of lecturers from one destination to another (distance).

Applying Graph Theory to Problems in Air Traffic Management

NASA Technical Reports Server (NTRS)

Farrahi, Amir Hossein; Goldbert, Alan; Bagasol, Leonard Neil; Jung, Jaewoo

2017-01-01

Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it is shown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

Applying Graph Theory to Problems in Air Traffic Management

NASA Technical Reports Server (NTRS)

Farrahi, Amir H.; Goldberg, Alan T.; Bagasol, Leonard N.; Jung, Jaewoo

2017-01-01

Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it isshown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics.

PubMed

Aono, Masashi; Naruse, Makoto; Kim, Song-Ju; Wakabayashi, Masamitsu; Hori, Hirokazu; Ohtsu, Motoichi; Hara, Masahiko

2013-06-18

Biologically inspired computing devices and architectures are expected to overcome the limitations of conventional technologies in terms of solving computationally demanding problems, adapting to complex environments, reducing energy consumption, and so on. We previously demonstrated that a primitive single-celled amoeba (a plasmodial slime mold), which exhibits complex spatiotemporal oscillatory dynamics and sophisticated computing capabilities, can be used to search for a solution to a very hard combinatorial optimization problem. We successfully extracted the essential spatiotemporal dynamics by which the amoeba solves the problem. This amoeba-inspired computing paradigm can be implemented by various physical systems that exhibit suitable spatiotemporal dynamics resembling the amoeba's problem-solving process. In this Article, we demonstrate that photoexcitation transfer phenomena in certain quantum nanostructures mediated by optical near-field interactions generate the amoebalike spatiotemporal dynamics and can be used to solve the satisfiability problem (SAT), which is the problem of judging whether a given logical proposition (a Boolean formula) is self-consistent. SAT is related to diverse application problems in artificial intelligence, information security, and bioinformatics and is a crucially important nondeterministic polynomial time (NP)-complete problem, which is believed to become intractable for conventional digital computers when the problem size increases. We show that our amoeba-inspired computing paradigm dramatically outperforms a conventional stochastic search method. These results indicate the potential for developing highly versatile nanoarchitectonic computers that realize powerful solution searching with low energy consumption.

Sequential Monte Carlo for Maximum Weight Subgraphs with Application to Solving Image Jigsaw Puzzles.

PubMed

Adluru, Nagesh; Yang, Xingwei; Latecki, Longin Jan

2015-05-01

We consider a problem of finding maximum weight subgraphs (MWS) that satisfy hard constraints in a weighted graph. The constraints specify the graph nodes that must belong to the solution as well as mutual exclusions of graph nodes, i.e., pairs of nodes that cannot belong to the same solution. Our main contribution is a novel inference approach for solving this problem in a sequential monte carlo (SMC) sampling framework. Usually in an SMC framework there is a natural ordering of the states of the samples. The order typically depends on observations about the states or on the annealing setup used. In many applications (e.g., image jigsaw puzzle problems), all observations (e.g., puzzle pieces) are given at once and it is hard to define a natural ordering. Therefore, we relax the assumption of having ordered observations about states and propose a novel SMC algorithm for obtaining maximum a posteriori estimate of a high-dimensional posterior distribution. This is achieved by exploring different orders of states and selecting the most informative permutations in each step of the sampling. Our experimental results demonstrate that the proposed inference framework significantly outperforms loopy belief propagation in solving the image jigsaw puzzle problem. In particular, our inference quadruples the accuracy of the puzzle assembly compared to that of loopy belief propagation.

Sequential Monte Carlo for Maximum Weight Subgraphs with Application to Solving Image Jigsaw Puzzles

PubMed Central

Adluru, Nagesh; Yang, Xingwei; Latecki, Longin Jan

2015-01-01

We consider a problem of finding maximum weight subgraphs (MWS) that satisfy hard constraints in a weighted graph. The constraints specify the graph nodes that must belong to the solution as well as mutual exclusions of graph nodes, i.e., pairs of nodes that cannot belong to the same solution. Our main contribution is a novel inference approach for solving this problem in a sequential monte carlo (SMC) sampling framework. Usually in an SMC framework there is a natural ordering of the states of the samples. The order typically depends on observations about the states or on the annealing setup used. In many applications (e.g., image jigsaw puzzle problems), all observations (e.g., puzzle pieces) are given at once and it is hard to define a natural ordering. Therefore, we relax the assumption of having ordered observations about states and propose a novel SMC algorithm for obtaining maximum a posteriori estimate of a high-dimensional posterior distribution. This is achieved by exploring different orders of states and selecting the most informative permutations in each step of the sampling. Our experimental results demonstrate that the proposed inference framework significantly outperforms loopy belief propagation in solving the image jigsaw puzzle problem. In particular, our inference quadruples the accuracy of the puzzle assembly compared to that of loopy belief propagation. PMID:26052182

Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem

PubMed Central

Molla-Alizadeh-Zavardehi, S.; Tavakkoli-Moghaddam, R.; Lotfi, F. Hosseinzadeh

2014-01-01

This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS), and simulated annealing (SA) frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms. PMID:24883359

Multiple-variable neighbourhood search for the single-machine total weighted tardiness problem

NASA Astrophysics Data System (ADS)

Chung, Tsui-Ping; Fu, Qunjie; Liao, Ching-Jong; Liu, Yi-Ting

2017-07-01

The single-machine total weighted tardiness (SMTWT) problem is a typical discrete combinatorial optimization problem in the scheduling literature. This problem has been proved to be NP hard and thus provides a challenging area for metaheuristics, especially the variable neighbourhood search algorithm. In this article, a multiple variable neighbourhood search (m-VNS) algorithm with multiple neighbourhood structures is proposed to solve the problem. Special mechanisms named matching and strengthening operations are employed in the algorithm, which has an auto-revising local search procedure to explore the solution space beyond local optimality. Two aspects, searching direction and searching depth, are considered, and neighbourhood structures are systematically exchanged. Experimental results show that the proposed m-VNS algorithm outperforms all the compared algorithms in solving the SMTWT problem.

People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours.

PubMed

Acuña, Daniel E; Parada, Víctor

2010-07-29

Humans need to solve computationally intractable problems such as visual search, categorization, and simultaneous learning and acting, yet an increasing body of evidence suggests that their solutions to instantiations of these problems are near optimal. Computational complexity advances an explanation to this apparent paradox: (1) only a small portion of instances of such problems are actually hard, and (2) successful heuristics exploit structural properties of the typical instance to selectively improve parts that are likely to be sub-optimal. We hypothesize that these two ideas largely account for the good performance of humans on computationally hard problems. We tested part of this hypothesis by studying the solutions of 28 participants to 28 instances of the Euclidean Traveling Salesman Problem (TSP). Participants were provided feedback on the cost of their solutions and were allowed unlimited solution attempts (trials). We found a significant improvement between the first and last trials and that solutions are significantly different from random tours that follow the convex hull and do not have self-crossings. More importantly, we found that participants modified their current better solutions in such a way that edges belonging to the optimal solution ("good" edges) were significantly more likely to stay than other edges ("bad" edges), a hallmark of structural exploitation. We found, however, that more trials harmed the participants' ability to tell good from bad edges, suggesting that after too many trials the participants "ran out of ideas." In sum, we provide the first demonstration of significant performance improvement on the TSP under repetition and feedback and evidence that human problem-solving may exploit the structure of hard problems paralleling behavior of state-of-the-art heuristics.

People Efficiently Explore the Solution Space of the Computationally Intractable Traveling Salesman Problem to Find Near-Optimal Tours

PubMed Central

Acuña, Daniel E.; Parada, Víctor

2010-01-01

Humans need to solve computationally intractable problems such as visual search, categorization, and simultaneous learning and acting, yet an increasing body of evidence suggests that their solutions to instantiations of these problems are near optimal. Computational complexity advances an explanation to this apparent paradox: (1) only a small portion of instances of such problems are actually hard, and (2) successful heuristics exploit structural properties of the typical instance to selectively improve parts that are likely to be sub-optimal. We hypothesize that these two ideas largely account for the good performance of humans on computationally hard problems. We tested part of this hypothesis by studying the solutions of 28 participants to 28 instances of the Euclidean Traveling Salesman Problem (TSP). Participants were provided feedback on the cost of their solutions and were allowed unlimited solution attempts (trials). We found a significant improvement between the first and last trials and that solutions are significantly different from random tours that follow the convex hull and do not have self-crossings. More importantly, we found that participants modified their current better solutions in such a way that edges belonging to the optimal solution (“good” edges) were significantly more likely to stay than other edges (“bad” edges), a hallmark of structural exploitation. We found, however, that more trials harmed the participants' ability to tell good from bad edges, suggesting that after too many trials the participants “ran out of ideas.” In sum, we provide the first demonstration of significant performance improvement on the TSP under repetition and feedback and evidence that human problem-solving may exploit the structure of hard problems paralleling behavior of state-of-the-art heuristics. PMID:20686597

Semiclassical approach to finite-temperature quantum annealing with trapped ions

NASA Astrophysics Data System (ADS)

Raventós, David; Graß, Tobias; Juliá-Díaz, Bruno; Lewenstein, Maciej

2018-05-01

Recently it has been demonstrated that an ensemble of trapped ions may serve as a quantum annealer for the number-partitioning problem [Nat. Commun. 7, 11524 (2016), 10.1038/ncomms11524]. This hard computational problem may be addressed by employing a tunable spin-glass architecture. Following the proposal of the trapped-ion annealer, we study here its robustness against thermal effects; that is, we investigate the role played by thermal phonons. For the efficient description of the system, we use a semiclassical approach, and benchmark it against the exact quantum evolution. The aim is to understand better and characterize how the quantum device approaches a solution of an otherwise difficult to solve NP-hard problem.

Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

NASA Astrophysics Data System (ADS)

Santosa, B.; Siswanto, N.; Fiqihesa

2018-04-01

This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

Structural qualia: a solution to the hard problem of consciousness.

PubMed

Loorits, Kristjan

2014-01-01

The hard problem of consciousness has been often claimed to be unsolvable by the methods of traditional empirical sciences. It has been argued that all the objects of empirical sciences can be fully analyzed in structural terms but that consciousness is (or has) something over and above its structure. However, modern neuroscience has introduced a theoretical framework in which also the apparently non-structural aspects of consciousness, namely the so called qualia or qualitative properties, can be analyzed in structural terms. That framework allows us to see qualia as something compositional with internal structures that fully determine their qualitative nature. Moreover, those internal structures can be identified which certain neural patterns. Thus consciousness as a whole can be seen as a complex neural pattern that misperceives some of its own highly complex structural properties as monadic and qualitative. Such neural pattern is analyzable in fully structural terms and thereby the hard problem is solved.

Structural qualia: a solution to the hard problem of consciousness

PubMed Central

Loorits, Kristjan

2014-01-01

The hard problem of consciousness has been often claimed to be unsolvable by the methods of traditional empirical sciences. It has been argued that all the objects of empirical sciences can be fully analyzed in structural terms but that consciousness is (or has) something over and above its structure. However, modern neuroscience has introduced a theoretical framework in which also the apparently non-structural aspects of consciousness, namely the so called qualia or qualitative properties, can be analyzed in structural terms. That framework allows us to see qualia as something compositional with internal structures that fully determine their qualitative nature. Moreover, those internal structures can be identified which certain neural patterns. Thus consciousness as a whole can be seen as a complex neural pattern that misperceives some of its own highly complex structural properties as monadic and qualitative. Such neural pattern is analyzable in fully structural terms and thereby the hard problem is solved. PMID:24672510

A restricted Steiner tree problem is solved by Geometric Method II

NASA Astrophysics Data System (ADS)

Lin, Dazhi; Zhang, Youlin; Lu, Xiaoxu

2013-03-01

The minimum Steiner tree problem has wide application background, such as transportation system, communication network, pipeline design and VISL, etc. It is unfortunately that the computational complexity of the problem is NP-hard. People are common to find some special problems to consider. In this paper, we first put forward a restricted Steiner tree problem, which the fixed vertices are in the same side of one line L and we find a vertex on L such the length of the tree is minimal. By the definition and the complexity of the Steiner tree problem, we know that the complexity of this problem is also Np-complete. In the part one, we have considered there are two fixed vertices to find the restricted Steiner tree problem. Naturally, we consider there are three fixed vertices to find the restricted Steiner tree problem. And we also use the geometric method to solve such the problem.

Strategies for Hard Times in Higher Education.

ERIC Educational Resources Information Center

Desfosses, Louis R.

1996-01-01

Planning and management strategies used in the private sector have practical applications for higher education in a period of systemic and organizational stress. Promising strategies include organizational delayering; employee empowerment; boundless thinking, problem-solving teams; accelerated processes; quality management and improvement; and…

An Integer Programming Model For Solving Heterogeneous Vehicle Routing Problem With Hard Time Window considering Service Choice

NASA Astrophysics Data System (ADS)

Susilawati, Enny; Mawengkang, Herman; Efendi, Syahril

2018-01-01

Generally a Vehicle Routing Problem with time windows (VRPTW) can be defined as a problem to determine the optimal set of routes used by a fleet of vehicles to serve a given set of customers with service time restrictions; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the fleet of vehicle is heterogenic due to the different size of demand from customers. The problem, called Heterogeneous VRP (HVRP) also includes service levels. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.

Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance

PubMed Central

Li, Zhaokai; Yung, Man-Hong; Chen, Hongwei; Lu, Dawei; Whitfield, James D.; Peng, Xinhua; Aspuru-Guzik, Alán; Du, Jiangfeng

2011-01-01

Quantum ground-state problems are computationally hard problems for general many-body Hamiltonians; there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating the ground state is available, as often happens for many problems in physics and chemistry, a quantum computer could employ this trial wavefunction to project the ground state by means of the phase estimation algorithm (PEA). We performed an experimental realization of this idea by implementing a variational-wavefunction approach to solve the ground-state problem of the Heisenberg spin model with an NMR quantum simulator. Our iterative phase estimation procedure yields a high accuracy for the eigenenergies (to the 10−5 decimal digit). The ground-state fidelity was distilled to be more than 80%, and the singlet-to-triplet switching near the critical field is reliably captured. This result shows that quantum simulators can better leverage classical trial wave functions than classical computers PMID:22355607

Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm

NASA Astrophysics Data System (ADS)

Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Wang, Ling; Yang, Shanlin

2016-03-01

Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of ?. Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.

Fast optimization algorithms and the cosmological constant

NASA Astrophysics Data System (ADS)

Bao, Ning; Bousso, Raphael; Jordan, Stephen; Lackey, Brad

2017-11-01

Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of a problem that is hard for the complexity class NP (Nondeterministic Polynomial-time). The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable Universe. Here we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10-120 in a randomly generated 1 09-dimensional Arkani-Hamed-Dimopoulos-Kachru landscape.

Heterogeneous quantum computing for satellite constellation optimization: solving the weighted k-clique problem

NASA Astrophysics Data System (ADS)

Bass, Gideon; Tomlin, Casey; Kumar, Vaibhaw; Rihaczek, Pete; Dulny, Joseph, III

2018-04-01

NP-hard optimization problems scale very rapidly with problem size, becoming unsolvable with brute force methods, even with supercomputing resources. Typically, such problems have been approximated with heuristics. However, these methods still take a long time and are not guaranteed to find an optimal solution. Quantum computing offers the possibility of producing significant speed-up and improved solution quality. Current quantum annealing (QA) devices are designed to solve difficult optimization problems, but they are limited by hardware size and qubit connectivity restrictions. We present a novel heterogeneous computing stack that combines QA and classical machine learning, allowing the use of QA on problems larger than the hardware limits of the quantum device. These results represent experiments on a real-world problem represented by the weighted k-clique problem. Through this experiment, we provide insight into the state of quantum machine learning.

Linear solver performance in elastoplastic problem solution on GPU cluster

NASA Astrophysics Data System (ADS)

Khalevitsky, Yu. V.; Konovalov, A. V.; Burmasheva, N. V.; Partin, A. S.

2017-12-01

Applying the finite element method to severe plastic deformation problems involves solving linear equation systems. While the solution procedure is relatively hard to parallelize and computationally intensive by itself, a long series of large scale systems need to be solved for each problem. When dealing with fine computational meshes, such as in the simulations of three-dimensional metal matrix composite microvolume deformation, tens and hundreds of hours may be needed to complete the whole solution procedure, even using modern supercomputers. In general, one of the preconditioned Krylov subspace methods is used in a linear solver for such problems. The method convergence highly depends on the operator spectrum of a problem stiffness matrix. In order to choose the appropriate method, a series of computational experiments is used. Different methods may be preferable for different computational systems for the same problem. In this paper we present experimental data obtained by solving linear equation systems from an elastoplastic problem on a GPU cluster. The data can be used to substantiate the choice of the appropriate method for a linear solver to use in severe plastic deformation simulations.

Some insights on hard quadratic assignment problem instances

NASA Astrophysics Data System (ADS)

Hussin, Mohamed Saifullah

2017-11-01

Since the formal introduction of metaheuristics, a huge number Quadratic Assignment Problem (QAP) instances have been introduced. Those instances however are loosely-structured, and therefore made it difficult to perform any systematic analysis. The QAPLIB for example, is a library that contains a huge number of QAP benchmark instances that consists of instances with different size and structure, but with a very limited availability for every instance type. This prevents researchers from performing organized study on those instances, such as parameter tuning and testing. In this paper, we will discuss several hard instances that have been introduced over the years, and algorithms that have been used for solving them.

Acoustic scattering on spheroidal shapes near boundaries

NASA Astrophysics Data System (ADS)

Miloh, Touvia

2016-11-01

A new expression for the Lamé product of prolate spheroidal wave functions is presented in terms of a distribution of multipoles along the axis of the spheroid between its foci (generalizing a corresponding theorem for spheroidal harmonics). Such an "ultimate" singularity system can be effectively used for solving various linear boundary-value problems governed by the Helmholtz equation involving prolate spheroidal bodies near planar or other boundaries. The general methodology is formally demonstrated for the axisymmetric acoustic scattering problem of a rigid (hard) spheroid placed near a hard/soft wall or inside a cylindrical duct under an axial incidence of a plane acoustic wave.

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

NASA Astrophysics Data System (ADS)

Gutin, Gregory; Kim, Eun Jung; Soleimanfallah, Arezou; Szeider, Stefan; Yeo, Anders

The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if the given graph is bipartite with partition U ⊎ V, and each vertex in U is assigned the list {1}; this subproblem appears in the context of constraint programming as the consistency problem for the extended global cardinality constraint. We show that this subproblem is fixed-parameter tractable when parameterized by the size of the second partite set V. More generally, we show that the general factor problem for bipartite graphs, parameterized by |V |, is fixed-parameter tractable as long as all vertices in U are assigned lists of length 1, but becomes W[1]-hard if vertices in U are assigned lists of length at most 2. We establish fixed-parameter tractability by reducing the problem instance to a bounded number of acyclic instances, each of which can be solved in polynomial time by dynamic programming.

Planning perception and action for cognitive mobile manipulators

NASA Astrophysics Data System (ADS)

Gaschler, Andre; Nogina, Svetlana; Petrick, Ronald P. A.; Knoll, Alois

2013-12-01

We present a general approach to perception and manipulation planning for cognitive mobile manipulators. Rather than hard-coding single purpose robot applications, a robot should be able to reason about its basic skills in order to solve complex problems autonomously. Humans intuitively solve tasks in real-world scenarios by breaking down abstract problems into smaller sub-tasks and use heuristics based on their previous experience. We apply a similar idea for planning perception and manipulation to cognitive mobile robots. Our approach is based on contingent planning and run-time sensing, integrated in our knowledge of volumes" planning framework, called KVP. Using the general-purpose PKS planner, we model information-gathering actions at plan time that have multiple possible outcomes at run time. As a result, perception and sensing arise as necessary preconditions for manipulation, rather than being hard-coded as tasks themselves. We demonstrate the e ectiveness of our approach on two scenarios covering visual and force sensing on a real mobile manipulator.

Mathematics reform in the education of deaf and hard of hearing students.

PubMed

Pagliaro, C M

1998-03-01

In response to increased demand for competent workers who possess skills in problem solving, cooperative work, and technology, education professionals have set out to reform mathematics education. The purpose of the present study was to determine the state of mathematics reform in the education of deaf and hard of hearing students. A national survey was sent to administrators and faculty at schools for the Deaf seeking information on mathematics programs and instruction. Data were analyzed by profession (i.e., administrator, teacher) and grade level (K-4, 5-8, 9-12). Results show that some aspects of reform (e.g., problem solving, use of concrete materials) have been incorporated into the deaf education mathematics curriculum but that many 'traditional' techniques (e.g., drill and practice, rote memorization) remain in use. Data support the need for increased attention to mathematics education reform within deaf education. Recommendations are provided to professionals in the field to better prepare students for the 21st century.

A Benders based rolling horizon algorithm for a dynamic facility location problem

DOE PAGES

Marufuzzaman,, Mohammad; Gedik, Ridvan; Roni, Mohammad S.

2016-06-28

This study presents a well-known capacitated dynamic facility location problem (DFLP) that satisfies the customer demand at a minimum cost by determining the time period for opening, closing, or retaining an existing facility in a given location. To solve this challenging NP-hard problem, this paper develops a unique hybrid solution algorithm that combines a rolling horizon algorithm with an accelerated Benders decomposition algorithm. Extensive computational experiments are performed on benchmark test instances to evaluate the hybrid algorithm’s efficiency and robustness in solving the DFLP problem. Computational results indicate that the hybrid Benders based rolling horizon algorithm consistently offers high qualitymore » feasible solutions in a much shorter computational time period than the standalone rolling horizon and accelerated Benders decomposition algorithms in the experimental range.« less

Does Supporting Multiple Student Strategies Lead to Greater Learning and Motivation? Investigating a Source of Complexity in the Architecture of Intelligent Tutoring Systems

ERIC Educational Resources Information Center

Waalkens, Maaike; Aleven, Vincent; Taatgen, Niels

2013-01-01

Intelligent tutoring systems (ITS) support students in learning a complex problem-solving skill. One feature that makes an ITS architecturally complex, and hard to build, is support for strategy freedom, that is, the ability to let students pursue multiple solution strategies within a given problem. But does greater freedom mean that students…

Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks

NASA Astrophysics Data System (ADS)

Din, Der-Rong; Huang, Jen-Shen

2014-03-01

As networks grow in size and complexity, the chance and the impact of failures increase dramatically. The pre-allocated backup resources cannot provide 100% protection guarantee when continuous failures occur in a network. In this paper, the multicast backup re-provisioning problem (MBRP) for Hamiltonian cycle (HC)-based protection on WDM networks for the link-failure case is studied. We focus on how to recover the protecting capabilities of Hamiltonian cycle against the subsequent link-failures on WDM networks for multicast transmissions, after recovering the multicast trees affected by the previous link-failure. Since this problem is a hard problem, an algorithm, which consists of several heuristics and a genetic algorithm (GA), is proposed to solve it. The simulation results of the proposed method are also given. Experimental results indicate that the proposed algorithm can solve this problem efficiently.

On the Hardness of Subset Sum Problem from Different Intervals

NASA Astrophysics Data System (ADS)

Kogure, Jun; Kunihiro, Noboru; Yamamoto, Hirosuke

The subset sum problem, which is often called as the knapsack problem, is known as an NP-hard problem, and there are several cryptosystems based on the problem. Assuming an oracle for shortest vector problem of lattice, the low-density attack algorithm by Lagarias and Odlyzko and its variants solve the subset sum problem efficiently, when the “density” of the given problem is smaller than some threshold. When we define the density in the context of knapsack-type cryptosystems, weights are usually assumed to be chosen uniformly at random from the same interval. In this paper, we focus on general subset sum problems, where this assumption may not hold. We assume that weights are chosen from different intervals, and make analysis of the effect on the success probability of above algorithms both theoretically and experimentally. Possible application of our result in the context of knapsack cryptosystems is the security analysis when we reduce the data size of public keys.

Some Very Hard Problems in Nature (Biology-biochemistry) Solved Using Physical Algorithms that Reduce the Hardness

DTIC Science & Technology

2008-09-18

unclassified Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 Cooperativity at the monomolecular level binding of B or C to the common...alloo- steric effectors such as 2,3- diphosphoglycerate . The theoreti· cal relation between the two coefficients in_ the presence of 2.,3...d.iphosphoglycerate is derived •. Experimental _data on the variation of both coefficients with diphosphoglycerate con· centration are presented and shown to be

Disfluent fonts don't help people solve math problems.

PubMed

Meyer, Andrew; Frederick, Shane; Burnham, Terence C; Guevara Pinto, Juan D; Boyer, Ty W; Ball, Linden J; Pennycook, Gordon; Ackerman, Rakefet; Thompson, Valerie A; Schuldt, Jonathon P

2015-04-01

Prior research suggests that reducing font clarity can cause people to consider printed information more carefully. The most famous demonstration showed that participants were more likely to solve counterintuitive math problems when they were printed in hard-to-read font. However, after pooling data from that experiment with 16 attempts to replicate it, we find no effect on solution rates. We examine potential moderating variables, including cognitive ability, presentation format, and experimental setting, but we find no evidence of a disfluent font benefit under any conditions. More generally, though disfluent fonts slightly increase response times, we find little evidence that they activate analytic reasoning. (c) 2015 APA, all rights reserved).

Scheduling of hybrid types of machines with two-machine flowshop as the first type and a single machine as the second type

NASA Astrophysics Data System (ADS)

Hsiao, Ming-Chih; Su, Ling-Huey

2018-02-01

This research addresses the problem of scheduling hybrid machine types, in which one type is a two-machine flowshop and another type is a single machine. A job is either processed on the two-machine flowshop or on the single machine. The objective is to determine a production schedule for all jobs so as to minimize the makespan. The problem is NP-hard since the two parallel machines problem was proved to be NP-hard. Simulated annealing algorithms are developed to solve the problem optimally. A mixed integer programming (MIP) is developed and used to evaluate the performance for two SAs. Computational experiments demonstrate the efficiency of the simulated annealing algorithms, the quality of the simulated annealing algorithms will also be reported.

Pricing and location decisions in multi-objective facility location problem with M/M/m/k queuing systems

NASA Astrophysics Data System (ADS)

Tavakkoli-Moghaddam, Reza; Vazifeh-Noshafagh, Samira; Taleizadeh, Ata Allah; Hajipour, Vahid; Mahmoudi, Amin

2017-01-01

This article presents a new multi-objective model for a facility location problem with congestion and pricing policies. This model considers situations in which immobile service facilities are congested by a stochastic demand following M/M/m/k queues. The presented model belongs to the class of mixed-integer nonlinear programming models and NP-hard problems. To solve such a hard model, a new multi-objective optimization algorithm based on a vibration theory, namely multi-objective vibration damping optimization (MOVDO), is developed. In order to tune the algorithms parameters, the Taguchi approach using a response metric is implemented. The computational results are compared with those of the non-dominated ranking genetic algorithm and non-dominated sorting genetic algorithm. The outputs demonstrate the robustness of the proposed MOVDO in large-sized problems.

Organizational Leadership: Some Conceptual Models.

ERIC Educational Resources Information Center

Bernthal, Wilmar F.

In this address, the speaker examines several different types of organization (charismatic, traditional, bureaucratic, and task-oriented) and the role of the leader in each. In the modern, task-oriented system, his role can hardly be generalized as decision-making, direction and control, problem-solving, inspiration, communication, or any other…

The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems.

PubMed

Salcedo-Sanz, S; Del Ser, J; Landa-Torres, I; Gil-López, S; Portilla-Figueras, J A

2014-01-01

This paper presents a novel bioinspired algorithm to tackle complex optimization problems: the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral reef, where different corals (namely, solutions to the optimization problem considered) grow and reproduce in coral colonies, fighting by choking out other corals for space in the reef. This fight for space, along with the specific characteristics of the corals' reproduction, produces a robust metaheuristic algorithm shown to be powerful for solving hard optimization problems. In this research the CRO algorithm is tested in several continuous and discrete benchmark problems, as well as in practical application scenarios (i.e., optimum mobile network deployment and off-shore wind farm design). The obtained results confirm the excellent performance of the proposed algorithm and open line of research for further application of the algorithm to real-world problems.

A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems

NASA Astrophysics Data System (ADS)

Thammano, Arit; Teekeng, Wannaporn

2015-05-01

The job-shop scheduling problem is one of the most difficult production planning problems. Since it is in the NP-hard class, a recent trend in solving the job-shop scheduling problem is shifting towards the use of heuristic and metaheuristic algorithms. This paper proposes a novel metaheuristic algorithm, which is a modification of the genetic algorithm. This proposed algorithm introduces two new concepts to the standard genetic algorithm: (1) fuzzy roulette wheel selection and (2) the mutation operation with tabu list. The proposed algorithm has been evaluated and compared with several state-of-the-art algorithms in the literature. The experimental results on 53 JSSPs show that the proposed algorithm is very effective in solving the combinatorial optimization problems. It outperforms all state-of-the-art algorithms on all benchmark problems in terms of the ability to achieve the optimal solution and the computational time.

The Coral Reefs Optimization Algorithm: A Novel Metaheuristic for Efficiently Solving Optimization Problems

PubMed Central

Salcedo-Sanz, S.; Del Ser, J.; Landa-Torres, I.; Gil-López, S.; Portilla-Figueras, J. A.

2014-01-01

This paper presents a novel bioinspired algorithm to tackle complex optimization problems: the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral reef, where different corals (namely, solutions to the optimization problem considered) grow and reproduce in coral colonies, fighting by choking out other corals for space in the reef. This fight for space, along with the specific characteristics of the corals' reproduction, produces a robust metaheuristic algorithm shown to be powerful for solving hard optimization problems. In this research the CRO algorithm is tested in several continuous and discrete benchmark problems, as well as in practical application scenarios (i.e., optimum mobile network deployment and off-shore wind farm design). The obtained results confirm the excellent performance of the proposed algorithm and open line of research for further application of the algorithm to real-world problems. PMID:25147860

Bridging the Gap Between Planning and Scheduling

NASA Technical Reports Server (NTRS)

Smith, David E.; Frank, Jeremy; Jonsson, Ari K.; Norvig, Peter (Technical Monitor)

2000-01-01

Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast. Scheduling research has focused on much larger problems where there is little action choice, but the resulting ordering problem is hard. In this paper, we give an overview of M planning and scheduling techniques, focusing on their similarities, differences, and limitations. We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems.

Bicriteria Network Optimization Problem using Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin; Cheng, Runwei

Network optimization is being an increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. In many applications, however, there are several criteria associated with traversing each edge of a network. For example, cost and flow measures are both important in the networks. As a result, there has been recent interest in solving Bicriteria Network Optimization Problem. The Bicriteria Network Optimization Problem is known a NP-hard. The efficient set of paths may be very large, possibly exponential in size. Thus the computational effort required to solve it can increase exponentially with the problem size in the worst case. In this paper, we propose a genetic algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including maximum flow (MXF) model and minimum cost flow (MCF) model. The objective is to find the set of Pareto optimal solutions that give possible maximum flow with minimum cost. This paper also combines Adaptive Weight Approach (AWA) that utilizes some useful information from the current population to readjust weights for obtaining a search pressure toward a positive ideal point. Computer simulations show the several numerical experiments by using some difficult-to-solve network design problems, and show the effectiveness of the proposed method.

Approximate solution of the p-median minimization problem

NASA Astrophysics Data System (ADS)

Il'ev, V. P.; Il'eva, S. D.; Navrotskaya, A. A.

2016-09-01

A version of the facility location problem (the well-known p-median minimization problem) and its generalization—the problem of minimizing a supermodular set function—is studied. These problems are NP-hard, and they are approximately solved by a gradient algorithm that is a discrete analog of the steepest descent algorithm. A priori bounds on the worst-case behavior of the gradient algorithm for the problems under consideration are obtained. As a consequence, a bound on the performance guarantee of the gradient algorithm for the p-median minimization problem in terms of the production and transportation cost matrix is obtained.

A hybrid heuristic for the multiple choice multidimensional knapsack problem

NASA Astrophysics Data System (ADS)

Mansi, Raïd; Alves, Cláudio; Valério de Carvalho, J. M.; Hanafi, Saïd

2013-08-01

In this article, a new solution approach for the multiple choice multidimensional knapsack problem is described. The problem is a variant of the multidimensional knapsack problem where items are divided into classes, and exactly one item per class has to be chosen. Both problems are NP-hard. However, the multiple choice multidimensional knapsack problem appears to be more difficult to solve in part because of its choice constraints. Many real applications lead to very large scale multiple choice multidimensional knapsack problems that can hardly be addressed using exact algorithms. A new hybrid heuristic is proposed that embeds several new procedures for this problem. The approach is based on the resolution of linear programming relaxations of the problem and reduced problems that are obtained by fixing some variables of the problem. The solutions of these problems are used to update the global lower and upper bounds for the optimal solution value. A new strategy for defining the reduced problems is explored, together with a new family of cuts and a reformulation procedure that is used at each iteration to improve the performance of the heuristic. An extensive set of computational experiments is reported for benchmark instances from the literature and for a large set of hard instances generated randomly. The results show that the approach outperforms other state-of-the-art methods described so far, providing the best known solution for a significant number of benchmark instances.

Decision Making and Systems Thinking: Educational Issues

ERIC Educational Resources Information Center

Yurtseven, M. Kudret; Buchanan, Walter W.

2016-01-01

Decision making in most universities is taught within the conventional OR/MS (Operations Research/Management Science) paradigm. This paradigm is known to be "hard" since it is consisted of mathematical tools, and normally suitable for solving structured problems. In complex situations the conventional OR/MS paradigm proves to be…

How Mathematics Propels the Development of Physical Knowledge

ERIC Educational Resources Information Center

Schwartz, Daniel L.; Martin, Taylor; Pfaffman, Jay

2005-01-01

Three studies examined whether mathematics can propel the development of physical understanding. In Experiment 1, 10-year-olds solved balance scale problems that used easy-to-count discrete quantities or hard-to-count continuous quantities. Discrete quantities led to age typical performances. Continuous quantities caused performances like those of…

School System Simulation: An Effective Model for Educational Leaders.

ERIC Educational Resources Information Center

Nelson, Jorge O.

This study reviews the literature regarding the theoretical rationale for creating a computer-based school system simulation for educational leaders' use in problem solving and decision making. Like all social systems, educational systems are so complex that individuals are hard-pressed to consider all interrelated parts as a totality. A…

Smart power. Great leaders know when hard power is not enough.

PubMed

Nye, Joseph S

2008-11-01

The next U.S. administration will face enormous challenges to world peace, the global economy, and the environment. Exercising military and economic muscle alone will not bring peace and prosperity. According to Nye, a former U.S. government official and a former dean at Harvard University's John F. Kennedy School of Government, the next president must be able to combine hard power, characterized by coercion, and what Nye calls "soft" power, which relies instead on attraction. The result is smart power, a tool great leaders use to mobilize people around agendas that look beyond current problems. Hard power is often necessary, Nye explains. In the 1990s, when the Taliban was providing refuge to Al Oaeda, President Clinton tried---and failed--to solve the problem diplomatically instead of destroying terrorist havens in Afghanistan. In other situations, however, soft power is more effective, though it has been too often overlooked. In Iraq, Nye argues, the use of soft power could draw young people toward something other than terrorism. "I think that there's an awakening to the need for soft power as people look at the crisis in the Middle East and begin to realize that hard power is not sufficient to resolve it," he says. Solving today's global problems will require smart power--a judicious blend of the other two powers. While there are notable examples of men who have used smart power--Teddy Roosevelt, for instance--it's much more difficult for women to lead with smart power, especially in the United States, where women feel pressure to prove that they are not "soft." Only by exercising smart power, Nye says, can the next president of the United States set a new tone for U.S. foreign policy in this century.

Genetic algorithm parameters tuning for resource-constrained project scheduling problem

NASA Astrophysics Data System (ADS)

Tian, Xingke; Yuan, Shengrui

2018-04-01

Project Scheduling Problem (RCPSP) is a kind of important scheduling problem. To achieve a certain optimal goal such as the shortest duration, the smallest cost, the resource balance and so on, it is required to arrange the start and finish of all tasks under the condition of satisfying project timing constraints and resource constraints. In theory, the problem belongs to the NP-hard problem, and the model is abundant. Many combinatorial optimization problems are special cases of RCPSP, such as job shop scheduling, flow shop scheduling and so on. At present, the genetic algorithm (GA) has been used to deal with the classical RCPSP problem and achieved remarkable results. Vast scholars have also studied the improved genetic algorithm for the RCPSP problem, which makes it to solve the RCPSP problem more efficiently and accurately. However, for the selection of the main parameters of the genetic algorithm, there is no parameter optimization in these studies. Generally, we used the empirical method, but it cannot ensure to meet the optimal parameters. In this paper, the problem was carried out, which is the blind selection of parameters in the process of solving the RCPSP problem. We made sampling analysis, the establishment of proxy model and ultimately solved the optimal parameters.

Quantum Heterogeneous Computing for Satellite Positioning Optimization

NASA Astrophysics Data System (ADS)

Bass, G.; Kumar, V.; Dulny, J., III

2016-12-01

Hard optimization problems occur in many fields of academic study and practical situations. We present results in which quantum heterogeneous computing is used to solve a real-world optimization problem: satellite positioning. Optimization problems like this can scale very rapidly with problem size, and become unsolvable with traditional brute-force methods. Typically, such problems have been approximately solved with heuristic approaches; however, these methods can take a long time to calculate and are not guaranteed to find optimal solutions. Quantum computing offers the possibility of producing significant speed-up and improved solution quality. There are now commercially available quantum annealing (QA) devices that are designed to solve difficult optimization problems. These devices have 1000+ quantum bits, but they have significant hardware size and connectivity limitations. We present a novel heterogeneous computing stack that combines QA and classical machine learning and allows the use of QA on problems larger than the quantum hardware could solve in isolation. We begin by analyzing the satellite positioning problem with a heuristic solver, the genetic algorithm. The classical computer's comparatively large available memory can explore the full problem space and converge to a solution relatively close to the true optimum. The QA device can then evolve directly to the optimal solution within this more limited space. Preliminary experiments, using the Quantum Monte Carlo (QMC) algorithm to simulate QA hardware, have produced promising results. Working with problem instances with known global minima, we find a solution within 8% in a matter of seconds, and within 5% in a few minutes. Future studies include replacing QMC with commercially available quantum hardware and exploring more problem sets and model parameters. Our results have important implications for how heterogeneous quantum computing can be used to solve difficult optimization problems in any field.

An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks

NASA Astrophysics Data System (ADS)

Lin, Geng; Guan, Jian; Feng, Huibin

2018-06-01

The positive influence dominating set problem is a variant of the minimum dominating set problem, and has lots of applications in social networks. It is NP-hard, and receives more and more attention. Various methods have been proposed to solve the positive influence dominating set problem. However, most of the existing work focused on greedy algorithms, and the solution quality needs to be improved. In this paper, we formulate the minimum positive influence dominating set problem as an integer linear programming (ILP), and propose an ILP based memetic algorithm (ILPMA) for solving the problem. The ILPMA integrates a greedy randomized adaptive construction procedure, a crossover operator, a repair operator, and a tabu search procedure. The performance of ILPMA is validated on nine real-world social networks with nodes up to 36,692. The results show that ILPMA significantly improves the solution quality, and is robust.

Honey bee-inspired algorithms for SNP haplotype reconstruction problem

NASA Astrophysics Data System (ADS)

PourkamaliAnaraki, Maryam; Sadeghi, Mehdi

2016-03-01

Reconstructing haplotypes from SNP fragments is an important problem in computational biology. There have been a lot of interests in this field because haplotypes have been shown to contain promising data for disease association research. It is proved that haplotype reconstruction in Minimum Error Correction model is an NP-hard problem. Therefore, several methods such as clustering techniques, evolutionary algorithms, neural networks and swarm intelligence approaches have been proposed in order to solve this problem in appropriate time. In this paper, we have focused on various evolutionary clustering techniques and try to find an efficient technique for solving haplotype reconstruction problem. It can be referred from our experiments that the clustering methods relying on the behaviour of honey bee colony in nature, specifically bees algorithm and artificial bee colony methods, are expected to result in more efficient solutions. An application program of the methods is available at the following link. http://www.bioinf.cs.ipm.ir/software/haprs/

Solving optimization problems by the public goods game

NASA Astrophysics Data System (ADS)

Javarone, Marco Alberto

2017-09-01

We introduce a method based on the Public Goods Game for solving optimization tasks. In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities. The proposed method considers a population whose agents are provided with a random solution to the given problem. In doing so, agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game. Notably, agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents for increasing their fitness. Numerical simulations show that the proposed method allows to compute exact solutions, and suboptimal ones, in the considered search spaces. As result, beyond to propose a new heuristic for combinatorial optimization problems, our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.

Improved dynamic MRI reconstruction by exploiting sparsity and rank-deficiency.

PubMed

Majumdar, Angshul

2013-06-01

In this paper we address the problem of dynamic MRI reconstruction from partially sampled K-space data. Our work is motivated by previous studies in this area that proposed exploiting the spatiotemporal correlation of the dynamic MRI sequence by posing the reconstruction problem as a least squares minimization regularized by sparsity and low-rank penalties. Ideally the sparsity and low-rank penalties should be represented by the l(0)-norm and the rank of a matrix; however both are NP hard penalties. The previous studies used the convex l(1)-norm as a surrogate for the l(0)-norm and the non-convex Schatten-q norm (0

An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

NASA Astrophysics Data System (ADS)

Kassa, Semu Mitiku; Tsegay, Teklay Hailay

2017-08-01

Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of problems. In this paper, we investigate a tri-level programming problem with quadratic fractional objective functions at each of the three levels. A solution algorithm has been proposed by applying fuzzy goal programming approach and by reformulating the fractional constraints to equivalent but non-fractional non-linear constraints. Based on the transformed formulation, an iterative procedure is developed that can yield a satisfactory solution to the tri-level problem. The numerical results on various illustrative examples demonstrated that the proposed algorithm is very much promising and it can also be used to solve larger-sized as well as n-level problems of similar structure.

A Winner Determination Algorithm for Combinatorial Auctions Based on Hybrid Artificial Fish Swarm Algorithm

NASA Astrophysics Data System (ADS)

Zheng, Genrang; Lin, ZhengChun

The problem of winner determination in combinatorial auctions is a hotspot electronic business, and a NP hard problem. A Hybrid Artificial Fish Swarm Algorithm(HAFSA), which is combined with First Suite Heuristic Algorithm (FSHA) and Artificial Fish Swarm Algorithm (AFSA), is proposed to solve the problem after probing it base on the theories of AFSA. Experiment results show that the HAFSA is a rapidly and efficient algorithm for The problem of winner determining. Compared with Ant colony Optimization Algorithm, it has a good performance with broad and prosperous application.

Quantum algorithm for energy matching in hard optimization problems

NASA Astrophysics Data System (ADS)

Baldwin, C. L.; Laumann, C. R.

2018-06-01

We consider the ability of local quantum dynamics to solve the "energy-matching" problem: given an instance of a classical optimization problem and a low-energy state, find another macroscopically distinct low-energy state. Energy matching is difficult in rugged optimization landscapes, as the given state provides little information about the distant topography. Here, we show that the introduction of quantum dynamics can provide a speedup over classical algorithms in a large class of hard optimization problems. Tunneling allows the system to explore the optimization landscape while approximately conserving the classical energy, even in the presence of large barriers. Specifically, we study energy matching in the random p -spin model of spin-glass theory. Using perturbation theory and exact diagonalization, we show that introducing a transverse field leads to three sharp dynamical phases, only one of which solves the matching problem: (1) a small-field "trapped" phase, in which tunneling is too weak for the system to escape the vicinity of the initial state; (2) a large-field "excited" phase, in which the field excites the system into high-energy states, effectively forgetting the initial energy; and (3) the intermediate "tunneling" phase, in which the system succeeds at energy matching. The rate at which distant states are found in the tunneling phase, although exponentially slow in system size, is exponentially faster than classical search algorithms.

Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods

NASA Astrophysics Data System (ADS)

Karimi, Hamed; Rosenberg, Gili; Katzgraber, Helmut G.

2017-10-01

We present and apply a general-purpose, multistart algorithm for improving the performance of low-energy samplers used for solving optimization problems. The algorithm iteratively fixes the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are smaller and less connected, and samplers tend to give better low-energy samples for these problems. The algorithm is trivially parallelizable since each start in the multistart algorithm is independent, and could be applied to any heuristic solver that can be run multiple times to give a sample. We present results for several classes of hard problems solved using simulated annealing, path-integral quantum Monte Carlo, parallel tempering with isoenergetic cluster moves, and a quantum annealer, and show that the success metrics and the scaling are improved substantially. When combined with this algorithm, the quantum annealer's scaling was substantially improved for native Chimera graph problems. In addition, with this algorithm the scaling of the time to solution of the quantum annealer is comparable to the Hamze-de Freitas-Selby algorithm on the weak-strong cluster problems introduced by Boixo et al. Parallel tempering with isoenergetic cluster moves was able to consistently solve three-dimensional spin glass problems with 8000 variables when combined with our method, whereas without our method it could not solve any.

Mesoscale modeling: solving complex flows in biology and biotechnology.

PubMed

Mills, Zachary Grant; Mao, Wenbin; Alexeev, Alexander

2013-07-01

Fluids are involved in practically all physiological activities of living organisms. However, biological and biorelated flows are hard to analyze due to the inherent combination of interdependent effects and processes that occur on a multitude of spatial and temporal scales. Recent advances in mesoscale simulations enable researchers to tackle problems that are central for the understanding of such flows. Furthermore, computational modeling effectively facilitates the development of novel therapeutic approaches. Among other methods, dissipative particle dynamics and the lattice Boltzmann method have become increasingly popular during recent years due to their ability to solve a large variety of problems. In this review, we discuss recent applications of these mesoscale methods to several fluid-related problems in medicine, bioengineering, and biotechnology. Copyright © 2013 Elsevier Ltd. All rights reserved.

On the complexity and approximability of some Euclidean optimal summing problems

NASA Astrophysics Data System (ADS)

Eremeev, A. V.; Kel'manov, A. V.; Pyatkin, A. V.

2016-10-01

The complexity status of several well-known discrete optimization problems with the direction of optimization switching from maximum to minimum is analyzed. The task is to find a subset of a finite set of Euclidean points (vectors). In these problems, the objective functions depend either only on the norm of the sum of the elements from the subset or on this norm and the cardinality of the subset. It is proved that, if the dimension of the space is a part of the input, then all these problems are strongly NP-hard. Additionally, it is shown that, if the space dimension is fixed, then all the problems are NP-hard even for dimension 2 (on a plane) and there are no approximation algorithms with a guaranteed accuracy bound for them unless P = NP. It is shown that, if the coordinates of the input points are integer, then all the problems can be solved in pseudopolynomial time in the case of a fixed space dimension.

The TSP-approach to approximate solving the m-Cycles Cover Problem

NASA Astrophysics Data System (ADS)

Gimadi, Edward Kh.; Rykov, Ivan; Tsidulko, Oxana

2016-10-01

In the m-Cycles Cover problem it is required to find a collection of m vertex-disjoint cycles that covers all vertices of the graph and the total weight of edges in the cover is minimum (or maximum). The problem is a generalization of the Traveling salesmen problem. It is strongly NP-hard. We discuss a TSP-approach that gives polynomial approximate solutions for this problem. It transforms an approximation TSP algorithm into an approximation m-CCP algorithm. In this paper we present a number of successful transformations with proven performance guarantees for the obtained solutions.

A Team Training Model: A Regional Approach to Changing Economic Conditions. Hard Times: Communities in Transition.

ERIC Educational Resources Information Center

Butler, Lorna Michael; Coppedge, Robert O.

A guide for community leaders, extension staff, and community or rural development practitioners outlines the evolution of a regional training model for community-based problem solving in rural areas experiencing economic decline. The paper discusses the model's underlying concepts and implementation process and includes descriptions of four…

Using Online Algorithms to Solve NP-Hard Problems More Efficiently in Practice

DTIC Science & Technology

2007-12-01

bounds. For the openstacks , TPP, and pipesworld domains, our results were qualitatively different: most instances in these domains were either easy...between our results in these two sets of domains. For most in- stances in the openstacks domain we found no k values that elicited a “yes” answer in

Performer: An Instrument for Multidisciplinary Courseware Teams to Share Knowledge and Experiences

ERIC Educational Resources Information Center

van Aalst, Jan-Willem; van der Mast, Charles

2003-01-01

One of the traditional problems in courseware development that is recognized as hard to solve, is the communication and co-operation between various disciplines in project teams that are working on a courseware product [Alber (1996) "Multimedia: a management perspective." California: Wadsworth; Boyle (1997) "Design for multimedia learning." UK:…

bioboxes v510

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barton, Michael; Droge, Johannes; Belmann, Peter

2017-06-22

Software is now both central and essential to modern biology, yet lack of availability, difficult installations, and complex user interfaces make software hard to obtain and use. Containerisation, as exemplified by the Docker platform, has the potential to solve the problems associated with sharing software. The developers propose bioboxes: containers with standardised interfaces to make bioinformatics software interchangeable.

When Directors Lose Their Way

ERIC Educational Resources Information Center

Carter, Margie

2011-01-01

Directors of early childhood programs are an amazing lot! There's so much dedication, such hard work and creative problem solving. But then that inevitable undertow of deadlines, crises, and illness begins to suck directors down. With crisis management becoming a way of life, they don't even recognize their vital signs slipping away. The author…

Cognitive behaviour modification: a technique for teaching subtraction skills to hearing and deaf/hard-of-hearing elementary students.

PubMed

Al-Hilawani, Y A

2000-09-01

The purpose of this study was to examine the influence of using the Cognitive Behaviour Modification (CBM) technique on the subtraction skills of third grade hearing and deaf/hard-of-hearing students. The results indicated that the CBM deaf/hard-of-hearing students and the CBM and non-CBM hearing students made more progress in solving the subtraction problems than the non-CBM deaf/hard-of-hearing students. The results also showed that there were no significant differences between the CBM deaf/hard-of-hearing and the non-CBM hearing students; and there were no significant differences between the CBM and non-CBM hearing students. The results revealed that the CBM hearing students achieved significantly higher post-test scores than the CBM deaf/hard-of-hearing students. However, the CBM deaf/hard-of-hearing students obtained a significantly higher gain score compared to the CBM and non-CBM hearing students. Implications for teachers and suggestions for future research are discussed in this paper.

A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.

PubMed

Wang, Zhaocai; Huang, Dongmei; Meng, Huajun; Tang, Chengpei

2013-10-01

The minimum spanning tree (MST) problem is to find minimum edge connected subsets containing all the vertex of a given undirected graph. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications. Moreover in previous studies, DNA molecular operations usually were used to solve NP-complete head-to-tail path search problems, rarely for NP-hard problems with multi-lateral path solutions result, such as the minimum spanning tree problem. In this paper, we present a new fast DNA algorithm for solving the MST problem using DNA molecular operations. For an undirected graph with n vertex and m edges, we reasonably design flexible length DNA strands representing the vertex and edges, take appropriate steps and get the solutions of the MST problem in proper length range and O(3m+n) time complexity. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation. Results of computer simulative experiments show that the proposed method updates some of the best known values with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms. Copyright © 2013 The Authors. Published by Elsevier Ireland Ltd.. All rights reserved.

Gaussian Boson Sampling.

PubMed

Hamilton, Craig S; Kruse, Regina; Sansoni, Linda; Barkhofen, Sonja; Silberhorn, Christine; Jex, Igor

2017-10-27

Boson sampling has emerged as a tool to explore the advantages of quantum over classical computers as it does not require universal control over the quantum system, which favors current photonic experimental platforms. Here, we introduce Gaussian Boson sampling, a classically hard-to-solve problem that uses squeezed states as a nonclassical resource. We relate the probability to measure specific photon patterns from a general Gaussian state in the Fock basis to a matrix function called the Hafnian, which answers the last remaining question of sampling from Gaussian states. Based on this result, we design Gaussian Boson sampling, a #P hard problem, using squeezed states. This demonstrates that Boson sampling from Gaussian states is possible, with significant advantages in the photon generation probability, compared to existing protocols.

A constraint optimization based virtual network mapping method

NASA Astrophysics Data System (ADS)

Li, Xiaoling; Guo, Changguo; Wang, Huaimin; Li, Zhendong; Yang, Zhiwen

2013-03-01

Virtual network mapping problem, maps different virtual networks onto the substrate network is an extremely challenging work. This paper proposes a constraint optimization based mapping method for solving virtual network mapping problem. This method divides the problem into two phases, node mapping phase and link mapping phase, which are all NP-hard problems. Node mapping algorithm and link mapping algorithm are proposed for solving node mapping phase and link mapping phase, respectively. Node mapping algorithm adopts the thinking of greedy algorithm, mainly considers two factors, available resources which are supplied by the nodes and distance between the nodes. Link mapping algorithm is based on the result of node mapping phase, adopts the thinking of distributed constraint optimization method, which can guarantee to obtain the optimal mapping with the minimum network cost. Finally, simulation experiments are used to validate the method, and results show that the method performs very well.

Optimizing a realistic large-scale frequency assignment problem using a new parallel evolutionary approach

NASA Astrophysics Data System (ADS)

Chaves-González, José M.; Vega-Rodríguez, Miguel A.; Gómez-Pulido, Juan A.; Sánchez-Pérez, Juan M.

2011-08-01

This article analyses the use of a novel parallel evolutionary strategy to solve complex optimization problems. The work developed here has been focused on a relevant real-world problem from the telecommunication domain to verify the effectiveness of the approach. The problem, known as frequency assignment problem (FAP), basically consists of assigning a very small number of frequencies to a very large set of transceivers used in a cellular phone network. Real data FAP instances are very difficult to solve due to the NP-hard nature of the problem, therefore using an efficient parallel approach which makes the most of different evolutionary strategies can be considered as a good way to obtain high-quality solutions in short periods of time. Specifically, a parallel hyper-heuristic based on several meta-heuristics has been developed. After a complete experimental evaluation, results prove that the proposed approach obtains very high-quality solutions for the FAP and beats any other result published.

A knowledge-based system with learning for computer communication network design

NASA Technical Reports Server (NTRS)

Pierre, Samuel; Hoang, Hai Hoc; Tropper-Hausen, Evelyne

1990-01-01

Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving this problem is presented. This approach is particularly recommended for large packet switched communication networks, in the sense that it permits a high degree of reliability and offers a very flexible environment dealing with many relevant design parameters such as link cost, link capacity, and message delay.

Recovery after Work: The Role of Work Beliefs in the Unwinding Process

PubMed Central

Zoupanou, Zoe; Cropley, Mark; Rydstedt, Leif W.

2013-01-01

According to the Effort-Recovery model, mental or physical detachment from work is an important mechanism of work related recovery, as delayed recovery has been associated with range of negative health symptoms. In this paper, we examine whether recovery from work (in the form of mentally disengagement from work) is affected by the concept of ‘work ethic’, which refers to beliefs workers hold about their work and leisure and the effects of experiencing interruptions at work. Two indices of post-work recovery were utilized: problem solving pondering and psychological detachment. The study was conducted with 310 participants employed from diverse occupational sectors. Main effects of positive and negative appraisal of work interruption and beliefs were analysed using mediated and moderated regression analysis on problem-solving pondering and detachment. Weakened belief in wasted time as a partial mediator, reduced problem-solving pondering post work when interruptions were appraised as positive, and a high evaluation of leisure partially mediated problem-solving pondering when interruptions were appraised as positive. The results also showed that a high evaluation of centrality of work and leisure moderated the effect of negative appraisal of work interruption on elevated problem-solving pondering. Positive appraisal of work interruption was related to problem-solving pondering, and the strength of this association was further moderated by a strong belief in delay of gratification. In addition, employees' positive appraisal of work interruption was related to work detachment, and the strength of this association was further moderated by strong beliefs in hard work and self-reliance. These findings are discussed in terms of their theoretical and practical implications for employees who are strongly influenced by such work beliefs. PMID:24349060

Recovery after work: the role of work beliefs in the unwinding process.

PubMed

Zoupanou, Zoe; Cropley, Mark; Rydstedt, Leif W

2013-01-01

According to the Effort-Recovery model, mental or physical detachment from work is an important mechanism of work related recovery, as delayed recovery has been associated with range of negative health symptoms. In this paper, we examine whether recovery from work (in the form of mentally disengagement from work) is affected by the concept of 'work ethic', which refers to beliefs workers hold about their work and leisure and the effects of experiencing interruptions at work. Two indices of post-work recovery were utilized: problem solving pondering and psychological detachment. The study was conducted with 310 participants employed from diverse occupational sectors. Main effects of positive and negative appraisal of work interruption and beliefs were analysed using mediated and moderated regression analysis on problem-solving pondering and detachment. Weakened belief in wasted time as a partial mediator, reduced problem-solving pondering post work when interruptions were appraised as positive, and a high evaluation of leisure partially mediated problem-solving pondering when interruptions were appraised as positive. The results also showed that a high evaluation of centrality of work and leisure moderated the effect of negative appraisal of work interruption on elevated problem-solving pondering. Positive appraisal of work interruption was related to problem-solving pondering, and the strength of this association was further moderated by a strong belief in delay of gratification. In addition, employees' positive appraisal of work interruption was related to work detachment, and the strength of this association was further moderated by strong beliefs in hard work and self-reliance. These findings are discussed in terms of their theoretical and practical implications for employees who are strongly influenced by such work beliefs.

A case study in programming a quantum annealer for hard operational planning problems

NASA Astrophysics Data System (ADS)

Rieffel, Eleanor G.; Venturelli, Davide; O'Gorman, Bryan; Do, Minh B.; Prystay, Elicia M.; Smelyanskiy, Vadim N.

2015-01-01

We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the performance of quantum annealers on problems native to their architecture, and others have examined performance of select problems stemming from an application area, ours is one of the first studies of a quantum annealer's performance on parametrized families of hard problems from a practical domain. We explore two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and apply them to two parametrized families of planning problems, navigation-type and scheduling-type. We also examine two more compact, but problem-type specific, mappings to QUBO, one for the navigation-type planning problems and one for the scheduling-type planning problems. We study embedding properties and parameter setting and examine their effect on the efficiency with which the quantum annealer solves these problems. From these results, we derive insights useful for the programming and design of future quantum annealers: problem choice, the mapping used, the properties of the embedding, and the annealing profile all matter, each significantly affecting the performance.

The Different Patterns of Gesture between Genders in Mathematical Problem Solving of Geometry

NASA Astrophysics Data System (ADS)

Harisman, Y.; Noto, M. S.; Bakar, M. T.; Amam, A.

2017-02-01

This article discusses about students’ gesture between genders in answering problems of geometry. Gesture aims to check students’ understanding which is undefined from their writings. This study is a qualitative research, there were seven questions given to two students of eight grade Junior High School who had the equal ability. The data of this study were collected from mathematical problem solving test, videoing students’ presentation, and interviewing students by asking questions to check their understandings in geometry problems, in this case the researchers would observe the students’ gesture. The result of this study revealed that there were patterns of gesture through students’ conversation and prosodic cues, such as tones, intonation, speech rate and pause. Female students tended to give indecisive gestures, for instance bowing, hesitating, embarrassing, nodding many times in shifting cognitive comprehension, forwarding their body and asking questions to the interviewer when they found tough questions. However, male students acted some gestures such as playing their fingers, focusing on questions, taking longer time to answer hard questions, staying calm in shifting cognitive comprehension. We suggest to observe more sample and focus on students’ gesture consistency in showing their understanding to solve the given problems.

Studies in interactive communication. II - The effects of four communication modes on the linguistic performance of teams during cooperative problem solving

NASA Technical Reports Server (NTRS)

Chapanis, A.; Parrish, R. N.; Ochsman, R. B.; Weeks, G. D.

1977-01-01

Two-man teams solved credible, 'real world' problems for which computer assistance has been or could be useful. Conversations were carried on in one of four modes of communication: typewriting, handwriting, voice, and natural unrestricted communication. Performance was assessed on three classes of dependent measures: time to solution, behavioral measures of activity, and linguistic measures. Significant differences among the communication modes were found in each of the three classes. This paper is concerned mainly with the results of the linguistic analyses. Linguistic performance was assessed with 182 measures, most of which turned out to be redundant and some of which were useless or meaningless. Those that remain show that although problems can be solved faster in the oral modes than in the hard-copy modes, the oral modes are characterized by many more messages, sentences, words, and unique words; much higher communication rates; but lower type-token ratios. Although a number of significant problem and job-role effects were found, there were relatively few significant interactions of modes with thsse variables. It appears, therefore, that the mode effects hold for both problems and for both job roles assigned to the subjects.

Solving Set Cover with Pairs Problem using Quantum Annealing

NASA Astrophysics Data System (ADS)

Cao, Yudong; Jiang, Shuxian; Perouli, Debbie; Kais, Sabre

2016-09-01

Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that plays an important role in networking, computational biology, and biochemistry. We show an explicit construction of Ising Hamiltonians whose ground states encode the solution of SCP instances. We numerically simulate the time-dependent Schrödinger equation in order to test the performance of quantum annealing for random instances and compare with that of simulated annealing. We also discuss explicit embedding strategies for realizing our Hamiltonian construction on the D-wave type restricted Ising Hamiltonian based on Chimera graphs. Our embedding on the Chimera graph preserves the structure of the original SCP instance and in particular, the embedding for general complete bipartite graphs and logical disjunctions may be of broader use than that the specific problem we deal with.

Monkey search algorithm for ECE components partitioning

NASA Astrophysics Data System (ADS)

Kuliev, Elmar; Kureichik, Vladimir; Kureichik, Vladimir, Jr.

2018-05-01

The paper considers one of the important design problems – a partitioning of electronic computer equipment (ECE) components (blocks). It belongs to the NP-hard class of problems and has a combinatorial and logic nature. In the paper, a partitioning problem formulation can be found as a partition of graph into parts. To solve the given problem, the authors suggest using a bioinspired approach based on a monkey search algorithm. Based on the developed software, computational experiments were carried out that show the algorithm efficiency, as well as its recommended settings for obtaining more effective solutions in comparison with a genetic algorithm.

Parallel Optimization of Polynomials for Large-scale Problems in Stability and Control

NASA Astrophysics Data System (ADS)

Kamyar, Reza

In this thesis, we focus on some of the NP-hard problems in control theory. Thanks to the converse Lyapunov theory, these problems can often be modeled as optimization over polynomials. To avoid the problem of intractability, we establish a trade off between accuracy and complexity. In particular, we develop a sequence of tractable optimization problems --- in the form of Linear Programs (LPs) and/or Semi-Definite Programs (SDPs) --- whose solutions converge to the exact solution of the NP-hard problem. However, the computational and memory complexity of these LPs and SDPs grow exponentially with the progress of the sequence - meaning that improving the accuracy of the solutions requires solving SDPs with tens of thousands of decision variables and constraints. Setting up and solving such problems is a significant challenge. The existing optimization algorithms and software are only designed to use desktop computers or small cluster computers --- machines which do not have sufficient memory for solving such large SDPs. Moreover, the speed-up of these algorithms does not scale beyond dozens of processors. This in fact is the reason we seek parallel algorithms for setting-up and solving large SDPs on large cluster- and/or super-computers. We propose parallel algorithms for stability analysis of two classes of systems: 1) Linear systems with a large number of uncertain parameters; 2) Nonlinear systems defined by polynomial vector fields. First, we develop a distributed parallel algorithm which applies Polya's and/or Handelman's theorems to some variants of parameter-dependent Lyapunov inequalities with parameters defined over the standard simplex. The result is a sequence of SDPs which possess a block-diagonal structure. We then develop a parallel SDP solver which exploits this structure in order to map the computation, memory and communication to a distributed parallel environment. Numerical tests on a supercomputer demonstrate the ability of the algorithm to efficiently utilize hundreds and potentially thousands of processors, and analyze systems with 100+ dimensional state-space. Furthermore, we extend our algorithms to analyze robust stability over more complicated geometries such as hypercubes and arbitrary convex polytopes. Our algorithms can be readily extended to address a wide variety of problems in control such as Hinfinity synthesis for systems with parametric uncertainty and computing control Lyapunov functions.

Climate change: could it help develop 'adaptive expertise'?

PubMed

Bell, Erica; Horton, Graeme; Blashki, Grant; Seidel, Bastian M

2012-05-01

Preparing health practitioners to respond to the rising burden of disease from climate change is emerging as a priority in health workforce policy and planning. However, this issue is hardly represented in the medical education research. The rapidly evolving wide range of direct and indirect consequences of climate change will require health professionals to have not only broad content knowledge but also flexibility and responsiveness to diverse regional conditions as part of complex health problem-solving and adaptation. It is known that adaptive experts may not necessarily be quick at solving familiar problems, but they do creatively seek to better solve novel problems. This may be the result of an acquired approach to practice or a pathway that can be fostered by learning environments. It is also known that building adaptive expertise in medical education involves putting students on a learning pathway that requires them to have, first, the motivation to innovatively problem-solve and, second, exposure to diverse content material, meaningfully presented. Including curriculum content on the health effects of climate change could help meet these two conditions for some students at least. A working definition and illustrative competencies for adaptive expertise for climate change, as well as examples of teaching and assessment approaches extrapolated from rural curricula, are provided.

Changing Schools from the inside out: Small Wins in Hard Times. Third Edition

ERIC Educational Resources Information Center

Larson, Robert

2011-01-01

At any time, public schools labor under great economic, political, and social pressures that make it difficult to create large-scale, "whole school" change. But current top-down mandates require that schools close achievement gaps while teaching more problem solving, inquiry, and research skills--with fewer resources. Failure to meet test-based…

Bioboxes: standardised containers for interchangeable bioinformatics software.

PubMed

Belmann, Peter; Dröge, Johannes; Bremges, Andreas; McHardy, Alice C; Sczyrba, Alexander; Barton, Michael D

2015-01-01

Software is now both central and essential to modern biology, yet lack of availability, difficult installations, and complex user interfaces make software hard to obtain and use. Containerisation, as exemplified by the Docker platform, has the potential to solve the problems associated with sharing software. We propose bioboxes: containers with standardised interfaces to make bioinformatics software interchangeable.

Exploring Challenges Encountered by EFL Libyan Learners in Research Teaching and Writing

ERIC Educational Resources Information Center

Alsied, Safia Mujtaba; Ibrahim, Noura Winis

2017-01-01

Research is conducted all over the world to solve problems or to answer questions of significance to humanity. Academic writing or writing to report research is not easy because it requires adequate background knowledge, interest, motivation and hard work. This study investigates the major challenges in research writing faced by Libyan EFL…

Strengthening Preceptors' Competency in Thai Clinical Nursing

ERIC Educational Resources Information Center

Mingpun, Renu; Srisa-ard, Boonchom; Jumpamool, Apinya

2015-01-01

The problem of lack of nurses can be solved by employing student nurses. Obviously, nurse instructors and preceptors have to work extremely hard to train student nurses to meet the standard of nursing. The preceptorship model is yet to be explored as to what it means to have an effective program or the requisite skills to be an effective…

The young Huygens solves the problem of elastic collisions

NASA Astrophysics Data System (ADS)

Erlichson, Herman

1997-02-01

Christiaan Huygens was probably the first person to solve the problem of elastic collisions. He did this in the 1650s when he was only in his early twenties. The first formal publication of his general rule for the outcome of a head-on hard collision was in March 1669 in the Journal des Sçavans. Our present paper describes in detail Huygens' work on elastic collisions. We focus particularly on how Huygens' instinct for symmetry led him to a solution in the center-of-gravity reference frame. He readily transformed this solution to other frames using what we now call the Galilean velocity transformation. Huygens' symmetry approach is quite different from the modern description of collisions using Newtonian action and reaction forces.

Robust optimization with transiently chaotic dynamical systems

NASA Astrophysics Data System (ADS)

Sumi, R.; Molnár, B.; Ercsey-Ravasz, M.

2014-05-01

Efficiently solving hard optimization problems has been a strong motivation for progress in analog computing. In a recent study we presented a continuous-time dynamical system for solving the NP-complete Boolean satisfiability (SAT) problem, with a one-to-one correspondence between its stable attractors and the SAT solutions. While physical implementations could offer great efficiency, the transiently chaotic dynamics raises the question of operability in the presence of noise, unavoidable on analog devices. Here we show that the probability of finding solutions is robust to noise intensities well above those present on real hardware. We also developed a cellular neural network model realizable with analog circuits, which tolerates even larger noise intensities. These methods represent an opportunity for robust and efficient physical implementations.

Near-field self-interference cancellation and quality of service multicast beamforming in full-duplex

NASA Astrophysics Data System (ADS)

Wu, Fei; Shao, Shihai; Tang, Youxi

2016-10-01

To enable simultaneous multicast downlink transmit and receive operations on the same frequency band, also known as full-duplex links between an access point and mobile users. The problem of minimizing the total power of multicast transmit beamforming is considered from the viewpoint of ensuring the suppression amount of near-field line-of-sight self-interference and guaranteeing prescribed minimum signal-to-interference-plus-noise-ratio (SINR) at each receiver of the multicast groups. Based on earlier results for multicast groups beamforming, the joint problem is easily shown to be NP-hard. A semidefinite relaxation (SDR) technique with linear program power adjust method is proposed to solve the NP-hard problem. Simulation shows that the proposed method is feasible even when the local receive antenna in nearfield and the mobile user in far-filed are in the same direction.

Scheduling in the Face of Uncertain Resource Consumption and Utility

NASA Technical Reports Server (NTRS)

Koga, Dennis (Technical Monitor); Frank, Jeremy; Dearden, Richard

2003-01-01

We discuss the problem of scheduling tasks that consume a resource with known capacity and where the tasks have varying utility. We consider problems in which the resource consumption and utility of each activity is described by probability distributions. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We first show that while some of these problems are NP-complete, others are only NP-Hard. We then describe various heuristic search algorithms to solve these problems and their drawbacks. Finally, we present empirical results that characterize the behavior of these heuristics over a variety of problem classes.

Experiments with a decision-theoretic scheduler

NASA Technical Reports Server (NTRS)

Hansson, Othar; Holt, Gerhard; Mayer, Andrew

1992-01-01

This paper describes DTS, a decision-theoretic scheduler designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems, and using probabilistic inference to aggregate this information in light of features of a given problem. BPS, the Bayesian Problem-Solver, introduced a similar approach to solving single-agent and adversarial graph search problems, yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.

Mathematical model and metaheuristics for simultaneous balancing and sequencing of a robotic mixed-model assembly line

NASA Astrophysics Data System (ADS)

Li, Zixiang; Janardhanan, Mukund Nilakantan; Tang, Qiuhua; Nielsen, Peter

2018-05-01

This article presents the first method to simultaneously balance and sequence robotic mixed-model assembly lines (RMALB/S), which involves three sub-problems: task assignment, model sequencing and robot allocation. A new mixed-integer programming model is developed to minimize makespan and, using CPLEX solver, small-size problems are solved for optimality. Two metaheuristics, the restarted simulated annealing algorithm and co-evolutionary algorithm, are developed and improved to address this NP-hard problem. The restarted simulated annealing method replaces the current temperature with a new temperature to restart the search process. The co-evolutionary method uses a restart mechanism to generate a new population by modifying several vectors simultaneously. The proposed algorithms are tested on a set of benchmark problems and compared with five other high-performing metaheuristics. The proposed algorithms outperform their original editions and the benchmarked methods. The proposed algorithms are able to solve the balancing and sequencing problem of a robotic mixed-model assembly line effectively and efficiently.

Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks.

PubMed

Rutishauser, Ueli; Slotine, Jean-Jacques; Douglas, Rodney J

2018-05-01

Finding actions that satisfy the constraints imposed by both external inputs and internal representations is central to decision making. We demonstrate that some important classes of constraint satisfaction problems (CSPs) can be solved by networks composed of homogeneous cooperative-competitive modules that have connectivity similar to motifs observed in the superficial layers of neocortex. The winner-take-all modules are sparsely coupled by programming neurons that embed the constraints onto the otherwise homogeneous modular computational substrate. We show rules that embed any instance of the CSP's planar four-color graph coloring, maximum independent set, and sudoku on this substrate and provide mathematical proofs that guarantee these graph coloring problems will convergence to a solution. The network is composed of nonsaturating linear threshold neurons. Their lack of right saturation allows the overall network to explore the problem space driven through the unstable dynamics generated by recurrent excitation. The direction of exploration is steered by the constraint neurons. While many problems can be solved using only linear inhibitory constraints, network performance on hard problems benefits significantly when these negative constraints are implemented by nonlinear multiplicative inhibition. Overall, our results demonstrate the importance of instability rather than stability in network computation and offer insight into the computational role of dual inhibitory mechanisms in neural circuits.

Generating effective project scheduling heuristics by abstraction and reconstitution

NASA Technical Reports Server (NTRS)

Janakiraman, Bhaskar; Prieditis, Armand

1992-01-01

A project scheduling problem consists of a finite set of jobs, each with fixed integer duration, requiring one or more resources such as personnel or equipment, and each subject to a set of precedence relations, which specify allowable job orderings, and a set of mutual exclusion relations, which specify jobs that cannot overlap. No job can be interrupted once started. The objective is to minimize project duration. This objective arises in nearly every large construction project--from software to hardware to buildings. Because such project scheduling problems are NP-hard, they are typically solved by branch-and-bound algorithms. In these algorithms, lower-bound duration estimates (admissible heuristics) are used to improve efficiency. One way to obtain an admissible heuristic is to remove (abstract) all resources and mutual exclusion constraints and then obtain the minimal project duration for the abstracted problem; this minimal duration is the admissible heuristic. Although such abstracted problems can be solved efficiently, they yield inaccurate admissible heuristics precisely because those constraints that are central to solving the original problem are abstracted. This paper describes a method to reconstitute the abstracted constraints back into the solution to the abstracted problem while maintaining efficiency, thereby generating better admissible heuristics. Our results suggest that reconstitution can make good admissible heuristics even better.

HSTLBO: A hybrid algorithm based on Harmony Search and Teaching-Learning-Based Optimization for complex high-dimensional optimization problems

PubMed Central

Tuo, Shouheng; Yong, Longquan; Deng, Fang’an; Li, Yanhai; Lin, Yong; Lu, Qiuju

2017-01-01

Harmony Search (HS) and Teaching-Learning-Based Optimization (TLBO) as new swarm intelligent optimization algorithms have received much attention in recent years. Both of them have shown outstanding performance for solving NP-Hard optimization problems. However, they also suffer dramatic performance degradation for some complex high-dimensional optimization problems. Through a lot of experiments, we find that the HS and TLBO have strong complementarity each other. The HS has strong global exploration power but low convergence speed. Reversely, the TLBO has much fast convergence speed but it is easily trapped into local search. In this work, we propose a hybrid search algorithm named HSTLBO that merges the two algorithms together for synergistically solving complex optimization problems using a self-adaptive selection strategy. In the HSTLBO, both HS and TLBO are modified with the aim of balancing the global exploration and exploitation abilities, where the HS aims mainly to explore the unknown regions and the TLBO aims to rapidly exploit high-precision solutions in the known regions. Our experimental results demonstrate better performance and faster speed than five state-of-the-art HS variants and show better exploration power than five good TLBO variants with similar run time, which illustrates that our method is promising in solving complex high-dimensional optimization problems. The experiment on portfolio optimization problems also demonstrate that the HSTLBO is effective in solving complex read-world application. PMID:28403224

HSTLBO: A hybrid algorithm based on Harmony Search and Teaching-Learning-Based Optimization for complex high-dimensional optimization problems.

PubMed

Tuo, Shouheng; Yong, Longquan; Deng, Fang'an; Li, Yanhai; Lin, Yong; Lu, Qiuju

2017-01-01

Harmony Search (HS) and Teaching-Learning-Based Optimization (TLBO) as new swarm intelligent optimization algorithms have received much attention in recent years. Both of them have shown outstanding performance for solving NP-Hard optimization problems. However, they also suffer dramatic performance degradation for some complex high-dimensional optimization problems. Through a lot of experiments, we find that the HS and TLBO have strong complementarity each other. The HS has strong global exploration power but low convergence speed. Reversely, the TLBO has much fast convergence speed but it is easily trapped into local search. In this work, we propose a hybrid search algorithm named HSTLBO that merges the two algorithms together for synergistically solving complex optimization problems using a self-adaptive selection strategy. In the HSTLBO, both HS and TLBO are modified with the aim of balancing the global exploration and exploitation abilities, where the HS aims mainly to explore the unknown regions and the TLBO aims to rapidly exploit high-precision solutions in the known regions. Our experimental results demonstrate better performance and faster speed than five state-of-the-art HS variants and show better exploration power than five good TLBO variants with similar run time, which illustrates that our method is promising in solving complex high-dimensional optimization problems. The experiment on portfolio optimization problems also demonstrate that the HSTLBO is effective in solving complex read-world application.

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.

PubMed

Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue

2015-01-01

As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods.

Exact solutions for species tree inference from discordant gene trees.

PubMed

Chang, Wen-Chieh; Górecki, Paweł; Eulenstein, Oliver

2013-10-01

Phylogenetic analysis has to overcome the grant challenge of inferring accurate species trees from evolutionary histories of gene families (gene trees) that are discordant with the species tree along whose branches they have evolved. Two well studied approaches to cope with this challenge are to solve either biologically informed gene tree parsimony (GTP) problems under gene duplication, gene loss, and deep coalescence, or the classic RF supertree problem that does not rely on any biological model. Despite the potential of these problems to infer credible species trees, they are NP-hard. Therefore, these problems are addressed by heuristics that typically lack any provable accuracy and precision. We describe fast dynamic programming algorithms that solve the GTP problems and the RF supertree problem exactly, and demonstrate that our algorithms can solve instances with data sets consisting of as many as 22 taxa. Extensions of our algorithms can also report the number of all optimal species trees, as well as the trees themselves. To better asses the quality of the resulting species trees that best fit the given gene trees, we also compute the worst case species trees, their numbers, and optimization score for each of the computational problems. Finally, we demonstrate the performance of our exact algorithms using empirical and simulated data sets, and analyze the quality of heuristic solutions for the studied problems by contrasting them with our exact solutions.

Optimal recombination in genetic algorithms for flowshop scheduling problems

NASA Astrophysics Data System (ADS)

Kovalenko, Julia

2016-10-01

The optimal recombination problem consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We prove NP-hardness of the optimal recombination for various variants of the flowshop scheduling problem with makespan criterion and criterion of maximum lateness. An algorithm for solving the optimal recombination problem for permutation flowshop problems is built, using enumeration of prefect matchings in a special bipartite graph. The algorithm is adopted for the classical flowshop scheduling problem and for the no-wait flowshop problem. It is shown that the optimal recombination problem for the permutation flowshop scheduling problem is solvable in polynomial time for almost all pairs of parent solutions as the number of jobs tends to infinity.

The Problem Solving Method in Teaching Physics in Elementary School

NASA Astrophysics Data System (ADS)

Jandrić, Gordana Hajduković; Obadović, Dušanka Ž.; Stojanović, Maja

2010-01-01

The most of the teachers ask if there is a "best" known way to teach. The most effective teaching method depends on the specific goals of the course and the needs of the students. An investigation has been carried out to compare the effect of teaching selected physics topics using problem-solving method on the overall achievements of the acquired knowledge and teaching the same material by traditional teaching method. The investigation was performed as a pedagogical experiment of the type of parallel groups with randomly chosen sample of students attending grades eight. The control and experimental groups were equalized in the relevant pedagogical parameters. The obtained results were treated statistically. The comparison showed a significant difference in respect of the speed of acquiring knowledge, the problem-solving teaching being advantageous over traditional methodDo not replace the word "abstract," but do replace the rest of this text. If you must insert a hard line break, please use Shift+Enter rather than just tapping your "Enter" key. You may want to print this page and refer to it as a style sample before you begin working on your paper.

Optimal matching for prostate brachytherapy seed localization with dimension reduction.

PubMed

Lee, Junghoon; Labat, Christian; Jain, Ameet K; Song, Danny Y; Burdette, Everette C; Fichtinger, Gabor; Prince, Jerry L

2009-01-01

In prostate brachytherapy, x-ray fluoroscopy has been used for intra-operative dosimetry to provide qualitative assessment of implant quality. More recent developments have made possible 3D localization of the implanted radioactive seeds. This is usually modeled as an assignment problem and solved by resolving the correspondence of seeds. It is, however, NP-hard, and the problem is even harder in practice due to the significant number of hidden seeds. In this paper, we propose an algorithm that can find an optimal solution from multiple projection images with hidden seeds. It solves an equivalent problem with reduced dimensional complexity, thus allowing us to find an optimal solution in polynomial time. Simulation results show the robustness of the algorithm. It was validated on 5 phantom and 18 patient datasets, successfully localizing the seeds with detection rate of > or = 97.6% and reconstruction error of < or = 1.2 mm. This is considered to be clinically excellent performance.

Constructing Conceptual Meaning from a Popular Scientific Paper--The Case of E = mc[superscript 2

ERIC Educational Resources Information Center

Kapon, Shulamit

2013-01-01

Although high school physics students solve problems using the expression E = mc[superscript 2], the origin of this expression and its deep conceptual meaning are hardly ever discussed due to students' limited prior knowledge. In 1946, a year after the atomic bombs were first dropped, Albert Einstein published a popular scientific paper explaining…

Teaching Creativity and Inventive Problem Solving in Science

PubMed Central

2009-01-01

Engaging learners in the excitement of science, helping them discover the value of evidence-based reasoning and higher-order cognitive skills, and teaching them to become creative problem solvers have long been goals of science education reformers. But the means to achieve these goals, especially methods to promote creative thinking in scientific problem solving, have not become widely known or used. In this essay, I review the evidence that creativity is not a single hard-to-measure property. The creative process can be explained by reference to increasingly well-understood cognitive skills such as cognitive flexibility and inhibitory control that are widely distributed in the population. I explore the relationship between creativity and the higher-order cognitive skills, review assessment methods, and describe several instructional strategies for enhancing creative problem solving in the college classroom. Evidence suggests that instruction to support the development of creativity requires inquiry-based teaching that includes explicit strategies to promote cognitive flexibility. Students need to be repeatedly reminded and shown how to be creative, to integrate material across subject areas, to question their own assumptions, and to imagine other viewpoints and possibilities. Further research is required to determine whether college students' learning will be enhanced by these measures. PMID:19723812

Teaching creativity and inventive problem solving in science.

PubMed

DeHaan, Robert L

2009-01-01

Engaging learners in the excitement of science, helping them discover the value of evidence-based reasoning and higher-order cognitive skills, and teaching them to become creative problem solvers have long been goals of science education reformers. But the means to achieve these goals, especially methods to promote creative thinking in scientific problem solving, have not become widely known or used. In this essay, I review the evidence that creativity is not a single hard-to-measure property. The creative process can be explained by reference to increasingly well-understood cognitive skills such as cognitive flexibility and inhibitory control that are widely distributed in the population. I explore the relationship between creativity and the higher-order cognitive skills, review assessment methods, and describe several instructional strategies for enhancing creative problem solving in the college classroom. Evidence suggests that instruction to support the development of creativity requires inquiry-based teaching that includes explicit strategies to promote cognitive flexibility. Students need to be repeatedly reminded and shown how to be creative, to integrate material across subject areas, to question their own assumptions, and to imagine other viewpoints and possibilities. Further research is required to determine whether college students' learning will be enhanced by these measures.

Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems

PubMed Central

Fonseca Guerra, Gabriel A.; Furber, Steve B.

2017-01-01

Constraint satisfaction problems (CSP) are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not) of efficient algorithms remains a major unsolved question in computational complexity theory. In the face of this fundamental difficulty heuristics and approximation methods are used to approach instances of NP (e.g., decision and hard optimization problems). The human brain efficiently handles CSPs both in perception and behavior using spiking neural networks (SNNs), and recent studies have demonstrated that the noise embedded within an SNN can be used as a computational resource to solve CSPs. Here, we provide a software framework for the implementation of such noisy neural solvers on the SpiNNaker massively parallel neuromorphic hardware, further demonstrating their potential to implement a stochastic search that solves instances of P and NP problems expressed as CSPs. This facilitates the exploration of new optimization strategies and the understanding of the computational abilities of SNNs. We demonstrate the basic principles of the framework by solving difficult instances of the Sudoku puzzle and of the map color problem, and explore its application to spin glasses. The solver works as a stochastic dynamical system, which is attracted by the configuration that solves the CSP. The noise allows an optimal exploration of the space of configurations, looking for the satisfiability of all the constraints; if applied discontinuously, it can also force the system to leap to a new random configuration effectively causing a restart. PMID:29311791

Phases of learning: How skill acquisition impacts cognitive processing.

PubMed

Tenison, Caitlin; Fincham, Jon M; Anderson, John R

2016-06-01

This fMRI study examines the changes in participants' information processing as they repeatedly solve the same mathematical problem. We show that the majority of practice-related speedup is produced by discrete changes in cognitive processing. Because the points at which these changes take place vary from problem to problem, and the underlying information processing steps vary in duration, the existence of such discrete changes can be hard to detect. Using two converging approaches, we establish the existence of three learning phases. When solving a problem in one of these learning phases, participants can go through three cognitive stages: Encoding, Solving, and Responding. Each cognitive stage is associated with a unique brain signature. Using a bottom-up approach combining multi-voxel pattern analysis and hidden semi-Markov modeling, we identify the duration of that stage on any particular trial from participants brain activation patterns. For our top-down approach we developed an ACT-R model of these cognitive stages and simulated how they change over the course of learning. The Solving stage of the first learning phase is long and involves a sequence of arithmetic computations. Participants transition to the second learning phase when they can retrieve the answer, thereby drastically reducing the duration of the Solving stage. With continued practice, participants then transition to the third learning phase when they recognize the problem as a single unit and produce the answer as an automatic response. The duration of this third learning phase is dominated by the Responding stage. Copyright © 2016 Elsevier Inc. All rights reserved.

Interval versions of statistical techniques with applications to environmental analysis, bioinformatics, and privacy in statistical databases

NASA Astrophysics Data System (ADS)

Kreinovich, Vladik; Longpre, Luc; Starks, Scott A.; Xiang, Gang; Beck, Jan; Kandathi, Raj; Nayak, Asis; Ferson, Scott; Hajagos, Janos

2007-02-01

In many areas of science and engineering, it is desirable to estimate statistical characteristics (mean, variance, covariance, etc.) under interval uncertainty. For example, we may want to use the measured values x(t) of a pollution level in a lake at different moments of time to estimate the average pollution level; however, we do not know the exact values x(t)--e.g., if one of the measurement results is 0, this simply means that the actual (unknown) value of x(t) can be anywhere between 0 and the detection limit (DL). We must, therefore, modify the existing statistical algorithms to process such interval data. Such a modification is also necessary to process data from statistical databases, where, in order to maintain privacy, we only keep interval ranges instead of the actual numeric data (e.g., a salary range instead of the actual salary). Most resulting computational problems are NP-hard--which means, crudely speaking, that in general, no computationally efficient algorithm can solve all particular cases of the corresponding problem. In this paper, we overview practical situations in which computationally efficient algorithms exist: e.g., situations when measurements are very accurate, or when all the measurements are done with one (or few) instruments. As a case study, we consider a practical problem from bioinformatics: to discover the genetic difference between the cancer cells and the healthy cells, we must process the measurements results and find the concentrations c and h of a given gene in cancer and in healthy cells. This is a particular case of a general situation in which, to estimate states or parameters which are not directly accessible by measurements, we must solve a system of equations in which coefficients are only known with interval uncertainty. We show that in general, this problem is NP-hard, and we describe new efficient algorithms for solving this problem in practically important situations.

Solving multiconstraint assignment problems using learning automata.

PubMed

Horn, Geir; Oommen, B John

2010-02-01

This paper considers the NP-hard problem of object assignment with respect to multiple constraints: assigning a set of elements (or objects) into mutually exclusive classes (or groups), where the elements which are "similar" to each other are hopefully located in the same class. The literature reports solutions in which the similarity constraint consists of a single index that is inappropriate for the type of multiconstraint problems considered here and where the constraints could simultaneously be contradictory. This feature, where we permit possibly contradictory constraints, distinguishes this paper from the state of the art. Indeed, we are aware of no learning automata (or other heuristic) solutions which solve this problem in its most general setting. Such a scenario is illustrated with the static mapping problem, which consists of distributing the processes of a parallel application onto a set of computing nodes. This is a classical and yet very important problem within the areas of parallel computing, grid computing, and cloud computing. We have developed four learning-automata (LA)-based algorithms to solve this problem: First, a fixed-structure stochastic automata algorithm is presented, where the processes try to form pairs to go onto the same node. This algorithm solves the problem, although it requires some centralized coordination. As it is desirable to avoid centralized control, we subsequently present three different variable-structure stochastic automata (VSSA) algorithms, which have superior partitioning properties in certain settings, although they forfeit some of the scalability features of the fixed-structure algorithm. All three VSSA algorithms model the processes as automata having first the hosting nodes as possible actions; second, the processes as possible actions; and, third, attempting to estimate the process communication digraph prior to probabilistically mapping the processes. This paper, which, we believe, comprehensively reports the pioneering LA solutions to this problem, unequivocally demonstrates that LA can play an important role in solving complex combinatorial and integer optimization problems.

Improved multi-objective ant colony optimization algorithm and its application in complex reasoning

NASA Astrophysics Data System (ADS)

Wang, Xinqing; Zhao, Yang; Wang, Dong; Zhu, Huijie; Zhang, Qing

2013-09-01

The problem of fault reasoning has aroused great concern in scientific and engineering fields. However, fault investigation and reasoning of complex system is not a simple reasoning decision-making problem. It has become a typical multi-constraint and multi-objective reticulate optimization decision-making problem under many influencing factors and constraints. So far, little research has been carried out in this field. This paper transforms the fault reasoning problem of complex system into a paths-searching problem starting from known symptoms to fault causes. Three optimization objectives are considered simultaneously: maximum probability of average fault, maximum average importance, and minimum average complexity of test. Under the constraints of both known symptoms and the causal relationship among different components, a multi-objective optimization mathematical model is set up, taking minimizing cost of fault reasoning as the target function. Since the problem is non-deterministic polynomial-hard(NP-hard), a modified multi-objective ant colony algorithm is proposed, in which a reachability matrix is set up to constrain the feasible search nodes of the ants and a new pseudo-random-proportional rule and a pheromone adjustment mechinism are constructed to balance conflicts between the optimization objectives. At last, a Pareto optimal set is acquired. Evaluation functions based on validity and tendency of reasoning paths are defined to optimize noninferior set, through which the final fault causes can be identified according to decision-making demands, thus realize fault reasoning of the multi-constraint and multi-objective complex system. Reasoning results demonstrate that the improved multi-objective ant colony optimization(IMACO) can realize reasoning and locating fault positions precisely by solving the multi-objective fault diagnosis model, which provides a new method to solve the problem of multi-constraint and multi-objective fault diagnosis and reasoning of complex system.

A roadmap for optimal control: the right way to commute.

PubMed

Ross, I Michael

2005-12-01

Optimal control theory is the foundation for many problems in astrodynamics. Typical examples are trajectory design and optimization, relative motion control of distributed space systems and attitude steering. Many such problems in astrodynamics are solved by an alternative route of mathematical analysis and deep physical insight, in part because of the perception that an optimal control framework generates hard problems. Although this is indeed true of the Bellman and Pontryagin frameworks, the covector mapping principle provides a neoclassical approach that renders hard problems easy. That is, although the origins of this philosophy can be traced back to Bernoulli and Euler, it is essentially modern as a result of the strong linkage between approximation theory, set-valued analysis and computing technology. Motivated by the broad success of this approach, mission planners are now conceiving and demanding higher performance from space systems. This has resulted in new set of theoretical and computational problems. Recently, under the leadership of NASA-GRC, several workshops were held to address some of these problems. This paper outlines the theoretical issues stemming from practical problems in astrodynamics. Emphasis is placed on how it pertains to advanced mission design problems.

Decision-theoretic control of EUVE telescope scheduling

NASA Technical Reports Server (NTRS)

Hansson, Othar; Mayer, Andrew

1993-01-01

This paper describes a decision theoretic scheduler (DTS) designed to employ state-of-the-art probabilistic inference technology to speed the search for efficient solutions to constraint-satisfaction problems. Our approach involves assessing the performance of heuristic control strategies that are normally hard-coded into scheduling systems and using probabilistic inference to aggregate this information in light of the features of a given problem. The Bayesian Problem-Solver (BPS) introduced a similar approach to solving single agent and adversarial graph search patterns yielding orders-of-magnitude improvement over traditional techniques. Initial efforts suggest that similar improvements will be realizable when applied to typical constraint-satisfaction scheduling problems.

Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality

NASA Astrophysics Data System (ADS)

Yamamoto, Takanori; Bannai, Hideo; Nagasaki, Masao; Miyano, Satoru

We present new decomposition heuristics for finding the optimal solution for the maximum-weight connected graph problem, which is known to be NP-hard. Previous optimal algorithms for solving the problem decompose the input graph into subgraphs using heuristics based on node degree. We propose new heuristics based on betweenness centrality measures, and show through computational experiments that our new heuristics tend to reduce the number of subgraphs in the decomposition, and therefore could lead to the reduction in computational time for finding the optimal solution. The method is further applied to analysis of biological pathway data.

Handling a Small Dataset Problem in Prediction Model by employ Artificial Data Generation Approach: A Review

NASA Astrophysics Data System (ADS)

Lateh, Masitah Abdul; Kamilah Muda, Azah; Yusof, Zeratul Izzah Mohd; Azilah Muda, Noor; Sanusi Azmi, Mohd

2017-09-01

The emerging era of big data for past few years has led to large and complex data which needed faster and better decision making. However, the small dataset problems still arise in a certain area which causes analysis and decision are hard to make. In order to build a prediction model, a large sample is required as a training sample of the model. Small dataset is insufficient to produce an accurate prediction model. This paper will review an artificial data generation approach as one of the solution to solve the small dataset problem.

A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

PubMed Central

Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

2016-01-01

The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585

A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.

PubMed

Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

2016-01-01

The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

Plane Poiseuille flow of a rarefied gas in the presence of strong gravitation.

PubMed

Doi, Toshiyuki

2011-02-01

Plane Poiseuille flow of a rarefied gas, which flows horizontally in the presence of strong gravitation, is studied based on the Boltzmann equation. Applying the asymptotic analysis for a small variation in the flow direction [Y. Sone, Molecular Gas Dynamics (Birkhäuser, 2007)], the two-dimensional problem is reduced to a one-dimensional problem, as in the case of a Poiseuille flow in the absence of gravitation, and the solution is obtained in a semianalytical form. The reduced one-dimensional problem is solved numerically for a hard sphere molecular gas over a wide range of the gas-rarefaction degree and the gravitational strength. The presence of gravitation reduces the mass flow rate, and the effect of gravitation is significant for large Knudsen numbers. To verify the validity of the asymptotic solution, a two-dimensional problem of a flow through a long channel is directly solved numerically, and the validity of the asymptotic solution is confirmed. ©2011 American Physical Society

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.

PubMed

Ćwik, Michał; Józefczyk, Jerzy

2018-01-01

An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure. First of all, a greedy procedure is used for calculating the criterion's value, as such calculation is NP-hard problem itself. Moreover, the lower bound is used instead of solving the internal deterministic flow-shop. The constructive heuristic algorithm is applied for the relaxed optimization problem. The algorithm is compared with previously elaborated other heuristic algorithms basing on the evolutionary and the middle interval approaches. The conducted computational experiments showed the advantage of the constructive heuristic algorithm with regards to both the criterion and the time of computations. The Wilcoxon paired-rank statistical test confirmed this conclusion.

Parallel-Batch Scheduling and Transportation Coordination with Waiting Time Constraint

PubMed Central

Gong, Hua; Chen, Daheng; Xu, Ke

2014-01-01

This paper addresses a parallel-batch scheduling problem that incorporates transportation of raw materials or semifinished products before processing with waiting time constraint. The orders located at the different suppliers are transported by some vehicles to a manufacturing facility for further processing. One vehicle can load only one order in one shipment. Each order arriving at the facility must be processed in the limited waiting time. The orders are processed in batches on a parallel-batch machine, where a batch contains several orders and the processing time of the batch is the largest processing time of the orders in it. The goal is to find a schedule to minimize the sum of the total flow time and the production cost. We prove that the general problem is NP-hard in the strong sense. We also demonstrate that the problem with equal processing times on the machine is NP-hard. Furthermore, a dynamic programming algorithm in pseudopolynomial time is provided to prove its ordinarily NP-hardness. An optimal algorithm in polynomial time is presented to solve a special case with equal processing times and equal transportation times for each order. PMID:24883385

Public channel cryptography: chaos synchronization and Hilbert's tenth problem.

PubMed

Kanter, Ido; Kopelowitz, Evi; Kinzel, Wolfgang

2008-08-22

The synchronization process of two mutually delayed coupled deterministic chaotic maps is demonstrated both analytically and numerically. The synchronization is preserved when the mutually transmitted signals are concealed by two commutative private filters, a convolution of the truncated time-delayed output signals or some powers of the delayed output signals. The task of a passive attacker is mapped onto Hilbert's tenth problem, solving a set of nonlinear Diophantine equations, which was proven to be in the class of NP-complete problems [problems that are both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP problem can be translated into this problem)]. This bridge between nonlinear dynamics and NP-complete problems opens a horizon for new types of secure public-channel protocols.

Coping Behavior of International Late Adolescent Students in Selected Australian Educational Institutions

PubMed Central

Shahrill, Masitah; Mundia, Lawrence

2014-01-01

Using the Adolescent Coping Scale, ACS (Frydenberg & Lewis, 1993) we surveyed 45 randomly selected foreign adolescents in Australian schools. The coping strategies used most by the participants were: focus on solving the problem; seeking relaxing diversions; focusing on the positive; seeking social support; worry; seeking to belong; investing in close friends; wishful thinking; and keep to self (Table 4). With regard to coping styles, the most widely used was the productive coping followed by non-productive coping while the least used style was reference to others (Table 4). In terms of both genders the four coping strategies used most often were: work hard to achieve; seeking relaxing diversions; focus on solving the problem; and focus on the positive (Table 5). The most noticeable gender difference was the use of the physical recreation coping strategy in which male students engaged more (Fig 1). The usage of four coping strategies (solving problem; work hard; focus on positive; and social support) was higher for students who have been away from family more than once as compared to those who have been away once only while the usage of seeking relaxing diversions was higher for the first timers (Table 6). No significant differences were obtained on the sample’s performance on the ACS subscales by gender (Table 7), frequency of leaving own country (Table 8), country of origin (Table 9), and length of stay in Australia (Table 11). However, foundation students scored significantly higher on the reference to others variable than their secondary school peers (Table 10). We recommended counseling for students with high support needs and further large-scale mixed-methods research to gain additional insights. PMID:24373267

Epistemic Views of the Relationship between Physics and Mathematics: Its Influence on the Approach of Undergraduate Students to Problem Solving

ERIC Educational Resources Information Center

Pereira de Ataide, Ana Raquel; Greca, Ileana Maria

2013-01-01

The relationship between physics and mathematics is hardly ever presented with sufficient clarity to satisfy either physicists or mathematicians. It is a situation that often leads to misunderstandings that may spread quickly from teacher to student, such as the idea that mathematics is a mere instrument for the physicist. In this paper, we…

Developing a Gesture-Based Game for Mentally Disabled People to Teach Basic Life Skills

ERIC Educational Resources Information Center

Nazirzadeh, Mohammad Javad; Çagiltay, Kürsat; Karasu, Necdet

2017-01-01

It is understood that, for mentally disabled people, it is hard to generalize skills and concepts from one setting to another. One approach to teach generalization is solving the problems related to their daily lives, which helps them to reinforce some of their behaviors that would occur in the natural environment. The aim of this study is to…

Two-Stage orders sequencing system for mixed-model assembly

NASA Astrophysics Data System (ADS)

Zemczak, M.; Skolud, B.; Krenczyk, D.

2015-11-01

In the paper, the authors focus on the NP-hard problem of orders sequencing, formulated similarly to Car Sequencing Problem (CSP). The object of the research is the assembly line in an automotive industry company, on which few different models of products, each in a certain number of versions, are assembled on the shared resources, set in a line. Such production type is usually determined as a mixed-model production, and arose from the necessity of manufacturing customized products on the basis of very specific orders from single clients. The producers are nowadays obliged to provide each client the possibility to determine a huge amount of the features of the product they are willing to buy, as the competition in the automotive market is large. Due to the previously mentioned nature of the problem (NP-hard), in the given time period only satisfactory solutions are sought, as the optimal solution method has not yet been found. Most of the researchers that implemented inaccurate methods (e.g. evolutionary algorithms) to solving sequencing problems dropped the research after testing phase, as they were not able to obtain reproducible results, and met problems while determining the quality of the received solutions. Therefore a new approach to solving the problem, presented in this paper as a sequencing system is being developed. The sequencing system consists of a set of determined rules, implemented into computer environment. The system itself works in two stages. First of them is connected with the determination of a place in the storage buffer to which certain production orders should be sent. In the second stage of functioning, precise sets of sequences are determined and evaluated for certain parts of the storage buffer under certain criteria.

A multilevel probabilistic beam search algorithm for the shortest common supersequence problem.

PubMed

Gallardo, José E

2012-01-01

The shortest common supersequence problem is a classical problem with many applications in different fields such as planning, Artificial Intelligence and especially in Bioinformatics. Due to its NP-hardness, we can not expect to efficiently solve this problem using conventional exact techniques. This paper presents a heuristic to tackle this problem based on the use at different levels of a probabilistic variant of a classical heuristic known as Beam Search. The proposed algorithm is empirically analysed and compared to current approaches in the literature. Experiments show that it provides better quality solutions in a reasonable time for medium and large instances of the problem. For very large instances, our heuristic also provides better solutions, but required execution times may increase considerably.

Solving the Mystery of the Short-Hard Gamma-Ray Bursts

NASA Astrophysics Data System (ADS)

Fox, Derek

2004-07-01

Seven years after the afterglow detections that revolutionized studies of the long-soft gamma-ray bursts, not even one afterglow of a short-hard GRB has been seen, and the nature of these events has become one of the most important problems in GRB research. The forthcoming Swift satellite will report few-arcsecond localizations for short-hard bursts in minutes, however, enabling prompt, deep optical afterglow searches for the first time. Discovery and observation of the first short-hard optical afterglows will answer most of the critical questions about these events: What are their distances and energies? Do they occur in distant galaxies, and if so, in which regions of those galaxies? Are they the result of collimated or quasi-spherical explosions? In combination with an extensive rapid-response ground-based campaign, we propose to make the critical high-sensitivity HST TOO observations that will allow us to answer these questions. If theorists are correct in attributing the short-hard bursts to binary neutron star coalescence events, then the short-hard bursts are signposts to the primary targeted source population for ground-based gravitational-wave detectors, and short-hard burst studies will have a vital role to play in guiding their observations.

Connected Component Model for Multi-Object Tracking.

PubMed

He, Zhenyu; Li, Xin; You, Xinge; Tao, Dacheng; Tang, Yuan Yan

2016-08-01

In multi-object tracking, it is critical to explore the data associations by exploiting the temporal information from a sequence of frames rather than the information from the adjacent two frames. Since straightforwardly obtaining data associations from multi-frames is an NP-hard multi-dimensional assignment (MDA) problem, most existing methods solve this MDA problem by either developing complicated approximate algorithms, or simplifying MDA as a 2D assignment problem based upon the information extracted only from adjacent frames. In this paper, we show that the relation between associations of two observations is the equivalence relation in the data association problem, based on the spatial-temporal constraint that the trajectories of different objects must be disjoint. Therefore, the MDA problem can be equivalently divided into independent subproblems by equivalence partitioning. In contrast to existing works for solving the MDA problem, we develop a connected component model (CCM) by exploiting the constraints of the data association and the equivalence relation on the constraints. Based upon CCM, we can efficiently obtain the global solution of the MDA problem for multi-object tracking by optimizing a sequence of independent data association subproblems. Experiments on challenging public data sets demonstrate that our algorithm outperforms the state-of-the-art approaches.

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem

PubMed Central

Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue

2015-01-01

As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods. PMID:26176764

Assessment of fluoride contaminations in groundwater of hard rock aquifers in Madurai district, Tamil Nadu (India)

NASA Astrophysics Data System (ADS)

Thivya, C.; Chidambaram, S.; Rao, M. S.; Thilagavathi, R.; Prasanna, M. V.; Manikandan, S.

2017-05-01

The fluoride contamination in drinking water is already gone to the alarming level and it needs the immediate involvement and attention of all people to solve this problem. Fluoride problem is higher in hard rock terrains in worldwide and Madurai is such type of hard rock region. Totally 54 samples were collected from the Madurai district of Tamilnadu with respect to lithology. The samples collected were analysed for major cations and anions using standard procedures. The higher concentration of fluoride is noted in the Charnockite rock types of northern part of the study area. 20 % of samples are below 0.5 ppm and 6 % of samples are above 1.5 ppm exceeding the permissible limit. The affinity between the pH and fluoride ions in groundwater suggests that dissolution of fluoride bearing minerals in groundwater. The higher concentration of fluoride ions are observed in the lower EC concentration. The isotopic study suggests that fluoride is geogenic in nature. In factor scores, fluoride is noted in association with pH which indicates the dissolution process.

Novel water-air circulation quenching process for AISI 4140 steel

NASA Astrophysics Data System (ADS)

Zheng, Liyun; Zheng, Dawei; Zhao, Lixin; Wang, Lihui; Zhang, Kai

2013-11-01

AISI 4140 steel is usually used after quenching and tempering. During the heat treatment process in industry production, there are some problems, such as quenching cracks, related to water-cooling and low hardness due to oil quenching. A water-air circulation quenching process can solve the problems of quenching cracks with water and the high cost quenching with oil, which is flammable, unsafe and not enough to obtain the required hardness. The control of the water-cooling and air-cooling time is a key factor in the process. This paper focuses on the quenching temperature, water-air cycle time and cycle index to prevent cracking for AISI 4140 steel. The optimum heat treatment parameters to achieve a good match of the strength and toughness of AISI 4140 steel were obtained by repeated adjustment of the water-air circulation quenching process parameters. The tensile strength, Charpy impact energy at -10 °C and hardness of the heat treated AISI 4140 steel after quenching and tempering were approximately 1098 MPa, 67.5 J and 316 HB, respectively.

Complex network problems in physics, computer science and biology

NASA Astrophysics Data System (ADS)

Cojocaru, Radu Ionut

There is a close relation between physics and mathematics and the exchange of ideas between these two sciences are well established. However until few years ago there was no such a close relation between physics and computer science. Even more, only recently biologists started to use methods and tools from statistical physics in order to study the behavior of complex system. In this thesis we concentrate on applying and analyzing several methods borrowed from computer science to biology and also we use methods from statistical physics in solving hard problems from computer science. In recent years physicists have been interested in studying the behavior of complex networks. Physics is an experimental science in which theoretical predictions are compared to experiments. In this definition, the term prediction plays a very important role: although the system is complex, it is still possible to get predictions for its behavior, but these predictions are of a probabilistic nature. Spin glasses, lattice gases or the Potts model are a few examples of complex systems in physics. Spin glasses and many frustrated antiferromagnets map exactly to computer science problems in the NP-hard class defined in Chapter 1. In Chapter 1 we discuss a common result from artificial intelligence (AI) which shows that there are some problems which are NP-complete, with the implication that these problems are difficult to solve. We introduce a few well known hard problems from computer science (Satisfiability, Coloring, Vertex Cover together with Maximum Independent Set and Number Partitioning) and then discuss their mapping to problems from physics. In Chapter 2 we provide a short review of combinatorial optimization algorithms and their applications to ground state problems in disordered systems. We discuss the cavity method initially developed for studying the Sherrington-Kirkpatrick model of spin glasses. We extend this model to the study of a specific case of spin glass on the Bethe lattice at zero temperature and then we apply this formalism to the K-SAT problem defined in Chapter 1. The phase transition which physicists study often corresponds to a change in the computational complexity of the corresponding computer science problem. Chapter 3 presents phase transitions which are specific to the problems discussed in Chapter 1 and also known results for the K-SAT problem. We discuss the replica method and experimental evidences of replica symmetry breaking. The physics approach to hard problems is based on replica methods which are difficult to understand. In Chapter 4 we develop novel methods for studying hard problems using methods similar to the message passing techniques that were discussed in Chapter 2. Although we concentrated on the symmetric case, cavity methods show promise for generalizing our methods to the un-symmetric case. As has been highlighted by John Hopfield, several key features of biological systems are not shared by physical systems. Although living entities follow the laws of physics and chemistry, the fact that organisms adapt and reproduce introduces an essential ingredient that is missing in the physical sciences. In order to extract information from networks many algorithm have been developed. In Chapter 5 we apply polynomial algorithms like minimum spanning tree in order to study and construct gene regulatory networks from experimental data. As future work we propose the use of algorithms like min-cut/max-flow and Dijkstra for understanding key properties of these networks.

Transition-Independent Decentralized Markov Decision Processes

NASA Technical Reports Server (NTRS)

Becker, Raphen; Silberstein, Shlomo; Lesser, Victor; Goldman, Claudia V.; Morris, Robert (Technical Monitor)

2003-01-01

There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of multi-agent systems is lacking. A recent complexity result, showing that solving decentralized MDPs is NEXP-hard, provides a partial explanation. To overcome this complexity barrier, we identify a general class of transition-independent decentralized MDPs that is widely applicable. The class consists of independent collaborating agents that are tied up by a global reward function that depends on both of their histories. We present a novel algorithm for solving this class of problems and examine its properties. The result is the first effective technique to solve optimally a class of decentralized MDPs. This lays the foundation for further work in this area on both exact and approximate solutions.

Comment on "Calculations for the one-dimensional soft Coulomb problem and the hard Coulomb limit".

PubMed

Carrillo-Bernal, M A; Núñez-Yépez, H N; Salas-Brito, A L; Solis, Didier A

2015-02-01

In the referred paper, the authors use a numerical method for solving ordinary differential equations and a softened Coulomb potential -1/√[x(2)+β(2)] to study the one-dimensional Coulomb problem by approaching the parameter β to zero. We note that even though their numerical findings in the soft potential scenario are correct, their conclusions do not extend to the one-dimensional Coulomb problem (β=0). Their claims regarding the possible existence of an even ground state with energy -∞ with a Dirac-δ eigenfunction and of well-defined parity eigenfunctions in the one-dimensional hydrogen atom are questioned.

SART-Type Half-Threshold Filtering Approach for CT Reconstruction

PubMed Central

YU, HENGYONG; WANG, GE

2014-01-01

The ℓ1 regularization problem has been widely used to solve the sparsity constrained problems. To enhance the sparsity constraint for better imaging performance, a promising direction is to use the ℓp norm (0 < p < 1) and solve the ℓp minimization problem. Very recently, Xu et al. developed an analytic solution for the ℓ1∕2 regularization via an iterative thresholding operation, which is also referred to as half-threshold filtering. In this paper, we design a simultaneous algebraic reconstruction technique (SART)-type half-threshold filtering framework to solve the computed tomography (CT) reconstruction problem. In the medical imaging filed, the discrete gradient transform (DGT) is widely used to define the sparsity. However, the DGT is noninvertible and it cannot be applied to half-threshold filtering for CT reconstruction. To demonstrate the utility of the proposed SART-type half-threshold filtering framework, an emphasis of this paper is to construct a pseudoinverse transforms for DGT. The proposed algorithms are evaluated with numerical and physical phantom data sets. Our results show that the SART-type half-threshold filtering algorithms have great potential to improve the reconstructed image quality from few and noisy projections. They are complementary to the counterparts of the state-of-the-art soft-threshold filtering and hard-threshold filtering. PMID:25530928

SART-Type Half-Threshold Filtering Approach for CT Reconstruction.

PubMed

Yu, Hengyong; Wang, Ge

2014-01-01

The [Formula: see text] regularization problem has been widely used to solve the sparsity constrained problems. To enhance the sparsity constraint for better imaging performance, a promising direction is to use the [Formula: see text] norm (0 < p < 1) and solve the [Formula: see text] minimization problem. Very recently, Xu et al. developed an analytic solution for the [Formula: see text] regularization via an iterative thresholding operation, which is also referred to as half-threshold filtering. In this paper, we design a simultaneous algebraic reconstruction technique (SART)-type half-threshold filtering framework to solve the computed tomography (CT) reconstruction problem. In the medical imaging filed, the discrete gradient transform (DGT) is widely used to define the sparsity. However, the DGT is noninvertible and it cannot be applied to half-threshold filtering for CT reconstruction. To demonstrate the utility of the proposed SART-type half-threshold filtering framework, an emphasis of this paper is to construct a pseudoinverse transforms for DGT. The proposed algorithms are evaluated with numerical and physical phantom data sets. Our results show that the SART-type half-threshold filtering algorithms have great potential to improve the reconstructed image quality from few and noisy projections. They are complementary to the counterparts of the state-of-the-art soft-threshold filtering and hard-threshold filtering.

BiCluE - Exact and heuristic algorithms for weighted bi-cluster editing of biomedical data

PubMed Central

2013-01-01

Background The explosion of biological data has dramatically reformed today's biology research. The biggest challenge to biologists and bioinformaticians is the integration and analysis of large quantity of data to provide meaningful insights. One major problem is the combined analysis of data from different types. Bi-cluster editing, as a special case of clustering, which partitions two different types of data simultaneously, might be used for several biomedical scenarios. However, the underlying algorithmic problem is NP-hard. Results Here we contribute with BiCluE, a software package designed to solve the weighted bi-cluster editing problem. It implements (1) an exact algorithm based on fixed-parameter tractability and (2) a polynomial-time greedy heuristics based on solving the hardest part, edge deletions, first. We evaluated its performance on artificial graphs. Afterwards we exemplarily applied our implementation on real world biomedical data, GWAS data in this case. BiCluE generally works on any kind of data types that can be modeled as (weighted or unweighted) bipartite graphs. Conclusions To our knowledge, this is the first software package solving the weighted bi-cluster editing problem. BiCluE as well as the supplementary results are available online at http://biclue.mpi-inf.mpg.de. PMID:24565035

Real-time object-to-features vectorisation via Siamese neural networks

NASA Astrophysics Data System (ADS)

Fedorenko, Fedor; Usilin, Sergey

2017-03-01

Object-to-features vectorisation is a hard problem to solve for objects that can be hard to distinguish. Siamese and Triplet neural networks are one of the more recent tools used for such task. However, most networks used are very deep networks that prove to be hard to compute in the Internet of Things setting. In this paper, a computationally efficient neural network is proposed for real-time object-to-features vectorisation into a Euclidean metric space. We use L2 distance to reflect feature vector similarity during both training and testing. In this way, feature vectors we develop can be easily classified using K-Nearest Neighbours classifier. Such approach can be used to train networks to vectorise such "problematic" objects like images of human faces, keypoint image patches, like keypoints on Arctic maps and surrounding marine areas.

Genetic algorithms for the vehicle routing problem

NASA Astrophysics Data System (ADS)

Volna, Eva

2016-06-01

The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.

A Comparison of Approaches for Solving Hard Graph-Theoretic Problems

DTIC Science & Technology

2015-05-01

collaborative effort “ Adiabatic Quantum Computing Applications Research” (14-RI-CRADA-02) between the Information Directorate and Lock- 3 Algorithm 3...using Matlab, a quantum annealing approach using the D-Wave computer , and lastly using satisfiability modulo theory (SMT) and corresponding SMT...methods are explored and consist of a parallel computing approach using Matlab, a quantum annealing approach using the D-Wave computer , and lastly using

TOC and TRIZ: using a dual-methodological approach to solve a forest harvesting problem

Treesearch

Ian Conradie

2005-01-01

Although cut-to-length forest harvesting with harvesters and forwarders is hardly used in some parts of the world, it has many advantages over conventional harvesting systems. Research has shown that the core reason for the low adoption of CTL in the southeastern USA is the complexity of the equipment to optimize value recovery. In this paper we delve deeper into this...

The Hard Problem of Cooperation

PubMed Central

Eriksson, Kimmo; Strimling, Pontus

2012-01-01

Based on individual variation in cooperative inclinations, we define the “hard problem of cooperation” as that of achieving high levels of cooperation in a group of non-cooperative types. Can the hard problem be solved by institutions with monitoring and sanctions? In a laboratory experiment we find that the answer is affirmative if the institution is imposed on the group but negative if development of the institution is left to the group to vote on. In the experiment, participants were divided into groups of either cooperative types or non-cooperative types depending on their behavior in a public goods game. In these homogeneous groups they repeatedly played a public goods game regulated by an institution that incorporated several of the key properties identified by Ostrom: operational rules, monitoring, rewards, punishments, and (in one condition) change of rules. When change of rules was not possible and punishments were set to be high, groups of both types generally abided by operational rules demanding high contributions to the common good, and thereby achieved high levels of payoffs. Under less severe rules, both types of groups did worse but non-cooperative types did worst. Thus, non-cooperative groups profited the most from being governed by an institution demanding high contributions and employing high punishments. Nevertheless, in a condition where change of rules through voting was made possible, development of the institution in this direction was more often voted down in groups of non-cooperative types. We discuss the relevance of the hard problem and fit our results into a bigger picture of institutional and individual determinants of cooperative behavior. PMID:22792282

Physics and Hard Disk Drives-A Career in Industry

NASA Astrophysics Data System (ADS)

Lambert, Steven

2014-03-01

I will participate in a panel discussion about ``Career Opportunities for Physicists.'' I enjoyed 27 years doing technology development and product support in the hard disk drive business. My PhD in low temperature physics was excellent training for this career since I learned how to work in a lab, analyze data, write and present technical information, and define experiments that got to the heart of a problem. An academic position did not appeal to me because I had no passion to pursue a particular topic in basic physics. My work in industry provided an unending stream of challenging problems to solve, and it was a rich and rewarding experience. I'm now employed by the APS to focus on our interactions with physicists in industry. I welcome the chance to share my industrial experience with students, post-docs, and others who are making decisions about their career path. Industrial Physics Fellow, APS Headquarters.

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Groer, Christopher S; Sullivan, Blair D; Weerapurage, Dinesh P

2012-10-01

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms wemore » have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.« less

Data Assimilation on a Quantum Annealing Computer: Feasibility and Scalability

NASA Astrophysics Data System (ADS)

Nearing, G. S.; Halem, M.; Chapman, D. R.; Pelissier, C. S.

2014-12-01

Data assimilation is one of the ubiquitous and computationally hard problems in the Earth Sciences. In particular, ensemble-based methods require a large number of model evaluations to estimate the prior probability density over system states, and variational methods require adjoint calculations and iteration to locate the maximum a posteriori solution in the presence of nonlinear models and observation operators. Quantum annealing computers (QAC) like the new D-Wave housed at the NASA Ames Research Center can be used for optimization and sampling, and therefore offers a new possibility for efficiently solving hard data assimilation problems. Coding on the QAC is not straightforward: a problem must be posed as a Quadratic Unconstrained Binary Optimization (QUBO) and mapped to a spherical Chimera graph. We have developed a method for compiling nonlinear 4D-Var problems on the D-Wave that consists of five steps: Emulating the nonlinear model and/or observation function using radial basis functions (RBF) or Chebyshev polynomials. Truncating a Taylor series around each RBF kernel. Reducing the Taylor polynomial to a quadratic using ancilla gadgets. Mapping the real-valued quadratic to a fixed-precision binary quadratic. Mapping the fully coupled binary quadratic to a partially coupled spherical Chimera graph using ancilla gadgets. At present the D-Wave contains 512 qbits (with 1024 and 2048 qbit machines due in the next two years); this machine size allows us to estimate only 3 state variables at each satellite overpass. However, QAC's solve optimization problems using a physical (quantum) system, and therefore do not require iterations or calculation of model adjoints. This has the potential to revolutionize our ability to efficiently perform variational data assimilation, as the size of these computers grows in the coming years.

The median problems on linear multichromosomal genomes: graph representation and fast exact solutions.

PubMed

Xu, Andrew Wei

2010-09-01

In genome rearrangement, given a set of genomes G and a distance measure d, the median problem asks for another genome q that minimizes the total distance [Formula: see text]. This is a key problem in genome rearrangement based phylogenetic analysis. Although this problem is known to be NP-hard, we have shown in a previous article, on circular genomes and under the DCJ distance measure, that a family of patterns in the given genomes--represented by adequate subgraphs--allow us to rapidly find exact solutions to the median problem in a decomposition approach. In this article, we extend this result to the case of linear multichromosomal genomes, in order to solve more interesting problems on eukaryotic nuclear genomes. A multi-way capping problem in the linear multichromosomal case imposes an extra computational challenge on top of the difficulty in the circular case, and this difficulty has been underestimated in our previous study and is addressed in this article. We represent the median problem by the capped multiple breakpoint graph, extend the adequate subgraphs into the capped adequate subgraphs, and prove optimality-preserving decomposition theorems, which give us the tools to solve the median problem and the multi-way capping optimization problem together. We also develop an exact algorithm ASMedian-linear, which iteratively detects instances of (capped) adequate subgraphs and decomposes problems into subproblems. Tested on simulated data, ASMedian-linear can rapidly solve most problems with up to several thousand genes, and it also can provide optimal or near-optimal solutions to the median problem under the reversal/HP distance measures. ASMedian-linear is available at http://sites.google.com/site/andrewweixu .

Approximate ground states of the random-field Potts model from graph cuts

NASA Astrophysics Data System (ADS)

Kumar, Manoj; Kumar, Ravinder; Weigel, Martin; Banerjee, Varsha; Janke, Wolfhard; Puri, Sanjay

2018-05-01

While the ground-state problem for the random-field Ising model is polynomial, and can be solved using a number of well-known algorithms for maximum flow or graph cut, the analog random-field Potts model corresponds to a multiterminal flow problem that is known to be NP-hard. Hence an efficient exact algorithm is very unlikely to exist. As we show here, it is nevertheless possible to use an embedding of binary degrees of freedom into the Potts spins in combination with graph-cut methods to solve the corresponding ground-state problem approximately in polynomial time. We benchmark this heuristic algorithm using a set of quasiexact ground states found for small systems from long parallel tempering runs. For a not-too-large number q of Potts states, the method based on graph cuts finds the same solutions in a fraction of the time. We employ the new technique to analyze the breakup length of the random-field Potts model in two dimensions.

Dynamic Harmony Search with Polynomial Mutation Algorithm for Valve-Point Economic Load Dispatch

PubMed Central

Karthikeyan, M.; Sree Ranga Raja, T.

2015-01-01

Economic load dispatch (ELD) problem is an important issue in the operation and control of modern control system. The ELD problem is complex and nonlinear with equality and inequality constraints which makes it hard to be efficiently solved. This paper presents a new modification of harmony search (HS) algorithm named as dynamic harmony search with polynomial mutation (DHSPM) algorithm to solve ORPD problem. In DHSPM algorithm the key parameters of HS algorithm like harmony memory considering rate (HMCR) and pitch adjusting rate (PAR) are changed dynamically and there is no need to predefine these parameters. Additionally polynomial mutation is inserted in the updating step of HS algorithm to favor exploration and exploitation of the search space. The DHSPM algorithm is tested with three power system cases consisting of 3, 13, and 40 thermal units. The computational results show that the DHSPM algorithm is more effective in finding better solutions than other computational intelligence based methods. PMID:26491710

Dynamic Harmony Search with Polynomial Mutation Algorithm for Valve-Point Economic Load Dispatch.

PubMed

Karthikeyan, M; Raja, T Sree Ranga

2015-01-01

Economic load dispatch (ELD) problem is an important issue in the operation and control of modern control system. The ELD problem is complex and nonlinear with equality and inequality constraints which makes it hard to be efficiently solved. This paper presents a new modification of harmony search (HS) algorithm named as dynamic harmony search with polynomial mutation (DHSPM) algorithm to solve ORPD problem. In DHSPM algorithm the key parameters of HS algorithm like harmony memory considering rate (HMCR) and pitch adjusting rate (PAR) are changed dynamically and there is no need to predefine these parameters. Additionally polynomial mutation is inserted in the updating step of HS algorithm to favor exploration and exploitation of the search space. The DHSPM algorithm is tested with three power system cases consisting of 3, 13, and 40 thermal units. The computational results show that the DHSPM algorithm is more effective in finding better solutions than other computational intelligence based methods.

Daily Stress, Hearing-Specific Stress and Coping: Self-reports from Deaf or Hard of Hearing Children and Children With Auditory Processing Disorder.

PubMed

Eschenbeck, Heike; Gillé, Vera; Heim-Dreger, Uwe; Schock, Alexandra; Schott, Andrea

2017-01-01

This study evaluated stressors and coping strategies in 70 children who are deaf or hard of hearing (D/HH) or with auditory processing disorder (APD) attending Grades 5 and 6 of a school for deaf and hard-of-hearing children. Everyday general stressors and more hearing-specific stressors were examined in a hearing-specific modified stress and coping questionnaire. Reports were compared with normative data for hearing children. Regarding everyday general stressors, stress levels for children who are D/HH or with APD did not differ from those of hearing children. Within children with hearing problems, everyday stressors were experienced as more stressful than hearing-specific stressors. For coping strategies, differences between children with hearing problems (D/HH, APD) and hearing children were shown (i.e., problem solving, anger-related emotion regulation). Girls scored higher in seeking social support whereas boys reported higher amounts of media use as a way of coping. Differences regarding stress and coping between children who are D/HH and children with APD were minor; D/HH children reported more social support seeking. Implications for assessment and resource promotion are discussed. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Estimates of the absolute error and a scheme for an approximate solution to scheduling problems

NASA Astrophysics Data System (ADS)

Lazarev, A. A.

2009-02-01

An approach is proposed for estimating absolute errors and finding approximate solutions to classical NP-hard scheduling problems of minimizing the maximum lateness for one or many machines and makespan is minimized. The concept of a metric (distance) between instances of the problem is introduced. The idea behind the approach is, given the problem instance, to construct another instance for which an optimal or approximate solution can be found at the minimum distance from the initial instance in the metric introduced. Instead of solving the original problem (instance), a set of approximating polynomially/pseudopolynomially solvable problems (instances) are considered, an instance at the minimum distance from the given one is chosen, and the resulting schedule is then applied to the original instance.

Acceleration of image-based resolution modelling reconstruction using an expectation maximization nested algorithm.

PubMed

Angelis, G I; Reader, A J; Markiewicz, P J; Kotasidis, F A; Lionheart, W R; Matthews, J C

2013-08-07

Recent studies have demonstrated the benefits of a resolution model within iterative reconstruction algorithms in an attempt to account for effects that degrade the spatial resolution of the reconstructed images. However, these algorithms suffer from slower convergence rates, compared to algorithms where no resolution model is used, due to the additional need to solve an image deconvolution problem. In this paper, a recently proposed algorithm, which decouples the tomographic and image deconvolution problems within an image-based expectation maximization (EM) framework, was evaluated. This separation is convenient, because more computational effort can be placed on the image deconvolution problem and therefore accelerate convergence. Since the computational cost of solving the image deconvolution problem is relatively small, multiple image-based EM iterations do not significantly increase the overall reconstruction time. The proposed algorithm was evaluated using 2D simulations, as well as measured 3D data acquired on the high-resolution research tomograph. Results showed that bias reduction can be accelerated by interleaving multiple iterations of the image-based EM algorithm solving the resolution model problem, with a single EM iteration solving the tomographic problem. Significant improvements were observed particularly for voxels that were located on the boundaries between regions of high contrast within the object being imaged and for small regions of interest, where resolution recovery is usually more challenging. Minor differences were observed using the proposed nested algorithm, compared to the single iteration normally performed, when an optimal number of iterations are performed for each algorithm. However, using the proposed nested approach convergence is significantly accelerated enabling reconstruction using far fewer tomographic iterations (up to 70% fewer iterations for small regions). Nevertheless, the optimal number of nested image-based EM iterations is hard to be defined and it should be selected according to the given application.

Sediment Transport Model In Sayung District, Demak

NASA Astrophysics Data System (ADS)

Ismanto, Aris; Zainuri, Muhammad; Hutabarat, Sahala; Nugroho Sugianto, Denny; Widada, Sugeng; Wirasatriya, Anindya

2017-02-01

Demak has 34,1 km coastline and located in 6043‧26″ - 7009‧43″ South Latitude and 110027‧58″ - 110048‧47″ East Longitude. In the last few years rapid shoreline and erosion has threatened Demak coastal area. No less than 3000 villages on Java suffer similar problems. Hard structures such as dykes and breakwaters is one of the method that is commonly used to solve this problem. However, this method may fail to provide adequate protection to the environment and become counterproductive. One of the alternative to solve the problem is using hybrid engineering concept. This study aims is to assess the distribution model of the sediment on the application of technology as a hybrid structure for the mitigationand rehabilitation of coastal areas in Demak. This research using quantitative method, including field surveys and mathematical modeling methods. The model show that the sedimention is quite big in highest flood condition and must have the right structure for the hybrid engineering. This study is expected to answer the question of the erosion problem in the District Sayung, Demak.

Finding long chains in kidney exchange using the traveling salesman problem.

PubMed

Anderson, Ross; Ashlagi, Itai; Gamarnik, David; Roth, Alvin E

2015-01-20

As of May 2014 there were more than 100,000 patients on the waiting list for a kidney transplant from a deceased donor. Although the preferred treatment is a kidney transplant, every year there are fewer donors than new patients, so the wait for a transplant continues to grow. To address this shortage, kidney paired donation (KPD) programs allow patients with living but biologically incompatible donors to exchange donors through cycles or chains initiated by altruistic (nondirected) donors, thereby increasing the supply of kidneys in the system. In many KPD programs a centralized algorithm determines which exchanges will take place to maximize the total number of transplants performed. This optimization problem has proven challenging both in theory, because it is NP-hard, and in practice, because the algorithms previously used were unable to optimally search over all long chains. We give two new algorithms that use integer programming to optimally solve this problem, one of which is inspired by the techniques used to solve the traveling salesman problem. These algorithms provide the tools needed to find optimal solutions in practice.

Finding long chains in kidney exchange using the traveling salesman problem

PubMed Central

Anderson, Ross; Ashlagi, Itai; Gamarnik, David; Roth, Alvin E.

2015-01-01

As of May 2014 there were more than 100,000 patients on the waiting list for a kidney transplant from a deceased donor. Although the preferred treatment is a kidney transplant, every year there are fewer donors than new patients, so the wait for a transplant continues to grow. To address this shortage, kidney paired donation (KPD) programs allow patients with living but biologically incompatible donors to exchange donors through cycles or chains initiated by altruistic (nondirected) donors, thereby increasing the supply of kidneys in the system. In many KPD programs a centralized algorithm determines which exchanges will take place to maximize the total number of transplants performed. This optimization problem has proven challenging both in theory, because it is NP-hard, and in practice, because the algorithms previously used were unable to optimally search over all long chains. We give two new algorithms that use integer programming to optimally solve this problem, one of which is inspired by the techniques used to solve the traveling salesman problem. These algorithms provide the tools needed to find optimal solutions in practice. PMID:25561535

Surveillance of a 2D Plane Area with 3D Deployed Cameras

PubMed Central

Fu, Yi-Ge; Zhou, Jie; Deng, Lei

2014-01-01

As the use of camera networks has expanded, camera placement to satisfy some quality assurance parameters (such as a good coverage ratio, an acceptable resolution constraints, an acceptable cost as low as possible, etc.) has become an important problem. The discrete camera deployment problem is NP-hard and many heuristic methods have been proposed to solve it, most of which make very simple assumptions. In this paper, we propose a probability inspired binary Particle Swarm Optimization (PI-BPSO) algorithm to solve a homogeneous camera network placement problem. We model the problem under some more realistic assumptions: (1) deploy the cameras in the 3D space while the surveillance area is restricted to a 2D ground plane; (2) deploy the minimal number of cameras to get a maximum visual coverage under more constraints, such as field of view (FOV) of the cameras and the minimum resolution constraints. We can simultaneously optimize the number and the configuration of the cameras through the introduction of a regulation item in the cost function. The simulation results showed the effectiveness of the proposed PI-BPSO algorithm. PMID:24469353

Veteran teachers' use of recommended practices in deaf education.

PubMed

Easterbrooks, Susan R; Stephenson, Brenda H; Gale, Elaine

2009-01-01

Deaf education teacher preparation programs face the likelihood that their graduates may not implement evidenced-based practices they were taught once they have graduated. The literature suggests that new teachers follow the school culture where they work rather than methods and strategies taught in their preparation programs. To investigate whether teachers of students who are deaf or hard of hearing (DHH) implement recommended practices, 23 teachers from three schools for the deaf were interviewed about their implementation and use of two recommended practices: independent reading and problem solving. The guiding questions were: Do teachers of students who are DHH use independent reading and problem solving after the enculturation process? If so, to what level? If not, can a review improve their level of use? Results demonstrated, at least regarding these two practices, that teachers of students who are DHH do implement evidence-based practices in their classrooms.

Spine lesion analysis in 3D CT data - Reporting on research progress

NASA Astrophysics Data System (ADS)

Jan, Jiri; Chmelik, Jiri; Jakubicek, Roman; Ourednicek, Petr; Amadori, Elena; Gavelli, Giampaolo

2018-04-01

The contribution describes progress in the long-term project concerning automatic diagnosis of spine bone lesions. There are two difficult problems: segmenting reliably possibly severely deformed vertebrae in the spine and then detect, segment and classify the lesions that are often hardly visible thus making even the medical expert decisions highly uncertain, with a large inter-expert variety. New approaches are described enabling to solve both problems with a success rate acceptable for clinical testing, at the same time speeding up the process substantially compared to the previous stage. The results are compared with previously published achievements.

Sequential Quadratic Programming Algorithms for Optimization

DTIC Science & Technology

1989-08-01

quadratic program- ma ng (SQ(2l ) aIiatain.seenis to be relgarded aIs tie( buest choice for the solution of smiall. dlense problema (see S tour L)toS...For the step along d, note that a < nOing + 3 szH + i3.ninA A a K f~Iz,;nd and from Id1 _< ,,, we must have that for some /3 , np , 11P11 < dn"p. 5.2...Nevertheless, many of these problems are considered hard to solve. Moreover, for some of these problems the assumptions made in Chapter 2 to establish the

Theoretical Aspects of the Patterns Recognition Statistical Theory Used for Developing the Diagnosis Algorithms for Complicated Technical Systems

NASA Astrophysics Data System (ADS)

Obozov, A. A.; Serpik, I. N.; Mihalchenko, G. S.; Fedyaeva, G. A.

2017-01-01

In the article, the problem of application of the pattern recognition (a relatively young area of engineering cybernetics) for analysis of complicated technical systems is examined. It is shown that the application of a statistical approach for hard distinguishable situations could be the most effective. The different recognition algorithms are based on Bayes approach, which estimates posteriori probabilities of a certain event and an assumed error. Application of the statistical approach to pattern recognition is possible for solving the problem of technical diagnosis complicated systems and particularly big powered marine diesel engines.

The Principle and the Application of Self-cleaning Anti-pollution Coating in Power System

NASA Astrophysics Data System (ADS)

Zhao, Y. J.; Zhang, Z. B.; Liu, Y.; Wang, J. H.; Teng, J. L.; Wu, L. S.; Zhang, Y. L.

2017-11-01

The common problem existed in power system is analyzed in this paper. The main reason for the affection of the safe and stable operation to power equipment is flash-over caused by dirt and discharge. Using the self-cleaning anti-pollution coating in the power equipment surface is the key to solve the problem. In the work, the research progress and design principle about the self-cleaning anti-pollution coating was summarized. Furthermore, the preparation technology was also studied. Finally, the application prospect of hard self-cleaning anti-pollution coating in power system was forecast.

Gravitational field calculations on a dynamic lattice by distributed computing.

NASA Astrophysics Data System (ADS)

Mähönen, P.; Punkka, V.

A new method of calculating numerically time evolution of a gravitational field in general relativity is introduced. Vierbein (tetrad) formalism, dynamic lattice and massively parallelized computation are suggested as they are expected to speed up the calculations considerably and facilitate the solution of problems previously considered too hard to be solved, such as the time evolution of a system consisting of two or more black holes or the structure of worm holes.

Gravitation Field Calculations on a Dynamic Lattice by Distributed Computing

NASA Astrophysics Data System (ADS)

Mähönen, Petri; Punkka, Veikko

A new method of calculating numerically time evolution of a gravitational field in General Relatity is introduced. Vierbein (tetrad) formalism, dynamic lattice and massively parallelized computation are suggested as they are expected to speed up the calculations considerably and facilitate the solution of problems previously considered too hard to be solved, such as the time evolution of a system consisting of two or more black holes or the structure of worm holes.

First flights of genetic-algorithm Kitty Hawk

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goldberg, D.E.

1994-12-31

The design of complex systems requires an effective methodology of invention. This paper considers the methodology of the Wright brothers in inventing the powered airplane and suggests how successes in the design of genetic algorithms have come at the hands of a Wright-brothers-like approach. Recent reliable subquadratic results in solving hard problems with nontraditional GAs and predictions of the limits of simple GAs are presented as two accomplishments achieved in this manner.

An efficient numerical method for solving the Boltzmann equation in multidimensions

NASA Astrophysics Data System (ADS)

Dimarco, Giacomo; Loubère, Raphaël; Narski, Jacek; Rey, Thomas

2018-01-01

In this paper we deal with the extension of the Fast Kinetic Scheme (FKS) (Dimarco and Loubère, 2013 [26]) originally constructed for solving the BGK equation, to the more challenging case of the Boltzmann equation. The scheme combines a robust and fast method for treating the transport part based on an innovative Lagrangian technique supplemented with conservative fast spectral schemes to treat the collisional operator by means of an operator splitting approach. This approach along with several implementation features related to the parallelization of the algorithm permits to construct an efficient simulation tool which is numerically tested against exact and reference solutions on classical problems arising in rarefied gas dynamic. We present results up to the 3 D × 3 D case for unsteady flows for the Variable Hard Sphere model which may serve as benchmark for future comparisons between different numerical methods for solving the multidimensional Boltzmann equation. For this reason, we also provide for each problem studied details on the computational cost and memory consumption as well as comparisons with the BGK model or the limit model of compressible Euler equations.

Improved teaching-learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

NASA Astrophysics Data System (ADS)

Buddala, Raviteja; Mahapatra, Siba Sankar

2017-11-01

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having `g' operations is performed on `g' operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem becomes a flexible flow shop problem (FFSP). FFSP which contains all the complexities involved in a simple flow shop and parallel machine scheduling problems is a well-known NP-hard (Non-deterministic polynomial time) problem. Owing to high computational complexity involved in solving these problems, it is not always possible to obtain an optimal solution in a reasonable computation time. To obtain near-optimal solutions in a reasonable computation time, a large variety of meta-heuristics have been proposed in the past. However, tuning algorithm-specific parameters for solving FFSP is rather tricky and time consuming. To address this limitation, teaching-learning-based optimization (TLBO) and JAYA algorithm are chosen for the study because these are not only recent meta-heuristics but they do not require tuning of algorithm-specific parameters. Although these algorithms seem to be elegant, they lose solution diversity after few iterations and get trapped at the local optima. To alleviate such drawback, a new local search procedure is proposed in this paper to improve the solution quality. Further, mutation strategy (inspired from genetic algorithm) is incorporated in the basic algorithm to maintain solution diversity in the population. Computational experiments have been conducted on standard benchmark problems to calculate makespan and computational time. It is found that the rate of convergence of TLBO is superior to JAYA. From the results, it is found that TLBO and JAYA outperform many algorithms reported in the literature and can be treated as efficient methods for solving the FFSP.

Integrated identification, modeling and control with applications

NASA Astrophysics Data System (ADS)

Shi, Guojun

This thesis deals with the integration of system design, identification, modeling and control. In particular, six interdisciplinary engineering problems are addressed and investigated. Theoretical results are established and applied to structural vibration reduction and engine control problems. First, the data-based LQG control problem is formulated and solved. It is shown that a state space model is not necessary to solve this problem; rather a finite sequence from the impulse response is the only model data required to synthesize an optimal controller. The new theory avoids unnecessary reliance on a model, required in the conventional design procedure. The infinite horizon model predictive control problem is addressed for multivariable systems. The basic properties of the receding horizon implementation strategy is investigated and the complete framework for solving the problem is established. The new theory allows the accommodation of hard input constraints and time delays. The developed control algorithms guarantee the closed loop stability. A closed loop identification and infinite horizon model predictive control design procedure is established for engine speed regulation. The developed algorithms are tested on the Cummins Engine Simulator and desired results are obtained. A finite signal-to-noise ratio model is considered for noise signals. An information quality index is introduced which measures the essential information precision required for stabilization. The problems of minimum variance control and covariance control are formulated and investigated. Convergent algorithms are developed for solving the problems of interest. The problem of the integrated passive and active control design is addressed in order to improve the overall system performance. A design algorithm is developed, which simultaneously finds: (i) the optimal values of the stiffness and damping ratios for the structure, and (ii) an optimal output variance constrained stabilizing controller such that the active control energy is minimized. A weighted q-Markov COVER method is introduced for identification with measurement noise. The result is use to develop an iterative closed loop identification/control design algorithm. The effectiveness of the algorithm is illustrated by experimental results.

The effect of beam-driven return current instability on solar hard X-ray bursts

NASA Technical Reports Server (NTRS)

Cromwell, D.; Mcquillan, P.; Brown, J. C.

1986-01-01

The problem of electrostatic wave generation by a return current driven by a small area electron beam during solar hard X-ray bursts is discussed. The marginal stability method is used to solve numerically the electron and ion heating equations for a prescribed beam current evolution. When ion-acoustic waves are considered, the method appears satisfactory and, following an initial phase of Coulomb resistivity in which T sub e/T sub i rise, predicts a rapid heating of substantial plasma volumes by anomalous ohmic dissipation. This hot plasma emits so much thermal bremsstrahlung that, contrary to previous expectations, the unstable beam-plasma system actually emits more hard X-rays than does the beam in the purely collisional thick target regime relevant to larger injection areas. Inclusion of ion-cyclotron waves results in ion-acoustic wave onset at lower T sub e/T sub i and a marginal stability treatment yields unphysical results.

Development of Water Softening Method of Intake in Magnitogorsk

NASA Astrophysics Data System (ADS)

Meshcherova, E. A.; Novoselova, J. N.; Moreva, J. A.

2017-11-01

This article contains an appraisal of the drinking water quality of Magnitogorsk intake. A water analysis was made which led to the conclusion that the standard for general water hardness was exceeded. As a result, it became necessary to develop a number of measures to reduce water hardness. To solve this problem all the necessary studies of the factors affecting the value of increased water hardness were carried out and the water softening method by using an ion exchange filter was proposed. The calculation of the cation-exchanger filling volume of the proposed filter is given in the article, its overall dimensions are chosen. The obtained calculations were confirmed by the results of laboratory studies by using the test installation. The research and laboratory tests results make the authors conclude that the proposed method should be used to obtain softened water for the requirements of SanPin.

Differential geometric treewidth estimation in adiabatic quantum computation

NASA Astrophysics Data System (ADS)

Wang, Chi; Jonckheere, Edmond; Brun, Todd

2016-10-01

The D-Wave adiabatic quantum computing platform is designed to solve a particular class of problems—the Quadratic Unconstrained Binary Optimization (QUBO) problems. Due to the particular "Chimera" physical architecture of the D-Wave chip, the logical problem graph at hand needs an extra process called minor embedding in order to be solvable on the D-Wave architecture. The latter problem is itself NP-hard. In this paper, we propose a novel polynomial-time approximation to the closely related treewidth based on the differential geometric concept of Ollivier-Ricci curvature. The latter runs in polynomial time and thus could significantly reduce the overall complexity of determining whether a QUBO problem is minor embeddable, and thus solvable on the D-Wave architecture.

Efficient computation of optimal actions.

PubMed

Todorov, Emanuel

2009-07-14

Optimal choice of actions is a fundamental problem relevant to fields as diverse as neuroscience, psychology, economics, computer science, and control engineering. Despite this broad relevance the abstract setting is similar: we have an agent choosing actions over time, an uncertain dynamical system whose state is affected by those actions, and a performance criterion that the agent seeks to optimize. Solving problems of this kind remains hard, in part, because of overly generic formulations. Here, we propose a more structured formulation that greatly simplifies the construction of optimal control laws in both discrete and continuous domains. An exhaustive search over actions is avoided and the problem becomes linear. This yields algorithms that outperform Dynamic Programming and Reinforcement Learning, and thereby solve traditional problems more efficiently. Our framework also enables computations that were not possible before: composing optimal control laws by mixing primitives, applying deterministic methods to stochastic systems, quantifying the benefits of error tolerance, and inferring goals from behavioral data via convex optimization. Development of a general class of easily solvable problems tends to accelerate progress--as linear systems theory has done, for example. Our framework may have similar impact in fields where optimal choice of actions is relevant.

IFSM fractal image compression with entropy and sparsity constraints: A sequential quadratic programming approach

NASA Astrophysics Data System (ADS)

Kunze, Herb; La Torre, Davide; Lin, Jianyi

2017-01-01

We consider the inverse problem associated with IFSM: Given a target function f , find an IFSM, such that its fixed point f ¯ is sufficiently close to f in the Lp distance. Forte and Vrscay [1] showed how to reduce this problem to a quadratic optimization model. In this paper, we extend the collage-based method developed by Kunze, La Torre and Vrscay ([2][3][4]), by proposing the minimization of the 1-norm instead of the 0-norm. In fact, optimization problems involving the 0-norm are combinatorial in nature, and hence in general NP-hard. To overcome these difficulties, we introduce the 1-norm and propose a Sequential Quadratic Programming algorithm to solve the corresponding inverse problem. As in Kunze, La Torre and Vrscay [3] in our formulation, the minimization of collage error is treated as a multi-criteria problem that includes three different and conflicting criteria i.e., collage error, entropy and sparsity. This multi-criteria program is solved by means of a scalarization technique which reduces the model to a single-criterion program by combining all objective functions with different trade-off weights. The results of some numerical computations are presented.

Achieving Crossed Strong Barrier Coverage in Wireless Sensor Network.

PubMed

Han, Ruisong; Yang, Wei; Zhang, Li

2018-02-10

Barrier coverage has been widely used to detect intrusions in wireless sensor networks (WSNs). It can fulfill the monitoring task while extending the lifetime of the network. Though barrier coverage in WSNs has been intensively studied in recent years, previous research failed to consider the problem of intrusion in transversal directions. If an intruder knows the deployment configuration of sensor nodes, then there is a high probability that it may traverse the whole target region from particular directions, without being detected. In this paper, we introduce the concept of crossed barrier coverage that can overcome this defect. We prove that the problem of finding the maximum number of crossed barriers is NP-hard and integer linear programming (ILP) is used to formulate the optimization problem. The branch-and-bound algorithm is adopted to determine the maximum number of crossed barriers. In addition, we also propose a multi-round shortest path algorithm (MSPA) to solve the optimization problem, which works heuristically to guarantee efficiency while maintaining near-optimal solutions. Several conventional algorithms for finding the maximum number of disjoint strong barriers are also modified to solve the crossed barrier problem and for the purpose of comparison. Extensive simulation studies demonstrate the effectiveness of MSPA.

Processing time tolerance-based ACO algorithm for solving job-shop scheduling problem

NASA Astrophysics Data System (ADS)

Luo, Yabo; Waden, Yongo P.

2017-06-01

Ordinarily, Job Shop Scheduling Problem (JSSP) is known as NP-hard problem which has uncertainty and complexity that cannot be handled by a linear method. Thus, currently studies on JSSP are concentrated mainly on applying different methods of improving the heuristics for optimizing the JSSP. However, there still exist many problems for efficient optimization in the JSSP, namely, low efficiency and poor reliability, which can easily trap the optimization process of JSSP into local optima. Therefore, to solve this problem, a study on Ant Colony Optimization (ACO) algorithm combined with constraint handling tactics is carried out in this paper. Further, the problem is subdivided into three parts: (1) Analysis of processing time tolerance-based constraint features in the JSSP which is performed by the constraint satisfying model; (2) Satisfying the constraints by considering the consistency technology and the constraint spreading algorithm in order to improve the performance of ACO algorithm. Hence, the JSSP model based on the improved ACO algorithm is constructed; (3) The effectiveness of the proposed method based on reliability and efficiency is shown through comparative experiments which are performed on benchmark problems. Consequently, the results obtained by the proposed method are better, and the applied technique can be used in optimizing JSSP.

An Effective Mechanism for Virtual Machine Placement using Aco in IAAS Cloud

NASA Astrophysics Data System (ADS)

Shenbaga Moorthy, Rajalakshmi; Fareentaj, U.; Divya, T. K.

2017-08-01

Cloud computing provides an effective way to dynamically provide numerous resources to meet customer demands. A major challenging problem for cloud providers is designing efficient mechanisms for optimal virtual machine Placement (OVMP). Such mechanisms enable the cloud providers to effectively utilize their available resources and obtain higher profits. In order to provide appropriate resources to the clients an optimal virtual machine placement algorithm is proposed. Virtual machine placement is NP-Hard problem. Such NP-Hard problem can be solved using heuristic algorithm. In this paper, Ant Colony Optimization based virtual machine placement is proposed. Our proposed system focuses on minimizing the cost spending in each plan for hosting virtual machines in a multiple cloud provider environment and the response time of each cloud provider is monitored periodically, in such a way to minimize delay in providing the resources to the users. The performance of the proposed algorithm is compared with greedy mechanism. The proposed algorithm is simulated in Eclipse IDE. The results clearly show that the proposed algorithm minimizes the cost, response time and also number of migrations.

Towards solving the hard problem of consciousness: The varieties of brain resonances and the conscious experiences that they support.

PubMed

Grossberg, Stephen

2017-03-01

The hard problem of consciousness is the problem of explaining how we experience qualia or phenomenal experiences, such as seeing, hearing, and feeling, and knowing what they are. To solve this problem, a theory of consciousness needs to link brain to mind by modeling how emergent properties of several brain mechanisms interacting together embody detailed properties of individual conscious psychological experiences. This article summarizes evidence that Adaptive Resonance Theory, or ART, accomplishes this goal. ART is a cognitive and neural theory of how advanced brains autonomously learn to attend, recognize, and predict objects and events in a changing world. ART has predicted that "all conscious states are resonant states" as part of its specification of mechanistic links between processes of consciousness, learning, expectation, attention, resonance, and synchrony. It hereby provides functional and mechanistic explanations of data ranging from individual spikes and their synchronization to the dynamics of conscious perceptual, cognitive, and cognitive-emotional experiences. ART has reached sufficient maturity to begin classifying the brain resonances that support conscious experiences of seeing, hearing, feeling, and knowing. Psychological and neurobiological data in both normal individuals and clinical patients are clarified by this classification. This analysis also explains why not all resonances become conscious, and why not all brain dynamics are resonant. The global organization of the brain into computationally complementary cortical processing streams (complementary computing), and the organization of the cerebral cortex into characteristic layers of cells (laminar computing), figure prominently in these explanations of conscious and unconscious processes. Alternative models of consciousness are also discussed. Copyright © 2016 The Author. Published by Elsevier Ltd.. All rights reserved.

Unraveling Quantum Annealers using Classical Hardness

PubMed Central

Martin-Mayor, Victor; Hen, Itay

2015-01-01

Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealing optimizers that contain hundreds of quantum bits. These optimizers, commonly referred to as ‘D-Wave’ chips, promise to solve practical optimization problems potentially faster than conventional ‘classical’ computers. Attempts to quantify the quantum nature of these chips have been met with both excitement and skepticism but have also brought up numerous fundamental questions pertaining to the distinguishability of experimental quantum annealers from their classical thermal counterparts. Inspired by recent results in spin-glass theory that recognize ‘temperature chaos’ as the underlying mechanism responsible for the computational intractability of hard optimization problems, we devise a general method to quantify the performance of quantum annealers on optimization problems suffering from varying degrees of temperature chaos: A superior performance of quantum annealers over classical algorithms on these may allude to the role that quantum effects play in providing speedup. We utilize our method to experimentally study the D-Wave Two chip on different temperature-chaotic problems and find, surprisingly, that its performance scales unfavorably as compared to several analogous classical algorithms. We detect, quantify and discuss several purely classical effects that possibly mask the quantum behavior of the chip. PMID:26483257

Expectation maximization for hard X-ray count modulation profiles

NASA Astrophysics Data System (ADS)

Benvenuto, F.; Schwartz, R.; Piana, M.; Massone, A. M.

2013-07-01

Context. This paper is concerned with the image reconstruction problem when the measured data are solar hard X-ray modulation profiles obtained from the Reuven Ramaty High Energy Solar Spectroscopic Imager (RHESSI) instrument. Aims: Our goal is to demonstrate that a statistical iterative method classically applied to the image deconvolution problem is very effective when utilized to analyze count modulation profiles in solar hard X-ray imaging based on rotating modulation collimators. Methods: The algorithm described in this paper solves the maximum likelihood problem iteratively and encodes a positivity constraint into the iterative optimization scheme. The result is therefore a classical expectation maximization method this time applied not to an image deconvolution problem but to image reconstruction from count modulation profiles. The technical reason that makes our implementation particularly effective in this application is the use of a very reliable stopping rule which is able to regularize the solution providing, at the same time, a very satisfactory Cash-statistic (C-statistic). Results: The method is applied to both reproduce synthetic flaring configurations and reconstruct images from experimental data corresponding to three real events. In this second case, the performance of expectation maximization, when compared to Pixon image reconstruction, shows a comparable accuracy and a notably reduced computational burden; when compared to CLEAN, shows a better fidelity with respect to the measurements with a comparable computational effectiveness. Conclusions: If optimally stopped, expectation maximization represents a very reliable method for image reconstruction in the RHESSI context when count modulation profiles are used as input data.

Connectivity Restoration in Wireless Sensor Networks via Space Network Coding.

PubMed

Uwitonze, Alfred; Huang, Jiaqing; Ye, Yuanqing; Cheng, Wenqing

2017-04-20

The problem of finding the number and optimal positions of relay nodes for restoring the network connectivity in partitioned Wireless Sensor Networks (WSNs) is Non-deterministic Polynomial-time hard (NP-hard) and thus heuristic methods are preferred to solve it. This paper proposes a novel polynomial time heuristic algorithm, namely, Relay Placement using Space Network Coding (RPSNC), to solve this problem, where Space Network Coding, also called Space Information Flow (SIF), is a new research paradigm that studies network coding in Euclidean space, in which extra relay nodes can be introduced to reduce the cost of communication. Unlike contemporary schemes that are often based on Minimum Spanning Tree (MST), Euclidean Steiner Minimal Tree (ESMT) or a combination of MST with ESMT, RPSNC is a new min-cost multicast space network coding approach that combines Delaunay triangulation and non-uniform partitioning techniques for generating a number of candidate relay nodes, and then linear programming is applied for choosing the optimal relay nodes and computing their connection links with terminals. Subsequently, an equilibrium method is used to refine the locations of the optimal relay nodes, by moving them to balanced positions. RPSNC can adapt to any density distribution of relay nodes and terminals, as well as any density distribution of terminals. The performance and complexity of RPSNC are analyzed and its performance is validated through simulation experiments.

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

NASA Astrophysics Data System (ADS)

Nouri, Houssem Eddine; Belkahla Driss, Olfa; Ghédira, Khaled

2018-03-01

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based clustered holonic multiagent model. First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space. Second, a local search technique is used by a set of cluster agents to guide the research in promising regions of the search space and to improve the quality of the NGA final population. The efficiency of our approach is explained by the flexible selection of the promising parts of the search space by the clustering operator after the genetic algorithm process, and by applying the intensification technique of the tabu search allowing to restart the search from a set of elite solutions to attain new dominant scheduling solutions. Computational results are presented using four sets of well-known benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

Problem-solving by traumatically brain injured and neurologically intact subjects on an adaptation of the twenty questions test.

PubMed

Marshall, Robert C; Karow, Colleen M; Morelli, Claudia A; Iden, Kristin K; Dixon, Judith

2003-07-01

RAPS (Rapid Assessment of Problem-Solving) is a clinical measure for assessing verbal problem-solving in hard-to-test patients or those that may not be able to tolerate a longer, more detailed assessment. The design of the test is based on Mosher and Hornsby's Twenty Question test, but RAPS contains several modifications to facilitate its use with brain-injured individuals. This study used RAPS to compare the verbal problem-solving ability of subjects that were neurologically intact and subjects that had chronic traumatic brain injuries. Twenty-one adults that were neurologically intact (NI) and 21 adults that had incurred a traumatic brain injury (TBI) matched for age, gender and education took part in the study. Before being tested with RAPS, participants signed an IRB-approved consent form and completed a battery of neurocognitive measures. RAPS entailed the solving of three verbal problems. Each problem involved an array of 32 pictures of common objects (e.g. football) arranged in a 4x 8 grid. The subjects were instructed to ask yes/no questions to determine which picture the examiner was 'thinking of '. Three scores were computed for each problem solved: number of questions asked, percentage of constraint-seeking questions, and question-asking efficiency scores for the first four questions. No learning effects across the problems were found for any of the RAPS measures. Scores were averaged across the three problems to determine group effects. Groups of TBI and NI subjects did not differ significantly in the number of questions asked in solving RAPS problems. Members of the NI group asked significantly more constraint-seeking questions (e.g. Is it an animal?) than those in the TBI group, and the subjects that had incurred brain injuries did more guessing than the NI group. Over 70% of the time, guessing took place after the semantic category containing the target picture was known to the subject. Guesses took the form of pseudo-constraint questions (e.g. Is it the animal with a long neck?) rather than frank guesses (e.g. Is it the giraffe?). These trends were seen for both groups. Question-asking efficiency scores, computed for the first four questions of each problem, reflected the amount of information gained by the subjects' questions. It was anticipated that subjects' questioning strategies would target larger rather than smaller number of pictures and systematically reduce the number of total pictures under consideration. Question-asking efficiency scores were significantly higher for the group of NI subjects. Both groups increased question-asking efficiency scores across the first four questions, and there was no significant group x question interaction. Further analysis of the question-asking efficiency scores revealed that questions from the group of NI subjects tended to target multiple categories of pictures and larger single semantic categories of pictures on the 32-item problem-solving board, whereas those from the group of TBI subjects often targeted smaller categories or portions of categories. Two meta-cognitive functions, planning and strategy shifting, appeared to explain most of the differences in the verbal problem-solving performance between the groups. Both groups, however, demonstrated a range of abilities on RAPS. Until a larger normative database for RAPS is available, it behooves clinicians using the test to analyse results on an individual basis, to consider the subject's pre-morbid problem-solving ability and to weigh those factors associated with brain injury that could affect RAPS performance.

Statistical physics of hard combinatorial optimization: Vertex cover problem

NASA Astrophysics Data System (ADS)

Zhao, Jin-Hua; Zhou, Hai-Jun

2014-07-01

Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.

Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center

NASA Astrophysics Data System (ADS)

Kel'manov, A. V.; Motkova, A. V.

2018-01-01

A strongly NP-hard problem of partitioning a finite set of points of Euclidean space into two clusters is considered. The solution criterion is the minimum of the sum (over both clusters) of weighted sums of squared distances from the elements of each cluster to its geometric center. The weights of the sums are equal to the cardinalities of the desired clusters. The center of one cluster is given as input, while the center of the other is unknown and is determined as the point of space equal to the mean of the cluster elements. A version of the problem is analyzed in which the cardinalities of the clusters are given as input. A polynomial-time 2-approximation algorithm for solving the problem is constructed.

Computational complexity in entanglement transformations

NASA Astrophysics Data System (ADS)

Chitambar, Eric A.

In physics, systems having three parts are typically much more difficult to analyze than those having just two. Even in classical mechanics, predicting the motion of three interacting celestial bodies remains an insurmountable challenge while the analogous two-body problem has an elementary solution. It is as if just by adding a third party, a fundamental change occurs in the structure of the problem that renders it unsolvable. In this thesis, we demonstrate how such an effect is likewise present in the theory of quantum entanglement. In fact, the complexity differences between two-party and three-party entanglement become quite conspicuous when comparing the difficulty in deciding what state changes are possible for these systems when no additional entanglement is consumed in the transformation process. We examine this entanglement transformation question and its variants in the language of computational complexity theory, a powerful subject that formalizes the concept of problem difficulty. Since deciding feasibility of a specified bipartite transformation is relatively easy, this task belongs to the complexity class P. On the other hand, for tripartite systems, we find the problem to be NP-Hard, meaning that its solution is at least as hard as the solution to some of the most difficult problems humans have encountered. One can then rigorously defend the assertion that a fundamental complexity difference exists between bipartite and tripartite entanglement since unlike the former, the full range of forms realizable by the latter is incalculable (assuming P≠NP). However, similar to the three-body celestial problem, when one examines a special subclass of the problem---invertible transformations on systems having at least one qubit subsystem---we prove that the problem can be solved efficiently. As a hybrid of the two questions, we find that the question of tripartite to bipartite transformations can be solved by an efficient randomized algorithm. Our results are obtained by encoding well-studied computational problems such as polynomial identity testing and tensor rank into questions of entanglement transformation. In this way, entanglement theory provides a physical manifestation of some of the most puzzling and abstract classical computation questions.

Solving the Mystery of the Short-Hard Gamma-Ray Bursts

NASA Astrophysics Data System (ADS)

Fox, Derek

2005-07-01

Eight years after the afterglow detections that revolutionized studies of the long-soft gamma-ray bursts, not even one afterglow of a short-hard GRB has been seen, and the nature of these events has become one of the most important problems in GRB research. The Swift satellite, expected to be in full operation throughout Cycle 14, will report few-arcsecond localizations for short-hard bursts in minutes, enabling prompt, deep optical afterglow searches for the first time. Discovery and observation of the first short-hard optical afterglows will answer most of the critical questions about these events: What are their distances and energies? Do they occur in distant galaxies, and if so, in which regions of those galaxies? Are they the result of collimated or quasi-spherical explosions? In combination with an extensive rapid-response ground-based campaign, we propose to make the critical high-sensitivity HST TOO observations that will allow us to answer these questions. If theorists are correct in attributing the short-hard bursts to binary neutron star coalescence events, then they will serve as signposts to the primary targeted source population for ground-based gravitational-wave detectors, and short-hard burst studies will have a vital role to play in guiding those observations.

Deep learning based hand gesture recognition in complex scenes

NASA Astrophysics Data System (ADS)

Ni, Zihan; Sang, Nong; Tan, Cheng

2018-03-01

Recently, region-based convolutional neural networks(R-CNNs) have achieved significant success in the field of object detection, but their accuracy is not too high for small objects and similar objects, such as the gestures. To solve this problem, we present an online hard example testing(OHET) technology to evaluate the confidence of the R-CNNs' outputs, and regard those outputs with low confidence as hard examples. In this paper, we proposed a cascaded networks to recognize the gestures. Firstly, we use the region-based fully convolutional neural network(R-FCN), which is capable of the detection for small object, to detect the gestures, and then use the OHET to select the hard examples. To enhance the accuracy of the gesture recognition, we re-classify the hard examples through VGG-19 classification network to obtain the final output of the gesture recognition system. Through the contrast experiments with other methods, we can see that the cascaded networks combined with the OHET reached to the state-of-the-art results of 99.3% mAP on small and similar gestures in complex scenes.

Fast optimization of binary clusters using a novel dynamic lattice searching method.

PubMed

Wu, Xia; Cheng, Wen

2014-09-28

Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd)79 clusters with DFT-fit parameters of Gupta potential.

Toward multiscale modelings of grain-fluid systems

NASA Astrophysics Data System (ADS)

Chareyre, Bruno; Yuan, Chao; Montella, Eduard P.; Salager, Simon

2017-06-01

Computationally efficient methods have been developed for simulating partially saturated granular materials in the pendular regime. In contrast, one hardly avoid expensive direct resolutions of 2-phase fluid dynamics problem for mixed pendular-funicular situations or even saturated regimes. Following previous developments for single-phase flow, a pore-network approach of the coupling problems is described. The geometry and movements of phases and interfaces are described on the basis of a tetrahedrization of the pore space, introducing elementary objects such as bridge, meniscus, pore body and pore throat, together with local rules of evolution. As firmly established local rules are still missing on some aspects (entry capillary pressure and pore-scale pressure-saturation relations, forces on the grains, or kinetics of transfers in mixed situations) a multi-scale numerical framework is introduced, enhancing the pore-network approach with the help of direct simulations. Small subsets of a granular system are extracted, in which multiphase scenario are solved using the Lattice-Boltzman method (LBM). In turns, a global problem is assembled and solved at the network scale, as illustrated by a simulated primary drainage.

Concussion treatment after combat trauma: development of a telephone based, problem solving intervention for service members.

PubMed

Bell, Kathleen R; Brockway, Jo Ann; Fann, Jesse R; Cole, Wesley R; St De Lore, Jef; Bush, Nigel; Lang, Ariel J; Hart, Tessa; Warren, Michael; Dikmen, Sureyya; Temkin, Nancy; Jain, Sonia; Raman, Rema; Stein, Murray B

2015-01-01

Military service members (SMs) and veterans who sustain mild traumatic brain injuries (mTBI) during combat deployments often have co-morbid conditions but are reluctant to seek out therapy in medical or mental health settings. Efficacious methods of intervention that are patient-centered and adaptable to a mobile and often difficult-to-reach population would be useful in improving quality of life. This article describes a new protocol developed as part of a randomized clinical trial of a telephone-mediated program for SMs with mTBI. The 12-session program combines problem solving training (PST) with embedded modules targeting depression, anxiety, insomnia, and headache. The rationale and development of this behavioral intervention for implementation with persons with multiple co-morbidities is described along with the proposed analysis of results. In particular, we provide details regarding the creation of a treatment that is manualized yet flexible enough to address a wide variety of problems and symptoms within a standard framework. The methods involved in enrolling and retaining an often hard-to-study population are also highlighted. Copyright © 2014 Elsevier Inc. All rights reserved.

Using Deep Learning Model for Meteorological Satellite Cloud Image Prediction

NASA Astrophysics Data System (ADS)

Su, X.

2017-12-01

A satellite cloud image contains much weather information such as precipitation information. Short-time cloud movement forecast is important for precipitation forecast and is the primary means for typhoon monitoring. The traditional methods are mostly using the cloud feature matching and linear extrapolation to predict the cloud movement, which makes that the nonstationary process such as inversion and deformation during the movement of the cloud is basically not considered. It is still a hard task to predict cloud movement timely and correctly. As deep learning model could perform well in learning spatiotemporal features, to meet this challenge, we could regard cloud image prediction as a spatiotemporal sequence forecasting problem and introduce deep learning model to solve this problem. In this research, we use a variant of Gated-Recurrent-Unit(GRU) that has convolutional structures to deal with spatiotemporal features and build an end-to-end model to solve this forecast problem. In this model, both the input and output are spatiotemporal sequences. Compared to Convolutional LSTM(ConvLSTM) model, this model has lower amount of parameters. We imply this model on GOES satellite data and the model perform well.

A hybrid genetic-simulated annealing algorithm for the location-inventory-routing problem considering returns under e-supply chain environment.

PubMed

Li, Yanhui; Guo, Hao; Wang, Lin; Fu, Jing

2013-01-01

Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focusing on the existing problem in e-commerce logistics system, we formulate a location-inventory-routing problem model with no quality defects returns. To solve this NP-hard problem, an effective hybrid genetic simulated annealing algorithm (HGSAA) is proposed. Results of numerical examples show that HGSAA outperforms GA on computing time, optimal solution, and computing stability. The proposed model is very useful to help managers make the right decisions under e-supply chain environment.

Helmholtz and parabolic equation solutions to a benchmark problem in ocean acoustics.

PubMed

Larsson, Elisabeth; Abrahamsson, Leif

2003-05-01

The Helmholtz equation (HE) describes wave propagation in applications such as acoustics and electromagnetics. For realistic problems, solving the HE is often too expensive. Instead, approximations like the parabolic wave equation (PE) are used. For low-frequency shallow-water environments, one persistent problem is to assess the accuracy of the PE model. In this work, a recently developed HE solver that can handle a smoothly varying bathymetry, variable material properties, and layered materials, is used for an investigation of the errors in PE solutions. In the HE solver, a preconditioned Krylov subspace method is applied to the discretized equations. The preconditioner combines domain decomposition and fast transform techniques. A benchmark problem with upslope-downslope propagation over a penetrable lossy seamount is solved. The numerical experiments show that, for the same bathymetry, a soft and slow bottom gives very similar HE and PE solutions, whereas the PE model is far from accurate for a hard and fast bottom. A first attempt to estimate the error is made by computing the relative deviation from the energy balance for the PE solution. This measure gives an indication of the magnitude of the error, but cannot be used as a strict error bound.

[For the betterment of home palliative care].

PubMed

Midorikawa, Yasuhiko; Iiduka, Masashi

2010-12-01

The problems we have identified to overcome for a betterment of home palliative care were as follows:(1) Staffs' low level of knowledge and a lack of interest in home care, (2) Lack of cooperation between hospital and clinic, (3) Hard to keep the medical and caregiver staffs employed in the home care settings and a technical training is behind, (4) Insufficient cooperative networks for elderly care and welfare in the region, and (5) Misunderstanding of home palliative care by patient, family and people in the region. It is important to solve these problems one by one for a betterment of home palliative care. In this paper, we reported these problems through actual activities of our hospital and Iwaki city, and we propose to deal with them.

NMESys: An expert system for network fault detection

NASA Technical Reports Server (NTRS)

Nelson, Peter C.; Warpinski, Janet

1991-01-01

The problem of network management is becoming an increasingly difficult and challenging task. It is very common today to find heterogeneous networks consisting of many different types of computers, operating systems, and protocols. The complexity of implementing a network with this many components is difficult enough, while the maintenance of such a network is an even larger problem. A prototype network management expert system, NMESys, implemented in the C Language Integrated Production System (CLIPS). NMESys concentrates on solving some of the critical problems encountered in managing a large network. The major goal of NMESys is to provide a network operator with an expert system tool to quickly and accurately detect hard failures, potential failures, and to minimize or eliminate user down time in a large network.

Formation of high heat resistant coatings by using gas tunnel type plasma spraying.

PubMed

Kobayashi, A; Ando, Y; Kurokawa, K

2012-06-01

Zirconia sprayed coatings are widely used as thermal barrier coatings (TBC) for high temperature protection of metallic structures. However, their use in diesel engine combustion chamber components has the long run durability problems, such as the spallation at the interface between the coating and substrate due to the interface oxidation. Although zirconia coatings have been used in many applications, the interface spallation problem is still waiting to be solved under the critical conditions such as high temperature and high corrosion environment. The gas tunnel type plasma spraying developed by the author can make high quality ceramic coatings such as Al2O3 and ZrO2 coating compared to other plasma spraying method. A high hardness ceramic coating such as Al2O3 coating by the gas tunnel type plasma spraying, were investigated in the previous study. The Vickers hardness of the zirconia (ZrO2) coating increased with decreasing spraying distance, and a higher Vickers hardness of about Hv = 1200 could be obtained at a shorter spraying distance of L = 30 mm. ZrO2 coating formed has a high hardness layer at the surface side, which shows the graded functionality of hardness. In this study, ZrO2 composite coatings (TBCs) with Al2O3 were deposited on SS304 substrates by gas tunnel type plasma spraying. The performance such as the mechanical properties, thermal behavior and high temperature oxidation resistance of the functionally graded TBCs was investigated and discussed. The resultant coating samples with different spraying powders and thickness are compared in their corrosion resistance with coating thickness as variables. Corrosion potential was measured and analyzed corresponding to the microstructure of the coatings. High Heat Resistant Coatings, Gas Tunnel Type Plasma Spraying, Hardness,

The School of Hard Knocks: The Development of Close Air Support in Burma during the Second World War

DTIC Science & Technology

2015-05-23

Group CAOC Combined Air Operations Center CAS Close Air Support CBI China-Burma-India EAC Eastern Air Command FM Field Manual JP Joint...Command ( EAC ) solved problems identified by the American Volunteer Group (AVG) in 1942. EAC’s doctrine, procedures, and techniques laid the foundation for...named the Eastern Air Command ( EAC ), and oversaw the air-land cooperation during the Allied counter-offensive into Burma throughout 1943 and 1944.8 The

Steps to strengthen ethics in organizations: research findings, ethics placebos, and what works.

PubMed

Pope, Kenneth S

2015-01-01

Research shows that many organizations overlook needs and opportunities to strengthen ethics. Barriers can make it hard to see the need for stronger ethics and even harder to take effective action. These barriers include the organization's misleading use of language, misuse of an ethics code, culture of silence, strategies of justification, institutional betrayal, and ethical fallacies. Ethics placebos tend to take the place of steps to see, solve, and prevent problems. This article reviews relevant research and specific steps that create change.

Scheduling with non-decreasing deterioration jobs and variable maintenance activities on a single machine

NASA Astrophysics Data System (ADS)

Zhang, Xingong; Yin, Yunqiang; Wu, Chin-Chia

2017-01-01

There is a situation found in many manufacturing systems, such as steel rolling mills, fire fighting or single-server cycle-queues, where a job that is processed later consumes more time than that same job when processed earlier. The research finds that machine maintenance can improve the worsening of processing conditions. After maintenance activity, the machine will be restored. The maintenance duration is a positive and non-decreasing differentiable convex function of the total processing times of the jobs between maintenance activities. Motivated by this observation, the makespan and the total completion time minimization problems in the scheduling of jobs with non-decreasing rates of job processing time on a single machine are considered in this article. It is shown that both the makespan and the total completion time minimization problems are NP-hard in the strong sense when the number of maintenance activities is arbitrary, while the makespan minimization problem is NP-hard in the ordinary sense when the number of maintenance activities is fixed. If the deterioration rates of the jobs are identical and the maintenance duration is a linear function of the total processing times of the jobs between maintenance activities, then this article shows that the group balance principle is satisfied for the makespan minimization problem. Furthermore, two polynomial-time algorithms are presented for solving the makespan problem and the total completion time problem under identical deterioration rates, respectively.

Development a heuristic method to locate and allocate the medical centers to minimize the earthquake relief operation time.

PubMed

Aghamohammadi, Hossein; Saadi Mesgari, Mohammad; Molaei, Damoon; Aghamohammadi, Hasan

2013-01-01

Location-allocation is a combinatorial optimization problem, and is defined as Non deterministic Polynomial Hard (NP) hard optimization. Therefore, solution of such a problem should be shifted from exact to heuristic or Meta heuristic due to the complexity of the problem. Locating medical centers and allocating injuries of an earthquake to them has high importance in earthquake disaster management so that developing a proper method will reduce the time of relief operation and will consequently decrease the number of fatalities. This paper presents the development of a heuristic method based on two nested genetic algorithms to optimize this location allocation problem by using the abilities of Geographic Information System (GIS). In the proposed method, outer genetic algorithm is applied to the location part of the problem and inner genetic algorithm is used to optimize the resource allocation. The final outcome of implemented method includes the spatial location of new required medical centers. The method also calculates that how many of the injuries at each demanding point should be taken to any of the existing and new medical centers as well. The results of proposed method showed high performance of designed structure to solve a capacitated location-allocation problem that may arise in a disaster situation when injured people has to be taken to medical centers in a reasonable time.

Phylo: A Citizen Science Approach for Improving Multiple Sequence Alignment

PubMed Central

Kam, Alfred; Kwak, Daniel; Leung, Clarence; Wu, Chu; Zarour, Eleyine; Sarmenta, Luis; Blanchette, Mathieu; Waldispühl, Jérôme

2012-01-01

Background Comparative genomics, or the study of the relationships of genome structure and function across different species, offers a powerful tool for studying evolution, annotating genomes, and understanding the causes of various genetic disorders. However, aligning multiple sequences of DNA, an essential intermediate step for most types of analyses, is a difficult computational task. In parallel, citizen science, an approach that takes advantage of the fact that the human brain is exquisitely tuned to solving specific types of problems, is becoming increasingly popular. There, instances of hard computational problems are dispatched to a crowd of non-expert human game players and solutions are sent back to a central server. Methodology/Principal Findings We introduce Phylo, a human-based computing framework applying “crowd sourcing” techniques to solve the Multiple Sequence Alignment (MSA) problem. The key idea of Phylo is to convert the MSA problem into a casual game that can be played by ordinary web users with a minimal prior knowledge of the biological context. We applied this strategy to improve the alignment of the promoters of disease-related genes from up to 44 vertebrate species. Since the launch in November 2010, we received more than 350,000 solutions submitted from more than 12,000 registered users. Our results show that solutions submitted contributed to improving the accuracy of up to 70% of the alignment blocks considered. Conclusions/Significance We demonstrate that, combined with classical algorithms, crowd computing techniques can be successfully used to help improving the accuracy of MSA. More importantly, we show that an NP-hard computational problem can be embedded in casual game that can be easily played by people without significant scientific training. This suggests that citizen science approaches can be used to exploit the billions of “human-brain peta-flops” of computation that are spent every day playing games. Phylo is available at: http://phylo.cs.mcgill.ca. PMID:22412834

Molecular dynamics simulation of a needle-sphere binary mixture

NASA Astrophysics Data System (ADS)

Raghavan, Karthik

This paper investigates the dynamic behaviour of a hard needle-sphere binary system using a novel numerical technique called the Newton homotopy continuation (NHC) method. This mixture is representative of a polymer melt where both long chain molecules and monomers coexist. Since the intermolecular forces are generated from hard body interactions, the consequence of missed collisions or incorrect collision sequences have a significant bearing on the dynamic properties of the fluid. To overcome this problem, in earlier work NHC was chosen over traditional Newton-Raphson methods to solve the hard body dynamics of a needle fluid in random media composed of overlapping spheres. Furthermore, the simplicity of interactions and dynamics allows us to focus our research directly on the effects of particle shape and density on the transport behaviour of the mixture. These studies are also compared with earlier works that examined molecular chains in porous media primarily to understand the differences in molecular transport in the bulk versus porous systems.

Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions.

PubMed

Wijesinghe, Parami; Liyanagedera, Chamika; Roy, Kaushik

2018-05-02

Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic Tunnel Junctions (MTJs). The inherent physics of MTJs, enhanced by device level modifications, is harnessed here to emulate the intricate dynamics of an analog satisfiability (SAT) solver. In the presence of thermal noise, the MTJ based system can successfully solve Boolean satisfiability problems. Most importantly, our results exhibit that, the proposed MTJ based hardware SAT solver is capable of finding a solution to a significant fraction (at least 85%) of hard 3-SAT problems, within a time that has a polynomial relationship with the number of variables(<50).

Weighted LCS

NASA Astrophysics Data System (ADS)

Amir, Amihood; Gotthilf, Zvi; Shalom, B. Riva

The Longest Common Subsequence (LCS) of two strings A and B is a well studied problem having a wide range of applications. When each symbol of the input strings is assigned a positive weight the problem becomes the Heaviest Common Subsequence (HCS) problem. In this paper we consider a different version of weighted LCS on Position Weight Matrices (PWM). The Position Weight Matrix was introduced as a tool to handle a set of sequences that are not identical, yet, have many local similarities. Such a weighted sequence is a 'statistical image' of this set where we are given the probability of every symbol's occurrence at every text location. We consider two possible definitions of LCS on PWM. For the first, we solve the weighted LCS problem of z sequences in time O(zn z + 1). For the second, we prove \\cal{NP}-hardness and provide an approximation algorithm.

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

NASA Astrophysics Data System (ADS)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

An Integrated Method Based on PSO and EDA for the Max-Cut Problem.

PubMed

Lin, Geng; Guan, Jian

2016-01-01

The max-cut problem is NP-hard combinatorial optimization problem with many real world applications. In this paper, we propose an integrated method based on particle swarm optimization and estimation of distribution algorithm (PSO-EDA) for solving the max-cut problem. The integrated algorithm overcomes the shortcomings of particle swarm optimization and estimation of distribution algorithm. To enhance the performance of the PSO-EDA, a fast local search procedure is applied. In addition, a path relinking procedure is developed to intensify the search. To evaluate the performance of PSO-EDA, extensive experiments were carried out on two sets of benchmark instances with 800 to 20,000 vertices from the literature. Computational results and comparisons show that PSO-EDA significantly outperforms the existing PSO-based and EDA-based algorithms for the max-cut problem. Compared with other best performing algorithms, PSO-EDA is able to find very competitive results in terms of solution quality.

A Hybrid Genetic-Simulated Annealing Algorithm for the Location-Inventory-Routing Problem Considering Returns under E-Supply Chain Environment

PubMed Central

Guo, Hao; Fu, Jing

2013-01-01

Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focusing on the existing problem in e-commerce logistics system, we formulate a location-inventory-routing problem model with no quality defects returns. To solve this NP-hard problem, an effective hybrid genetic simulated annealing algorithm (HGSAA) is proposed. Results of numerical examples show that HGSAA outperforms GA on computing time, optimal solution, and computing stability. The proposed model is very useful to help managers make the right decisions under e-supply chain environment. PMID:24489489

Bin packing problem solution through a deterministic weighted finite automaton

NASA Astrophysics Data System (ADS)

Zavala-Díaz, J. C.; Pérez-Ortega, J.; Martínez-Rebollar, A.; Almanza-Ortega, N. N.; Hidalgo-Reyes, M.

2016-06-01

In this article the solution of Bin Packing problem of one dimension through a weighted finite automaton is presented. Construction of the automaton and its application to solve three different instances, one synthetic data and two benchmarks are presented: N1C1W1_A.BPP belonging to data set Set_1; and BPP13.BPP belonging to hard28. The optimal solution of synthetic data is obtained. In the first benchmark the solution obtained is one more container than the ideal number of containers and in the second benchmark the solution is two more containers than the ideal solution (approximately 2.5%). The runtime in all three cases was less than one second.

Optimal dynamic voltage scaling for wireless sensor nodes with real-time constraints

NASA Astrophysics Data System (ADS)

Cassandras, Christos G.; Zhuang, Shixin

2005-11-01

Sensors are increasingly embedded in manufacturing systems and wirelessly networked to monitor and manage operations ranging from process and inventory control to tracking equipment and even post-manufacturing product monitoring. In building such sensor networks, a critical issue is the limited and hard to replenish energy in the devices involved. Dynamic voltage scaling is a technique that controls the operating voltage of a processor to provide desired performance while conserving energy and prolonging the overall network's lifetime. We consider such power-limited devices processing time-critical tasks which are non-preemptive, aperiodic and have uncertain arrival times. We treat voltage scaling as a dynamic optimization problem whose objective is to minimize energy consumption subject to hard or soft real-time execution constraints. In the case of hard constraints, we build on prior work (which engages a voltage scaling controller at task completion times) by developing an intra-task controller that acts at all arrival times of incoming tasks. We show that this optimization problem can be decomposed into two simpler ones whose solution leads to an algorithm that does not actually require solving any nonlinear programming problems. In the case of soft constraints, this decomposition must be partly relaxed, but it still leads to a scalable (linear in the number of tasks) algorithm. Simulation results are provided to illustrate performance improvements in systems with intra-task controllers compared to uncontrolled systems or those using inter-task control.

Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.

PubMed

Coelho, V N; Coelho, I M; Souza, M J F; Oliveira, T A; Cota, L P; Haddad, M N; Mladenovic, N; Silva, R C P; Guimarães, F G

2016-01-01

This article presents an Evolution Strategy (ES)--based algorithm, designed to self-adapt its mutation operators, guiding the search into the solution space using a Self-Adaptive Reduced Variable Neighborhood Search procedure. In view of the specific local search operators for each individual, the proposed population-based approach also fits into the context of the Memetic Algorithms. The proposed variant uses the Greedy Randomized Adaptive Search Procedure with different greedy parameters for generating its initial population, providing an interesting exploration-exploitation balance. To validate the proposal, this framework is applied to solve three different [Formula: see text]-Hard combinatorial optimization problems: an Open-Pit-Mining Operational Planning Problem with dynamic allocation of trucks, an Unrelated Parallel Machine Scheduling Problem with Setup Times, and the calibration of a hybrid fuzzy model for Short-Term Load Forecasting. Computational results point out the convergence of the proposed model and highlight its ability in combining the application of move operations from distinct neighborhood structures along the optimization. The results gathered and reported in this article represent a collective evidence of the performance of the method in challenging combinatorial optimization problems from different application domains. The proposed evolution strategy demonstrates an ability of adapting the strength of the mutation disturbance during the generations of its evolution process. The effectiveness of the proposal motivates the application of this novel evolutionary framework for solving other combinatorial optimization problems.

Reverse engineering and identification in systems biology: strategies, perspectives and challenges.

PubMed

Villaverde, Alejandro F; Banga, Julio R

2014-02-06

The interplay of mathematical modelling with experiments is one of the central elements in systems biology. The aim of reverse engineering is to infer, analyse and understand, through this interplay, the functional and regulatory mechanisms of biological systems. Reverse engineering is not exclusive of systems biology and has been studied in different areas, such as inverse problem theory, machine learning, nonlinear physics, (bio)chemical kinetics, control theory and optimization, among others. However, it seems that many of these areas have been relatively closed to outsiders. In this contribution, we aim to compare and highlight the different perspectives and contributions from these fields, with emphasis on two key questions: (i) why are reverse engineering problems so hard to solve, and (ii) what methods are available for the particular problems arising from systems biology?

The boundary element method applied to 3D magneto-electro-elastic dynamic problems

NASA Astrophysics Data System (ADS)

Igumnov, L. A.; Markov, I. P.; Kuznetsov, Iu A.

2017-11-01

Due to the coupling properties, the magneto-electro-elastic materials possess a wide number of applications. They exhibit general anisotropic behaviour. Three-dimensional transient analyses of magneto-electro-elastic solids can hardly be found in the literature. 3D direct boundary element formulation based on the weakly-singular boundary integral equations in Laplace domain is presented in this work for solving dynamic linear magneto-electro-elastic problems. Integral expressions of the three-dimensional fundamental solutions are employed. Spatial discretization is based on a collocation method with mixed boundary elements. Convolution quadrature method is used as a numerical inverse Laplace transform scheme to obtain time domain solutions. Numerical examples are provided to illustrate the capability of the proposed approach to treat highly dynamic problems.

Sudden emergence of q-regular subgraphs in random graphs

NASA Astrophysics Data System (ADS)

Pretti, M.; Weigt, M.

2006-07-01

We investigate the computationally hard problem whether a random graph of finite average vertex degree has an extensively large q-regular subgraph, i.e., a subgraph with all vertices having degree equal to q. We reformulate this problem as a constraint-satisfaction problem, and solve it using the cavity method of statistical physics at zero temperature. For q = 3, we find that the first large q-regular subgraphs appear discontinuously at an average vertex degree c3 - reg simeq 3.3546 and contain immediately about 24% of all vertices in the graph. This transition is extremely close to (but different from) the well-known 3-core percolation point c3 - core simeq 3.3509. For q > 3, the q-regular subgraph percolation threshold is found to coincide with that of the q-core.

Rapidly disintegrating vagina retentive cream suppositories of progesterone: development, patient satisfaction and in vitro/in vivo studies.

PubMed

Bendas, Ehab Rasmy; Basalious, Emad B

2016-01-01

Our objective was to develop novel vagina retentive cream suppositories (VRCS) of progesterone having rapid disintegration and good vaginal retention. VRCS of progesterone were prepared using oil in water (o/w) emulsion of mineral oil or theobroma oil in hard fat and compared with conventional vaginal suppositories (CVS) prepared by hard fat. VRCS formulations were tested for content uniformity, disintegration, melting range, in vitro release and stability studies. The most stable formulation (VRCS I) was subjected to scaling-up manufacturing and patients' satisfaction test. The rapid disintegration, good retentive properties are applicable through the inclusion of emulsified theobroma oil rather than hydrophilic surfactant into the hard fat bases. The release profile of progesterone from VRCS I showed a biphasic pattern due to the formation of progesterone reservoir in the emulsified theobroma oil. All volunteers involved in patients' satisfaction test showed high satisfactory response to the tested formulation (VRCS). The in vivo pharmacokinetic study suggests that VRCS of progesterone provided higher rate and extent of absorption compared to hard fat based suppositories. Our results proposed that emulsified theobroma oil could be promising to solve the problems of poor patients' satisfaction and variability of drug absorption associated with hard fat suppositories.

Network planning under uncertainties

NASA Astrophysics Data System (ADS)

Ho, Kwok Shing; Cheung, Kwok Wai

2008-11-01

One of the main focuses for network planning is on the optimization of network resources required to build a network under certain traffic demand projection. Traditionally, the inputs to this type of network planning problems are treated as deterministic. In reality, the varying traffic requirements and fluctuations in network resources can cause uncertainties in the decision models. The failure to include the uncertainties in the network design process can severely affect the feasibility and economics of the network. Therefore, it is essential to find a solution that can be insensitive to the uncertain conditions during the network planning process. As early as in the 1960's, a network planning problem with varying traffic requirements over time had been studied. Up to now, this kind of network planning problems is still being active researched, especially for the VPN network design. Another kind of network planning problems under uncertainties that has been studied actively in the past decade addresses the fluctuations in network resources. One such hotly pursued research topic is survivable network planning. It considers the design of a network under uncertainties brought by the fluctuations in topology to meet the requirement that the network remains intact up to a certain number of faults occurring anywhere in the network. Recently, the authors proposed a new planning methodology called Generalized Survivable Network that tackles the network design problem under both varying traffic requirements and fluctuations of topology. Although all the above network planning problems handle various kinds of uncertainties, it is hard to find a generic framework under more general uncertainty conditions that allows a more systematic way to solve the problems. With a unified framework, the seemingly diverse models and algorithms can be intimately related and possibly more insights and improvements can be brought out for solving the problem. This motivates us to seek a generic framework for solving the network planning problem under uncertainties. In addition to reviewing the various network planning problems involving uncertainties, we also propose that a unified framework based on robust optimization can be used to solve a rather large segment of network planning problem under uncertainties. Robust optimization is first introduced in the operations research literature and is a framework that incorporates information about the uncertainty sets for the parameters in the optimization model. Even though robust optimization is originated from tackling the uncertainty in the optimization process, it can serve as a comprehensive and suitable framework for tackling generic network planning problems under uncertainties. In this paper, we begin by explaining the main ideas behind the robust optimization approach. Then we demonstrate the capabilities of the proposed framework by giving out some examples of how the robust optimization framework can be applied to the current common network planning problems under uncertain environments. Next, we list some practical considerations for solving the network planning problem under uncertainties with the proposed framework. Finally, we conclude this article with some thoughts on the future directions for applying this framework to solve other network planning problems.

Multi-objective problem of the modified distributed parallel machine and assembly scheduling problem (MDPMASP) with eligibility constraints

NASA Astrophysics Data System (ADS)

Amallynda, I.; Santosa, B.

2017-11-01

This paper proposes a new generalization of the distributed parallel machine and assembly scheduling problem (DPMASP) with eligibility constraints referred to as the modified distributed parallel machine and assembly scheduling problem (MDPMASP) with eligibility constraints. Within this generalization, we assume that there are a set non-identical factories or production lines, each one with a set unrelated parallel machine with different speeds in processing them disposed to a single assembly machine in series. A set of different products that are manufactured through an assembly program of a set of components (jobs) according to the requested demand. Each product requires several kinds of jobs with different sizes. Beside that we also consider to the multi-objective problem (MOP) of minimizing mean flow time and the number of tardy products simultaneously. This is known to be NP-Hard problem, is important to practice, as the former criterions to reflect the customer's demand and manufacturer's perspective. This is a realistic and complex problem with wide range of possible solutions, we propose four simple heuristics and two metaheuristics to solve it. Various parameters of the proposed metaheuristic algorithms are discussed and calibrated by means of Taguchi technique. All proposed algorithms are tested by Matlab software. Our computational experiments indicate that the proposed problem and fourth proposed algorithms are able to be implemented and can be used to solve moderately-sized instances, and giving efficient solutions, which are close to optimum in most cases.

Associating optical measurements and estimating orbits of geocentric objects with a Genetic Algorithm: performance limitations.

NASA Astrophysics Data System (ADS)

Zittersteijn, Michiel; Schildknecht, Thomas; Vananti, Alessandro; Dolado Perez, Juan Carlos; Martinot, Vincent

2016-07-01

Currently several thousands of objects are being tracked in the MEO and GEO regions through optical means. With the advent of improved sensors and a heightened interest in the problem of space debris, it is expected that the number of tracked objects will grow by an order of magnitude in the near future. This research aims to provide a method that can treat the correlation and orbit determination problems simultaneously, and is able to efficiently process large data sets with minimal manual intervention. This problem is also known as the Multiple Target Tracking (MTT) problem. The complexity of the MTT problem is defined by its dimension S. Current research tends to focus on the S = 2 MTT problem. The reason for this is that for S = 2 the problem has a P-complexity. However, with S = 2 the decision to associate a set of observations is based on the minimum amount of information, in ambiguous situations (e.g. satellite clusters) this will lead to incorrect associations. The S > 2 MTT problem is an NP-hard combinatorial optimization problem. In previous work an Elitist Genetic Algorithm (EGA) was proposed as a method to approximately solve this problem. It was shown that the EGA is able to find a good approximate solution with a polynomial time complexity. The EGA relies on solving the Lambert problem in order to perform the necessary orbit determinations. This means that the algorithm is restricted to orbits that are described by Keplerian motion. The work presented in this paper focuses on the impact that this restriction has on the algorithm performance.

Solving the Secondary Structure Matching Problem in Cryo-EM De Novo Modeling Using a Constrained K-Shortest Path Graph Algorithm.

PubMed

Al Nasr, Kamal; Ranjan, Desh; Zubair, Mohammad; Chen, Lin; He, Jing

2014-01-01

Electron cryomicroscopy is becoming a major experimental technique in solving the structures of large molecular assemblies. More and more three-dimensional images have been obtained at the medium resolutions between 5 and 10 Å. At this resolution range, major α-helices can be detected as cylindrical sticks and β-sheets can be detected as plain-like regions. A critical question in de novo modeling from cryo-EM images is to determine the match between the detected secondary structures from the image and those on the protein sequence. We formulate this matching problem into a constrained graph problem and present an O(Δ(2)N(2)2(N)) algorithm to this NP-Hard problem. The algorithm incorporates the dynamic programming approach into a constrained K-shortest path algorithm. Our method, DP-TOSS, has been tested using α-proteins with maximum 33 helices and α-β proteins up to five helices and 12 β-strands. The correct match was ranked within the top 35 for 19 of the 20 α-proteins and all nine α-β proteins tested. The results demonstrate that DP-TOSS improves accuracy, time and memory space in deriving the topologies of the secondary structure elements for proteins with a large number of secondary structures and a complex skeleton.

Solving Constraint Satisfaction Problems with Networks of Spiking Neurons

PubMed Central

Jonke, Zeno; Habenschuss, Stefan; Maass, Wolfgang

2016-01-01

Network of neurons in the brain apply—unlike processors in our current generation of computer hardware—an event-based processing strategy, where short pulses (spikes) are emitted sparsely by neurons to signal the occurrence of an event at a particular point in time. Such spike-based computations promise to be substantially more power-efficient than traditional clocked processing schemes. However, it turns out to be surprisingly difficult to design networks of spiking neurons that can solve difficult computational problems on the level of single spikes, rather than rates of spikes. We present here a new method for designing networks of spiking neurons via an energy function. Furthermore, we show how the energy function of a network of stochastically firing neurons can be shaped in a transparent manner by composing the networks of simple stereotypical network motifs. We show that this design approach enables networks of spiking neurons to produce approximate solutions to difficult (NP-hard) constraint satisfaction problems from the domains of planning/optimization and verification/logical inference. The resulting networks employ noise as a computational resource. Nevertheless, the timing of spikes plays an essential role in their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines) and Gibbs sampling. PMID:27065785

An application of traveling salesman problem using the improved genetic algorithm on android google maps

NASA Astrophysics Data System (ADS)

Narwadi, Teguh; Subiyanto

2017-03-01

The Travelling Salesman Problem (TSP) is one of the best known NP-hard problems, which means that no exact algorithm to solve it in polynomial time. This paper present a new variant application genetic algorithm approach with a local search technique has been developed to solve the TSP. For the local search technique, an iterative hill climbing method has been used. The system is implemented on the Android OS because android is now widely used around the world and it is mobile system. It is also integrated with Google API that can to get the geographical location and the distance of the cities, and displays the route. Therefore, we do some experimentation to test the behavior of the application. To test the effectiveness of the application of hybrid genetic algorithm (HGA) is compare with the application of simple GA in 5 sample from the cities in Central Java, Indonesia with different numbers of cities. According to the experiment results obtained that in the average solution HGA shows in 5 tests out of 5 (100%) is better than simple GA. The results have shown that the hybrid genetic algorithm outperforms the genetic algorithm especially in the case with the problem higher complexity.

Adaptive nearly optimal control for a class of continuous-time nonaffine nonlinear systems with inequality constraints.

PubMed

Fan, Quan-Yong; Yang, Guang-Hong

2017-01-01

The state inequality constraints have been hardly considered in the literature on solving the nonlinear optimal control problem based the adaptive dynamic programming (ADP) method. In this paper, an actor-critic (AC) algorithm is developed to solve the optimal control problem with a discounted cost function for a class of state-constrained nonaffine nonlinear systems. To overcome the difficulties resulting from the inequality constraints and the nonaffine nonlinearities of the controlled systems, a novel transformation technique with redesigned slack functions and a pre-compensator method are introduced to convert the constrained optimal control problem into an unconstrained one for affine nonlinear systems. Then, based on the policy iteration (PI) algorithm, an online AC scheme is proposed to learn the nearly optimal control policy for the obtained affine nonlinear dynamics. Using the information of the nonlinear model, novel adaptive update laws are designed to guarantee the convergence of the neural network (NN) weights and the stability of the affine nonlinear dynamics without the requirement for the probing signal. Finally, the effectiveness of the proposed method is validated by simulation studies. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Evaluation of the Dornier Gmbh interactive grid generation system

NASA Technical Reports Server (NTRS)

Brown, Robert L.

1989-01-01

An interactive grid generation program, INGRID, is investigated and evaluated. A description of the task and work performed, a description and evaluation of INGRID, and a discussion of the possibilities for bringing INGRID into the NASA and Numerical Aerodynamic Simulator (NAS) computing environments is included. The interactive grid generation program was found to be a viable approach for grid generation and determined that it could be converted to work in the NAS environment but that INGRID does not solve the fundamentally hard problems associated with grid generation, specifically, domain decomposition.

Steps to Strengthen Ethics in Organizations: Research Findings, Ethics Placebos, and What Works

PubMed Central

Pope, Kenneth S.

2015-01-01

Research shows that many organizations overlook needs and opportunities to strengthen ethics. Barriers can make it hard to see the need for stronger ethics and even harder to take effective action. These barriers include the organization’s misleading use of language, misuse of an ethics code, culture of silence, strategies of justification, institutional betrayal, and ethical fallacies. Ethics placebos tend to take the place of steps to see, solve, and prevent problems. This article reviews relevant research and specific steps that create change. PMID:25602131

Verifiable fault tolerance in measurement-based quantum computation

NASA Astrophysics Data System (ADS)

Fujii, Keisuke; Hayashi, Masahito

2017-09-01

Quantum systems, in general, cannot be simulated efficiently by a classical computer, and hence are useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately, that verification of the output of the quantum systems is not so trivial, since predicting the output is exponentially hard. As another problem, the quantum system is very delicate for noise and thus needs an error correction. Here, we propose a framework for verification of the output of fault-tolerant quantum computation in a measurement-based model. In contrast to existing analyses on fault tolerance, we do not assume any noise model on the resource state, but an arbitrary resource state is tested by using only single-qubit measurements to verify whether or not the output of measurement-based quantum computation on it is correct. Verifiability is equipped by a constant time repetition of the original measurement-based quantum computation in appropriate measurement bases. Since full characterization of quantum noise is exponentially hard for large-scale quantum computing systems, our framework provides an efficient way to practically verify the experimental quantum error correction.

Enhancing quantum annealing performance for the molecular similarity problem

NASA Astrophysics Data System (ADS)

Hernandez, Maritza; Aramon, Maliheh

2017-05-01

Quantum annealing is a promising technique which leverages quantum mechanics to solve hard optimization problems. Considerable progress has been made in the development of a physical quantum annealer, motivating the study of methods to enhance the efficiency of such a solver. In this work, we present a quantum annealing approach to measure similarity among molecular structures. Implementing real-world problems on a quantum annealer is challenging due to hardware limitations such as sparse connectivity, intrinsic control error, and limited precision. In order to overcome the limited connectivity, a problem must be reformulated using minor-embedding techniques. Using a real data set, we investigate the performance of a quantum annealer in solving the molecular similarity problem. We provide experimental evidence that common practices for embedding can be replaced by new alternatives which mitigate some of the hardware limitations and enhance its performance. Common practices for embedding include minimizing either the number of qubits or the chain length and determining the strength of ferromagnetic couplers empirically. We show that current criteria for selecting an embedding do not improve the hardware's performance for the molecular similarity problem. Furthermore, we use a theoretical approach to determine the strength of ferromagnetic couplers. Such an approach removes the computational burden of the current empirical approaches and also results in hardware solutions that can benefit from simple local classical improvement. Although our results are limited to the problems considered here, they can be generalized to guide future benchmarking studies.

Using Volunteer Computing to Study Some Features of Diagonal Latin Squares

NASA Astrophysics Data System (ADS)

Vatutin, Eduard; Zaikin, Oleg; Kochemazov, Stepan; Valyaev, Sergey

2017-12-01

In this research, the study concerns around several features of diagonal Latin squares (DLSs) of small order. Authors of the study suggest an algorithm for computing minimal and maximal numbers of transversals of DLSs. According to this algorithm, all DLSs of a particular order are generated, and for each square all its transversals and diagonal transversals are constructed. The algorithm was implemented and applied to DLSs of order at most 7 on a personal computer. The experiment for order 8 was performed in the volunteer computing project Gerasim@home. In addition, the problem of finding pairs of orthogonal DLSs of order 10 was considered and reduced to Boolean satisfiability problem. The obtained problem turned out to be very hard, therefore it was decomposed into a family of subproblems. In order to solve the problem, the volunteer computing project SAT@home was used. As a result, several dozen pairs of described kind were found.

An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation.

PubMed

Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri

2016-01-01

This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality.

An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation

PubMed Central

Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri

2016-01-01

This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality. PMID:26954783

A set partitioning reformulation for the multiple-choice multidimensional knapsack problem

NASA Astrophysics Data System (ADS)

Voß, Stefan; Lalla-Ruiz, Eduardo

2016-05-01

The Multiple-choice Multidimensional Knapsack Problem (MMKP) is a well-known ?-hard combinatorial optimization problem that has received a lot of attention from the research community as it can be easily translated to several real-world problems arising in areas such as allocating resources, reliability engineering, cognitive radio networks, cloud computing, etc. In this regard, an exact model that is able to provide high-quality feasible solutions for solving it or being partially included in algorithmic schemes is desirable. The MMKP basically consists of finding a subset of objects that maximizes the total profit while observing some capacity restrictions. In this article a reformulation of the MMKP as a set partitioning problem is proposed to allow for new insights into modelling the MMKP. The computational experimentation provides new insights into the problem itself and shows that the new model is able to improve on the best of the known results for some of the most common benchmark instances.

Extremal Optimization for Quadratic Unconstrained Binary Problems

NASA Astrophysics Data System (ADS)

Boettcher, S.

We present an implementation of τ-EO for quadratic unconstrained binary optimization (QUBO) problems. To this end, we transform modify QUBO from its conventional Boolean presentation into a spin glass with a random external field on each site. These fields tend to be rather large compared to the typical coupling, presenting EO with a challenging two-scale problem, exploring smaller differences in couplings effectively while sufficiently aligning with those strong external fields. However, we also find a simple solution to that problem that indicates that those external fields apparently tilt the energy landscape to a such a degree such that global minima become more easy to find than those of spin glasses without (or very small) fields. We explore the impact of the weight distribution of the QUBO formulation in the operations research literature and analyze their meaning in a spin-glass language. This is significant because QUBO problems are considered among the main contenders for NP-hard problems that could be solved efficiently on a quantum computer such as D-Wave.

Analysis of junior high school students' attempt to solve a linear inequality problem

NASA Astrophysics Data System (ADS)

Taqiyuddin, Muhammad; Sumiaty, Encum; Jupri, Al

2017-08-01

Linear inequality is one of fundamental subjects within junior high school mathematics curricula. Several studies have been conducted to asses students' perform on linear inequality. However, it can hardly be found that linear inequality problems are in the form of "ax + b < dx + e" with "a, d ≠ 0", and "a ≠ d" as it can be seen on the textbook used by Indonesian students and several studies. This condition leads to the research questions concerning students' attempt on solving a simple linear inequality problem in this form. In order to do so, the written test was administered to 58 students from two schools in Bandung followed by interviews. The other sources of the data are from teachers' interview and mathematics books used by students. After that, the constant comparative method was used to analyse the data. The result shows that the majority approached the question by doing algebraic operations. Interestingly, most of them did it incorrectly. In contrast, algebraic operations were correctly used by some of them. Moreover, the others performed expected-numbers solution, rewriting the question, translating the inequality into words, and blank answer. Furthermore, we found that there is no one who was conscious of the existence of all-numbers solution. It was found that this condition is reasonably due to how little the learning components concern about why a procedure of solving a linear inequality works and possibilities of linear inequality solution.

Multiagent optimization system for solving the traveling salesman problem (TSP).

PubMed

Xie, Xiao-Feng; Liu, Jiming

2009-04-01

The multiagent optimization system (MAOS) is a nature-inspired method, which supports cooperative search by the self-organization of a group of compact agents situated in an environment with certain sharing public knowledge. Moreover, each agent in MAOS is an autonomous entity with personal declarative memory and behavioral components. In this paper, MAOS is refined for solving the traveling salesman problem (TSP), which is a classic hard computational problem. Based on a simplified MAOS version, in which each agent manipulates on extremely limited declarative knowledge, some simple and efficient components for solving TSP, including two improving heuristics based on a generalized edge assembly recombination, are implemented. Compared with metaheuristics in adaptive memory programming, MAOS is particularly suitable for supporting cooperative search. The experimental results on two TSP benchmark data sets show that MAOS is competitive as compared with some state-of-the-art algorithms, including the Lin-Kernighan-Helsgaun, IBGLK, PHGA, etc., although MAOS does not use any explicit local search during the runtime. The contributions of MAOS components are investigated. It indicates that certain clues can be positive for making suitable selections before time-consuming computation. More importantly, it shows that the cooperative search of agents can achieve an overall good performance with a macro rule in the switch mode, which deploys certain alternate search rules with the offline performance in negative correlations. Using simple alternate rules may prevent the high difficulty of seeking an omnipotent rule that is efficient for a large data set.

Reverse engineering and identification in systems biology: strategies, perspectives and challenges

PubMed Central

Villaverde, Alejandro F.; Banga, Julio R.

2014-01-01

The interplay of mathematical modelling with experiments is one of the central elements in systems biology. The aim of reverse engineering is to infer, analyse and understand, through this interplay, the functional and regulatory mechanisms of biological systems. Reverse engineering is not exclusive of systems biology and has been studied in different areas, such as inverse problem theory, machine learning, nonlinear physics, (bio)chemical kinetics, control theory and optimization, among others. However, it seems that many of these areas have been relatively closed to outsiders. In this contribution, we aim to compare and highlight the different perspectives and contributions from these fields, with emphasis on two key questions: (i) why are reverse engineering problems so hard to solve, and (ii) what methods are available for the particular problems arising from systems biology? PMID:24307566

Remembering Larkin

NASA Astrophysics Data System (ADS)

Varlamov, Andrei

2013-06-01

Knowing Anatoly Ivanovich - Tolya for his friends and colleagues - for years I can't recall him ever writing mathematical expressions on a sheet of paper as he was usually solving problems in his head. Tolya was Homo Sapiens in its true, literal sense of this word. A side observer would hardly notice his mastery and deep understanding of modern methods of theoretical physics and mathematics as there were no piles of paper speckled with math symbols on his desk. But there was a blackboard in his office, all covered with fragments of problems he was discussing with various coauthors. He was famous among his students and coauthors for "falling asleep" in the chair in his office and then writing the solution on the board immediately after awakening...

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees.

PubMed

van Iersel, Leo; Kelk, Steven; Lekić, Nela; Scornavacca, Celine

2014-05-05

Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain discordance between two phylogenetic trees is a hard computational problem. Even for binary trees, exact solvers struggle to solve instances with reticulation number larger than 40-50. Here we present CycleKiller and NonbinaryCycleKiller, the first methods to produce solutions verifiably close to optimality for instances with hundreds or even thousands of reticulations. Using simulations, we demonstrate that these algorithms run quickly for large and difficult instances, producing solutions that are very close to optimality. As a spin-off from our simulations we also present TerminusEst, which is the fastest exact method currently available that can handle nonbinary trees: this is used to measure the accuracy of the NonbinaryCycleKiller algorithm. All three methods are based on extensions of previous theoretical work (SIDMA 26(4):1635-1656, TCBB 10(1):18-25, SIDMA 28(1):49-66) and are publicly available. We also apply our methods to real data.

The modeler's influence on calculated solubilities for performance assessments at the Aspo Hard-rock Laboratory

USGS Publications Warehouse

Ernren, A.T.; Arthur, R.; Glynn, P.D.; McMurry, J.

1999-01-01

Four researchers were asked to provide independent modeled estimates of the solubility of a radionuclide solid phase, specifically Pu(OH)4, under five specified sets of conditions. The objectives of the study were to assess the variability in the results obtained and to determine the primary causes for this variability.In the exercise, modelers were supplied with the composition, pH and redox properties of the water and with a description of the mineralogy of the surrounding fracture system A standard thermodynamic data base was provided to all modelers. Each modeler was encouraged to use other data bases in addition to the standard data base and to try different approaches to solving the problem.In all, about fifty approaches were used, some of which included a large number of solubility calculations. For each of the five test cases, the calculated solubilities from different approaches covered several orders of magnitude. The variability resulting from the use of different thermodynamic data bases was in most cases, far smaller than that resulting from the use of different approaches to solving the problem.

Dealing with extreme environmental degradation: stress and marginalization of Sahel dwellers.

PubMed

Van Haaften, E H; Van de Vijver, F J

1999-07-01

Psychological aspects of environmental degradation are hardly investigated. In the present study these aspects were examined among Sahel dwellers, who live in environments with different states of degradation. The degradation was assessed in terms of vegetation cover, erosion, and loss of organic matter. Subjects came from three cultural groups: Dogon (agriculturalists, n = 225), Mossi (agriculturalists, n = 914), and Fulani (pastoralists, n = 844). Questionnaires addressing marginalization, locus of control, and coping were administered. Environmental degradation was associated with higher levels of stress, marginalization, passive coping (avoidance), a more external locus of control, and lower levels of active coping (problem solving and support seeking). Compared to agriculturalists, pastoralists showed a stronger variation in all psychological variables across all regions, from the least to the most environmentally degraded. Women showed higher scores of stress, (external) locus of control, problem solving, and support seeking than men. The interaction of gender and region was significant for several variables. It was concluded that environmental degradation has various psychological correlates: people are likely to display an active approach to environmental degradation as long as the level of degradation is not beyond their control.

Influence of Sintering Temperature on Hardness and Wear Properties of TiN Nano Reinforced SAF 2205

NASA Astrophysics Data System (ADS)

Oke, S. R.; Ige, O. O.; E Falodun, O.; Obadele, B. A.; Mphalele, M. R.; Olubambi, P. A.

2017-12-01

Conventional duplex stainless steel degrade in wear and mechanical properties at high temperature. Attempts have been made by researchers to solve this problems leading to the dispersion of second phase particles into duplex matrix. Powder metallurgy methods have been used to fabricate dispersion strengthened steels with a challenge of obtaining fully dense composite and grain growth. This could be resolved by appropriate selection of sintering parameters especially temperature. In this research, spark plasma sintering was utilized to fabricate nanostructured duplex stainless steel grade SAF 2205 with 5 wt.% nano TiN addition at different temperatures ranging from 1000 °C to 1200 °C. The effect of sintering temperature on the microstructure, density, hardness and wear of the samples was investigated. The results showed that the densities and grain sizes of the sintered nanocomposites increased with increasing the sintering temperature. The microstructures reveal ferrite and austenite grains with fine precipitates within the ferrite grains. The study of the hardness and wear behaviors, of the samples indicated that the optimum properties were obtained for the sintering temperature of 1150 °C.

Maximizing the nurses' preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm

NASA Astrophysics Data System (ADS)

Jafari, Hamed; Salmasi, Nasser

2015-09-01

The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital's demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses' preferences for working shifts and weekends off by considering several important factors such as hospital's policies, labor laws, governmental regulations, and the status of nurses at the end of the previous planning horizon in one of the largest hospitals in Iran i.e., Milad Hospital. Due to the shortage of available nurses, at first, the minimum total number of required nurses is determined. Then, a mathematical programming model is proposed to solve the problem optimally. Since the proposed research problem is NP-hard, a meta-heuristic algorithm based on simulated annealing (SA) is applied to heuristically solve the problem in a reasonable time. An initial feasible solution generator and several novel neighborhood structures are applied to enhance performance of the SA algorithm. Inspired from our observations in Milad hospital, random test problems are generated to evaluate the performance of the SA algorithm. The results of computational experiments indicate that the applied SA algorithm provides solutions with average percentage gap of 5.49 % compared to the upper bounds obtained from the mathematical model. Moreover, the applied SA algorithm provides significantly better solutions in a reasonable time than the schedules provided by the head nurses.

Influence of Additives on Masonry and Protective Paints’ Quality

NASA Astrophysics Data System (ADS)

Kostiunina, I. L.; Vyboishchik, A. V.

2017-11-01

The environment is one of main factors influencing the living conditions of urban population in Russia nowadays. One of the main drawbacks restraining the aesthetic improvement process of modern Russian cities is unsatisfactory protection of buildings from atmospheric phenomena. Moreover, industrial waste in modern industrial cities of Russia prevents a long-lasting decoration of urban buildings. The article presents an overview of the composition and physical properties of masonry paints applied in the Chelyabinsk region. The traditional technology of coatings obtaining is studied, the drawbacks of this technology are examined, the new materials and applications are offered. The influence of additives on the basic properties of masonry paints, viz. weather resistance, viscosity, hardness, cost, is considered. The application of new technologies utilizing industrial waste can solve the abovestated problem, which also, along with improving basic physical and chemical properties, will result in the cost reduction and the increase of the masonry paints hardness.

On the use of the generalized SPRT method in the equivalent hard sphere approximation for nuclear data evaluation

NASA Astrophysics Data System (ADS)

Noguere, Gilles; Archier, Pascal; Bouland, Olivier; Capote, Roberto; Jean, Cyrille De Saint; Kopecky, Stefan; Schillebeeckx, Peter; Sirakov, Ivan; Tamagno, Pierre

2017-09-01

A consistent description of the neutron cross sections from thermal energy up to the MeV region is challenging. One of the first steps consists in optimizing the optical model parameters using average resonance parameters, such as the neutron strength functions. They can be derived from a statistical analysis of the resolved resonance parameters, or calculated with the generalized form of the SPRT method by using scattering matrix elements provided by optical model calculations. One of the difficulties is to establish the contributions of the direct and compound nucleus reactions. This problem was solved by using a slightly modified average R-Matrix formula with an equivalent hard sphere radius deduced from the phase shift originating from the potential. The performances of the proposed formalism are illustrated with results obtained for the 238U+n nuclear systems.

Job shop scheduling problem with late work criterion

NASA Astrophysics Data System (ADS)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

Scheduling is considered as a key task in many industries, such as project based scheduling, crew scheduling, flight scheduling, machine scheduling, etc. In the machine scheduling area, the job shop scheduling problems are considered to be important and highly complex, in which they are characterized as NP-hard. The job shop scheduling problems with late work criterion and non-preemptive jobs are addressed in this paper. Late work criterion is a fairly new objective function. It is a qualitative measure and concerns with late parts of the jobs, unlike classical objective functions that are quantitative measures. In this work, simulated annealing was presented to solve the scheduling problem. In addition, operation based representation was used to encode the solution, and a neighbourhood search structure was employed to search for the new solutions. The case studies are Lawrence instances that were taken from the Operations Research Library. Computational results of this probabilistic meta-heuristic algorithm were compared with a conventional genetic algorithm, and a conclusion was made based on the algorithm and problem.

A review on simple assembly line balancing type-e problem

NASA Astrophysics Data System (ADS)

Jusop, M.; Rashid, M. F. F. Ab

2015-12-01

Simple assembly line balancing (SALB) is an attempt to assign the tasks to the various workstations along the line so that the precedence relations are satisfied and some performance measure are optimised. Advanced approach of algorithm is necessary to solve large-scale problems as SALB is a class of NP-hard. Only a few studies are focusing on simple assembly line balancing of Type-E problem (SALB-E) since it is a general and complex problem. SALB-E problem is one of SALB problem which consider the number of workstation and the cycle time simultaneously for the purpose of maximising the line efficiency. This paper review previous works that has been done in order to optimise SALB -E problem. Besides that, this paper also reviewed the Genetic Algorithm approach that has been used to optimise SALB-E. From the reviewed that has been done, it was found that none of the existing works are concern on the resource constraint in the SALB-E problem especially on machine and tool constraints. The research on SALB-E will contribute to the improvement of productivity in real industrial application.

Harmony search algorithm: application to the redundancy optimization problem

NASA Astrophysics Data System (ADS)

Nahas, Nabil; Thien-My, Dao

2010-09-01

The redundancy optimization problem is a well known NP-hard problem which involves the selection of elements and redundancy levels to maximize system performance, given different system-level constraints. This article presents an efficient algorithm based on the harmony search algorithm (HSA) to solve this optimization problem. The HSA is a new nature-inspired algorithm which mimics the improvization process of music players. Two kinds of problems are considered in testing the proposed algorithm, with the first limited to the binary series-parallel system, where the problem consists of a selection of elements and redundancy levels used to maximize the system reliability given various system-level constraints; the second problem for its part concerns the multi-state series-parallel systems with performance levels ranging from perfect operation to complete failure, and in which identical redundant elements are included in order to achieve a desirable level of availability. Numerical results for test problems from previous research are reported and compared. The results of HSA showed that this algorithm could provide very good solutions when compared to those obtained through other approaches.

A bis(3-hydroxy-4-pyridinone)-EDTA derivative as a strong chelator for M3+ hard metal ions: complexation ability and selectivity.

PubMed

Gama, Sofia; Dron, Paul; Chaves, Silvia; Farkas, Etelka; Santos, M Amélia

2009-08-21

The study of chelating compounds is very important to solve problems related to human metal overload. 3-Hydroxy-3-pyridinones (HP), namely deferiprone, have been clinically used for chelating therapy of Fe and Al over the last decade. A multi-disciplinary search for alternative molecules led us to develop poly-(3-hydroxy-4-pyridinones) to increase metal chelation efficacy. We present herein a complexation study of a new bis-(3-hydroxy-4-pyridinone)-EDTA derivative with a set of M(3+) hard metal ions (M = Fe, Al, Ga), as well as Zn(2+), a biologically relevant metal ion. Thus a systematic aqueous solution equilibrium study was performed using potentiometric and spectroscopic techniques (UV-Vis, NMR methods). These set of results enables the establishment of specific models as well as the determination of thermodynamic stability constants and coordination modes of the metal complexes. The results indicate that this ligand has a higher affinity for chelating to these hard metal ions than deferiprone, and that the coordination occurs mostly through the HP moieties. Furthermore, it was also found that this ligand has a higher selectivity for chelating to M(3+) hard metal ions (M = Fe, Al, Ga) than Zn(2+).

Metal Coatings

NASA Technical Reports Server (NTRS)

1994-01-01

During the Apollo Program, General Magnaplate Corporation developed process techniques for bonding dry lubricant coatings to space metals. The coatings were not susceptible to outgassing and offered enhanced surface hardness and superior resistance to corrosion and wear. This development was necessary because conventional lubrication processes were inadequate for lightweight materials used in Apollo components. General Magnaplate built on the original technology and became a leader in development of high performance metallurgical surface enhancement coatings - "synergistic" coatings, - which are used in applications from pizza making to laser manufacture. Each of the coatings is designed to protect a specific metal or group of metals to solve problems encountered under operating conditions.

Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs

NASA Astrophysics Data System (ADS)

Saha, Barna; Hoch, Allison; Khuller, Samir; Raschid, Louiqa; Zhang, Xiao-Ning

In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of the densest subgraph problem by adding an additional distance restriction (defined by a separate metric) to the nodes of the subgraph. We show that while this generalization makes the problem NP-hard for arbitrary metrics, when the metric comes from the distance metric of a tree, or an interval graph, the problem can be solved optimally in polynomial time. We also show that the densest subgraph problem with a specified subset of vertices that have to be included in the solution can be solved optimally in polynomial time. In addition, we consider other extensions when not just one solution needs to be found, but we wish to list all subgraphs of almost maximum density as well. We apply this method to a dataset of genes and their annotations obtained from The Arabidopsis Information Resource (TAIR). A user evaluation confirms that the patterns found in the distance restricted densest subgraph for a dataset of photomorphogenesis genes are indeed validated in the literature; a control dataset validates that these are not random patterns. Interestingly, the complex annotation patterns potentially lead to new and as yet unknown hypotheses. We perform experiments to determine the properties of the dense subgraphs, as we vary parameters, including the number of genes and the distance.

An evolutionary strategy based on partial imitation for solving optimization problems

NASA Astrophysics Data System (ADS)

Javarone, Marco Alberto

2016-12-01

In this work we introduce an evolutionary strategy to solve combinatorial optimization tasks, i.e. problems characterized by a discrete search space. In particular, we focus on the Traveling Salesman Problem (TSP), i.e. a famous problem whose search space grows exponentially, increasing the number of cities, up to becoming NP-hard. The solutions of the TSP can be codified by arrays of cities, and can be evaluated by fitness, computed according to a cost function (e.g. the length of a path). Our method is based on the evolution of an agent population by means of an imitative mechanism, we define 'partial imitation'. In particular, agents receive a random solution and then, interacting among themselves, may imitate the solutions of agents with a higher fitness. Since the imitation mechanism is only partial, agents copy only one entry (randomly chosen) of another array (i.e. solution). In doing so, the population converges towards a shared solution, behaving like a spin system undergoing a cooling process, i.e. driven towards an ordered phase. We highlight that the adopted 'partial imitation' mechanism allows the population to generate solutions over time, before reaching the final equilibrium. Results of numerical simulations show that our method is able to find, in a finite time, both optimal and suboptimal solutions, depending on the size of the considered search space.

Rate Adaptive Based Resource Allocation with Proportional Fairness Constraints in OFDMA Systems

PubMed Central

Yin, Zhendong; Zhuang, Shufeng; Wu, Zhilu; Ma, Bo

2015-01-01

Orthogonal frequency division multiple access (OFDMA), which is widely used in the wireless sensor networks, allows different users to obtain different subcarriers according to their subchannel gains. Therefore, how to assign subcarriers and power to different users to achieve a high system sum rate is an important research area in OFDMA systems. In this paper, the focus of study is on the rate adaptive (RA) based resource allocation with proportional fairness constraints. Since the resource allocation is a NP-hard and non-convex optimization problem, a new efficient resource allocation algorithm ACO-SPA is proposed, which combines ant colony optimization (ACO) and suboptimal power allocation (SPA). To reduce the computational complexity, the optimization problem of resource allocation in OFDMA systems is separated into two steps. For the first one, the ant colony optimization algorithm is performed to solve the subcarrier allocation. Then, the suboptimal power allocation algorithm is developed with strict proportional fairness, and the algorithm is based on the principle that the sums of power and the reciprocal of channel-to-noise ratio for each user in different subchannels are equal. To support it, plenty of simulation results are presented. In contrast with root-finding and linear methods, the proposed method provides better performance in solving the proportional resource allocation problem in OFDMA systems. PMID:26426016

Firefly algorithm for cardinality constrained mean-variance portfolio optimization problem with entropy diversity constraint.

PubMed

Bacanin, Nebojsa; Tuba, Milan

2014-01-01

Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results.

Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint

PubMed Central

2014-01-01

Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results. PMID:24991645

Analysis of problem solving on project based learning with resource based learning approach computer-aided program

NASA Astrophysics Data System (ADS)

Kuncoro, K. S.; Junaedi, I.; Dwijanto

2018-03-01

This study aimed to reveal the effectiveness of Project Based Learning with Resource Based Learning approach computer-aided program and analyzed problem-solving abilities in terms of problem-solving steps based on Polya stages. The research method used was mixed method with sequential explanatory design. The subject of this research was the students of math semester 4. The results showed that the S-TPS (Strong Top Problem Solving) and W-TPS (Weak Top Problem Solving) had good problem-solving abilities in each problem-solving indicator. The problem-solving ability of S-MPS (Strong Middle Problem Solving) and (Weak Middle Problem Solving) in each indicator was good. The subject of S-BPS (Strong Bottom Problem Solving) had a difficulty in solving the problem with computer program, less precise in writing the final conclusion and could not reflect the problem-solving process using Polya’s step. While the Subject of W-BPS (Weak Bottom Problem Solving) had not been able to meet almost all the indicators of problem-solving. The subject of W-BPS could not precisely made the initial table of completion so that the completion phase with Polya’s step was constrained.

Quantum simulator review

NASA Astrophysics Data System (ADS)

Bednar, Earl; Drager, Steven L.

2007-04-01

Quantum information processing's objective is to utilize revolutionary computing capability based on harnessing the paradigm shift offered by quantum computing to solve classically hard and computationally challenging problems. Some of our computationally challenging problems of interest include: the capability for rapid image processing, rapid optimization of logistics, protecting information, secure distributed simulation, and massively parallel computation. Currently, one important problem with quantum information processing is that the implementation of quantum computers is difficult to realize due to poor scalability and great presence of errors. Therefore, we have supported the development of Quantum eXpress and QuIDD Pro, two quantum computer simulators running on classical computers for the development and testing of new quantum algorithms and processes. This paper examines the different methods used by these two quantum computing simulators. It reviews both simulators, highlighting each simulators background, interface, and special features. It also demonstrates the implementation of current quantum algorithms on each simulator. It concludes with summary comments on both simulators.

Intrinsic optimization using stochastic nanomagnets

PubMed Central

Sutton, Brian; Camsari, Kerem Yunus; Behin-Aein, Behtash; Datta, Supriyo

2017-01-01

This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state. The basic constituents are stochastic nanomagnets which switch randomly between the ±1 Ising states and can be monitored continuously with standard electronics. Their mutual interactions can be short or long range, and their strengths can be reconfigured as needed to solve specific problems and to anneal the system at room temperature. The natural laws of statistical mechanics guide the network of stochastic nanomagnets at GHz speeds through the collective states with an emphasis on the low energy states that represent optimal solutions. As proof-of-concept, we present simulation results for standard NP-complete examples including a 16-city traveling salesman problem using experimentally benchmarked models for spin-transfer torque driven stochastic nanomagnets. PMID:28295053

Intrinsic optimization using stochastic nanomagnets

NASA Astrophysics Data System (ADS)

Sutton, Brian; Camsari, Kerem Yunus; Behin-Aein, Behtash; Datta, Supriyo

2017-03-01

This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state. The basic constituents are stochastic nanomagnets which switch randomly between the ±1 Ising states and can be monitored continuously with standard electronics. Their mutual interactions can be short or long range, and their strengths can be reconfigured as needed to solve specific problems and to anneal the system at room temperature. The natural laws of statistical mechanics guide the network of stochastic nanomagnets at GHz speeds through the collective states with an emphasis on the low energy states that represent optimal solutions. As proof-of-concept, we present simulation results for standard NP-complete examples including a 16-city traveling salesman problem using experimentally benchmarked models for spin-transfer torque driven stochastic nanomagnets.

Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm

NASA Astrophysics Data System (ADS)

Dutta, S.; Patra, D.; Shankar, H.; Alok Verma, P.

2014-11-01

minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network. In this study, we have developed a new GIS tool using most commonly known rudimentary algorithm called Prim's algorithm to construct the minimum spanning tree of a connected, undirected and weighted road network. This algorithm is based on the weight (adjacency) matrix of a weighted network and helps to solve complex network MST problem easily, efficiently and effectively. The selection of the appropriate algorithm is very essential otherwise it will be very hard to get an optimal result. In case of Road Transportation Network, it is very essential to find the optimal results by considering all the necessary points based on cost factor (time or distance). This paper is based on solving the Minimum Spanning Tree (MST) problem of a road network by finding it's minimum span by considering all the important network junction point. GIS technology is usually used to solve the network related problems like the optimal path problem, travelling salesman problem, vehicle routing problems, location-allocation problems etc. Therefore, in this study we have developed a customized GIS tool using Python script in ArcGIS software for the solution of MST problem for a Road Transportation Network of Dehradun city by considering distance and time as the impedance (cost) factors. It has a number of advantages like the users do not need a greater knowledge of the subject as the tool is user-friendly and that allows to access information varied and adapted the needs of the users. This GIS tool for MST can be applied for a nationwide plan called Prime Minister Gram Sadak Yojana in India to provide optimal all weather road connectivity to unconnected villages (points). This tool is also useful for constructing highways or railways spanning several cities optimally or connecting all cities with minimum total road length.

A Lifetime Maximization Relay Selection Scheme in Wireless Body Area Networks.

PubMed

Zhang, Yu; Zhang, Bing; Zhang, Shi

2017-06-02

Network Lifetime is one of the most important metrics in Wireless Body Area Networks (WBANs). In this paper, a relay selection scheme is proposed under the topology constrains specified in the IEEE 802.15.6 standard to maximize the lifetime of WBANs through formulating and solving an optimization problem where relay selection of each node acts as optimization variable. Considering the diversity of the sensor nodes in WBANs, the optimization problem takes not only energy consumption rate but also energy difference among sensor nodes into account to improve the network lifetime performance. Since it is Non-deterministic Polynomial-hard (NP-hard) and intractable, a heuristic solution is then designed to rapidly address the optimization. The simulation results indicate that the proposed relay selection scheme has better performance in network lifetime compared with existing algorithms and that the heuristic solution has low time complexity with only a negligible performance degradation gap from optimal value. Furthermore, we also conduct simulations based on a general WBAN model to comprehensively illustrate the advantages of the proposed algorithm. At the end of the evaluation, we validate the feasibility of our proposed scheme via an implementation discussion.

A brief history of the multiverse.

PubMed

Linde, Andrei

2017-02-01

The theory of the inflationary multiverse changes the way we think about our place in the world. According to its most popular version, our world may consist of infinitely many exponentially large parts, exhibiting different sets of low-energy laws of physics. Since these parts are extremely large, the interior of each of them behaves as if it were a separate universe, practically unaffected by the rest of the world. This picture, combined with the theory of eternal inflation and anthropic considerations, may help to solve many difficult problems of modern physics, including the cosmological constant problem. In this article I will briefly describe this theory and provide links to the some hard to find papers written during the first few years of the development of the inflationary multiverse scenario.

A brief history of the multiverse

NASA Astrophysics Data System (ADS)

Linde, Andrei

2017-02-01

The theory of the inflationary multiverse changes the way we think about our place in the world. According to its most popular version, our world may consist of infinitely many exponentially large parts, exhibiting different sets of low-energy laws of physics. Since these parts are extremely large, the interior of each of them behaves as if it were a separate universe, practically unaffected by the rest of the world. This picture, combined with the theory of eternal inflation and anthropic considerations, may help to solve many difficult problems of modern physics, including the cosmological constant problem. In this article I will briefly describe this theory and provide links to the some hard to find papers written during the first few years of the development of the inflationary multiverse scenario.

Building Extraction Based on Openstreetmap Tags and Very High Spatial Resolution Image in Urban Area

NASA Astrophysics Data System (ADS)

Kang, L.; Wang, Q.; Yan, H. W.

2018-04-01

How to derive contour of buildings from VHR images is the essential problem for automatic building extraction in urban area. To solve this problem, OSM data is introduced to offer vector contour information of buildings which is hard to get from VHR images. First, we import OSM data into database. The line string data of OSM with tags of building, amenity, office etc. are selected and combined into completed contours; Second, the accuracy of contours of buildings is confirmed by comparing with the real buildings in Google Earth; Third, maximum likelihood classification is conducted with the confirmed building contours, and the result demonstrates that the proposed approach is effective and accurate. The approach offers a new way for automatic interpretation of VHR images.

A soft computing-based approach to optimise queuing-inventory control problem

NASA Astrophysics Data System (ADS)

Alaghebandha, Mohammad; Hajipour, Vahid

2015-04-01

In this paper, a multi-product continuous review inventory control problem within batch arrival queuing approach (MQr/M/1) is developed to find the optimal quantities of maximum inventory. The objective function is to minimise summation of ordering, holding and shortage costs under warehouse space, service level and expected lost-sales shortage cost constraints from retailer and warehouse viewpoints. Since the proposed model is Non-deterministic Polynomial-time hard, an efficient imperialist competitive algorithm (ICA) is proposed to solve the model. To justify proposed ICA, both ganetic algorithm and simulated annealing algorithm are utilised. In order to determine the best value of algorithm parameters that result in a better solution, a fine-tuning procedure is executed. Finally, the performance of the proposed ICA is analysed using some numerical illustrations.

Efficient sequential and parallel algorithms for finding edit distance based motifs.

PubMed

Pal, Soumitra; Xiao, Peng; Rajasekaran, Sanguthevar

2016-08-18

Motif search is an important step in extracting meaningful patterns from biological data. The general problem of motif search is intractable and there is a pressing need to develop efficient, exact and approximation algorithms to solve this problem. In this paper, we present several novel, exact, sequential and parallel algorithms for solving the (l,d) Edit-distance-based Motif Search (EMS) problem: given two integers l,d and n biological strings, find all strings of length l that appear in each input string with atmost d errors of types substitution, insertion and deletion. One popular technique to solve the problem is to explore for each input string the set of all possible l-mers that belong to the d-neighborhood of any substring of the input string and output those which are common for all input strings. We introduce a novel and provably efficient neighborhood exploration technique. We show that it is enough to consider the candidates in neighborhood which are at a distance exactly d. We compactly represent these candidate motifs using wildcard characters and efficiently explore them with very few repetitions. Our sequential algorithm uses a trie based data structure to efficiently store and sort the candidate motifs. Our parallel algorithm in a multi-core shared memory setting uses arrays for storing and a novel modification of radix-sort for sorting the candidate motifs. The algorithms for EMS are customarily evaluated on several challenging instances such as (8,1), (12,2), (16,3), (20,4), and so on. The best previously known algorithm, EMS1, is sequential and in estimated 3 days solves up to instance (16,3). Our sequential algorithms are more than 20 times faster on (16,3). On other hard instances such as (9,2), (11,3), (13,4), our algorithms are much faster. Our parallel algorithm has more than 600 % scaling performance while using 16 threads. Our algorithms have pushed up the state-of-the-art of EMS solvers and we believe that the techniques introduced in this paper are also applicable to other motif search problems such as Planted Motif Search (PMS) and Simple Motif Search (SMS).

MO-FG-CAMPUS-TeP2-01: A Graph Form ADMM Algorithm for Constrained Quadratic Radiation Treatment Planning

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, X; Belcher, AH; Wiersma, R

Purpose: In radiation therapy optimization the constraints can be either hard constraints which must be satisfied or soft constraints which are included but do not need to be satisfied exactly. Currently the voxel dose constraints are viewed as soft constraints and included as a part of the objective function and approximated as an unconstrained problem. However in some treatment planning cases the constraints should be specified as hard constraints and solved by constrained optimization. The goal of this work is to present a computation efficiency graph form alternating direction method of multipliers (ADMM) algorithm for constrained quadratic treatment planning optimizationmore » and compare it with several commonly used algorithms/toolbox. Method: ADMM can be viewed as an attempt to blend the benefits of dual decomposition and augmented Lagrangian methods for constrained optimization. Various proximal operators were first constructed as applicable to quadratic IMRT constrained optimization and the problem was formulated in a graph form of ADMM. A pre-iteration operation for the projection of a point to a graph was also proposed to further accelerate the computation. Result: The graph form ADMM algorithm was tested by the Common Optimization for Radiation Therapy (CORT) dataset including TG119, prostate, liver, and head & neck cases. Both unconstrained and constrained optimization problems were formulated for comparison purposes. All optimizations were solved by LBFGS, IPOPT, Matlab built-in toolbox, CVX (implementing SeDuMi) and Mosek solvers. For unconstrained optimization, it was found that LBFGS performs the best, and it was 3–5 times faster than graph form ADMM. However, for constrained optimization, graph form ADMM was 8 – 100 times faster than the other solvers. Conclusion: A graph form ADMM can be applied to constrained quadratic IMRT optimization. It is more computationally efficient than several other commercial and noncommercial optimizers and it also used significantly less computer memory.« less

Toward Solving the Problem of Problem Solving: An Analysis Framework

ERIC Educational Resources Information Center

Roesler, Rebecca A.

2016-01-01

Teaching is replete with problem solving. Problem solving as a skill, however, is seldom addressed directly within music teacher education curricula, and research in music education has not examined problem solving systematically. A framework detailing problem-solving component skills would provide a needed foundation. I observed problem solving…

Renewal of the Advanced Photon Source.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gibson, J. M.

2008-12-31

To ensure that state-of-the-art hard x-ray tools are available for US scientists and engineers who are solving key problems in energy, environment, technology development and human health, the nation's unique high-energy x-ray source needs a major renewal of its capabilities. The Advanced Photon Source renewal program responds to key scientific needs driven by our user community. The renewal encompasses many innovations in beamlines and accelerator capabilities, each of which will transform our tools and allow new problems to be solved. In particular the APS renewal dramatically expands two compelling avenues for research. Through x-ray imaging, we can illuminate complex hierarchical structures from the molecular level to the macroscopic level, and study how they change in time and in response to stimuli. Images will facilitate understanding how proteins fit together to make living organisms, contribute to development of lighter, higher-strength alloys for fuel-efficient transportation and advance the use of biomass for alternative fuels. Hard x-rays are also especially suited to the study of real materials, under realistic conditions and in real-time. The advances proposed in this area would help develop more efficient catalysts, enhance green manufacturing, point the way to artificial light-harvesting inspired by biology and help us develop more efficient lighting. The scope of the renewal of our {approx}more » $$1.5B facility is estimated to be {approx}$$350M over five years. It is vital that the investment begin as soon as possible. The renewed APS would complement other national investments such as the National Synchrotron Light Source-II and would keep the U.S. internationally competitive.« less

Goals and everyday problem solving: examining the link between age-related goals and problem-solving strategy use.

PubMed

Hoppmann, Christiane A; Coats, Abby Heckman; Blanchard-Fields, Fredda

2008-07-01

Qualitative interviews on family and financial problems from 332 adolescents, young, middle-aged, and older adults, demonstrated that developmentally relevant goals predicted problem-solving strategy use over and above problem domain. Four focal goals concerned autonomy, generativity, maintaining good relationships with others, and changing another person. We examined both self- and other-focused problem-solving strategies. Autonomy goals were associated with self-focused instrumental problem solving and generative goals were related to other-focused instrumental problem solving in family and financial problems. Goals of changing another person were related to other-focused instrumental problem solving in the family domain only. The match between goals and strategies, an indicator of problem-solving adaptiveness, showed that young individuals displayed the greatest match between autonomy goals and self-focused problem solving, whereas older adults showed a greater match between generative goals and other-focused problem solving. Findings speak to the importance of considering goals in investigations of age-related differences in everyday problem solving.

Manipulating Tabu List to Handle Machine Breakdowns in Job Shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Nababan, Erna Budhiarti; SalimSitompul, Opim

2011-06-01

Machine breakdowns in a production schedule may occur on a random basis that make the well-known hard combinatorial problem of Job Shop Scheduling Problems (JSSP) becomes more complex. One of popular techniques used to solve the combinatorial problems is Tabu Search. In this technique, moves that will be not allowed to be revisited are retained in a tabu list in order to avoid in gaining solutions that have been obtained previously. In this paper, we propose an algorithm to employ a second tabu list to keep broken machines, in addition to the tabu list that keeps the moves. The period of how long the broken machines will be kept on the list is categorized using fuzzy membership function. Our technique are tested to the benchmark data of JSSP available on the OR library. From the experiment, we found that our algorithm is promising to help a decision maker to face the event of machine breakdowns.

The limitations of staggered grid finite differences in plasticity problems

NASA Astrophysics Data System (ADS)

Pranger, Casper; Herrendörfer, Robert; Le Pourhiet, Laetitia

2017-04-01

Most crustal-scale applications operate at grid sizes much larger than those at which plasticity occurs in nature. As a consequence, plastic shear bands often localize to the scale of one grid cell, and numerical ploys — like introducing an artificial length scale — are needed to counter this. If for whatever reasons (good or bad) this is not done, we find that problems may arise due to the fact that in the staggered grid finite difference discretization, unknowns like components of the stress tensor and velocity vector are located in physically different positions. This incurs frequent interpolation, reducing the accuracy of the discretization. For purely stress-dependent plasticity problems the adverse effects might be contained because the magnitude of the stress discontinuity across a plastic shear band is limited. However, we find that when rate-dependence of friction is added in the mix, things become ugly really fast and the already hard-to-solve and highly nonlinear problem of plasticity incurs an extra penalty.

Finite-time convergent recurrent neural network with a hard-limiting activation function for constrained optimization with piecewise-linear objective functions.

PubMed

Liu, Qingshan; Wang, Jun

2011-04-01

This paper presents a one-layer recurrent neural network for solving a class of constrained nonsmooth optimization problems with piecewise-linear objective functions. The proposed neural network is guaranteed to be globally convergent in finite time to the optimal solutions under a mild condition on a derived lower bound of a single gain parameter in the model. The number of neurons in the neural network is the same as the number of decision variables of the optimization problem. Compared with existing neural networks for optimization, the proposed neural network has a couple of salient features such as finite-time convergence and a low model complexity. Specific models for two important special cases, namely, linear programming and nonsmooth optimization, are also presented. In addition, applications to the shortest path problem and constrained least absolute deviation problem are discussed with simulation results to demonstrate the effectiveness and characteristics of the proposed neural network.

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

NASA Astrophysics Data System (ADS)

Mirabi, Mohammad; Fatemi Ghomi, S. M. T.; Jolai, F.

2014-04-01

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this paper develops a novel hybrid genetic algorithm (HGA) with three genetic operators. Proposed HGA applies a modified approach to generate a pool of initial solutions, and also uses an improved heuristic called the iterated swap procedure to improve the initial solutions. We consider the make-to-order production approach that some sequences between jobs are assumed as tabu based on maximum allowable setup cost. In addition, the results are compared to some recently developed heuristics and computational experimental results show that the proposed HGA performs very competitively with respect to accuracy and efficiency of solution.

Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.

PubMed

Mulder, Samuel A; Wunsch, Donald C

2003-01-01

The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations research. It has been shown to be NP-complete, and is an often-used benchmark for new optimization techniques. One of the main challenges with this problem is that standard, non-AI heuristic approaches such as the Lin-Kernighan algorithm (LK) and the chained LK variant are currently very effective and in wide use for the common fully connected, Euclidean variant that is considered here. This paper presents an algorithm that uses adaptive resonance theory (ART) in combination with a variation of the Lin-Kernighan local optimization algorithm to solve very large instances of the TSP. The primary advantage of this algorithm over traditional LK and chained-LK approaches is the increased scalability and parallelism allowed by the divide-and-conquer clustering paradigm. Tours obtained by the algorithm are lower quality, but scaling is much better and there is a high potential for increasing performance using parallel hardware.

Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

NASA Astrophysics Data System (ADS)

Ghezavati, V. R.; Beigi, M.

2016-12-01

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among established facilities and existing demand points. In this paper, the location-routing problem with time window (LRPTW) and homogeneous fleet type and designing a multi-echelon, and capacitated reverse logistics network, are considered which may arise in many real-life situations in logistics management. Our proposed RL network consists of hybrid collection/inspection centers, recovery centers and disposal centers. Here, we present a new bi-objective mathematical programming (BOMP) for LRPTW in reverse logistic. Since this type of problem is NP-hard, the non-dominated sorting genetic algorithm II (NSGA-II) is proposed to obtain the Pareto frontier for the given problem. Several numerical examples are presented to illustrate the effectiveness of the proposed model and algorithm. Also, the present work is an effort to effectively implement the ɛ-constraint method in GAMS software for producing the Pareto-optimal solutions in a BOMP. The results of the proposed algorithm have been compared with the ɛ-constraint method. The computational results show that the ɛ-constraint method is able to solve small-size instances to optimality within reasonable computing times, and for medium-to-large-sized problems, the proposed NSGA-II works better than the ɛ-constraint.

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

NASA Astrophysics Data System (ADS)

Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid

2017-09-01

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.

Resources in Technology: Problem-Solving.

ERIC Educational Resources Information Center

Technology Teacher, 1986

1986-01-01

This instructional module examines a key function of science and technology: problem solving. It studies the meaning of problem solving, looks at techniques for problem solving, examines case studies that exemplify the problem-solving approach, presents problems for the reader to solve, and provides a student self-quiz. (Author/CT)

A Cognitive Analysis of Students’ Mathematical Problem Solving Ability on Geometry

NASA Astrophysics Data System (ADS)

Rusyda, N. A.; Kusnandi, K.; Suhendra, S.

2017-09-01

The purpose of this research is to analyze of mathematical problem solving ability of students in one of secondary school on geometry. This research was conducted by using quantitative approach with descriptive method. Population in this research was all students of that school and the sample was twenty five students that was chosen by purposive sampling technique. Data of mathematical problem solving were collected through essay test. The results showed the percentage of achievement of mathematical problem solving indicators of students were: 1) solve closed mathematical problems with context in math was 50%; 2) solve the closed mathematical problems with the context beyond mathematics was 24%; 3) solving open mathematical problems with contexts in mathematics was 35%; And 4) solving open mathematical problems with contexts outside mathematics was 44%. Based on the percentage, it can be concluded that the level of achievement of mathematical problem solving ability in geometry still low. This is because students are not used to solving problems that measure mathematical problem solving ability, weaknesses remember previous knowledge, and lack of problem solving framework. So the students’ ability of mathematical problems solving need to be improved with implement appropriate learning strategy.

System identification using Nuclear Norm & Tabu Search optimization

NASA Astrophysics Data System (ADS)

Ahmed, Asif A.; Schoen, Marco P.; Bosworth, Ken W.

2018-01-01

In recent years, subspace System Identification (SI) algorithms have seen increased research, stemming from advanced minimization methods being applied to the Nuclear Norm (NN) approach in system identification. These minimization algorithms are based on hard computing methodologies. To the authors’ knowledge, as of now, there has been no work reported that utilizes soft computing algorithms to address the minimization problem within the nuclear norm SI framework. A linear, time-invariant, discrete time system is used in this work as the basic model for characterizing a dynamical system to be identified. The main objective is to extract a mathematical model from collected experimental input-output data. Hankel matrices are constructed from experimental data, and the extended observability matrix is employed to define an estimated output of the system. This estimated output and the actual - measured - output are utilized to construct a minimization problem. An embedded rank measure assures minimum state realization outcomes. Current NN-SI algorithms employ hard computing algorithms for minimization. In this work, we propose a simple Tabu Search (TS) algorithm for minimization. TS algorithm based SI is compared with the iterative Alternating Direction Method of Multipliers (ADMM) line search optimization based NN-SI. For comparison, several different benchmark system identification problems are solved by both approaches. Results show improved performance of the proposed SI-TS algorithm compared to the NN-SI ADMM algorithm.

Quantum attack-resistent certificateless multi-receiver signcryption scheme.

PubMed

Li, Huixian; Chen, Xubao; Pang, Liaojun; Shi, Weisong

2013-01-01

The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards.

The Modularized Software Package ASKI - Full Waveform Inversion Based on Waveform Sensitivity Kernels Utilizing External Seismic Wave Propagation Codes

NASA Astrophysics Data System (ADS)

Schumacher, F.; Friederich, W.

2015-12-01

We present the modularized software package ASKI which is a flexible and extendable toolbox for seismic full waveform inversion (FWI) as well as sensitivity or resolution analysis operating on the sensitivity matrix. It utilizes established wave propagation codes for solving the forward problem and offers an alternative to the monolithic, unflexible and hard-to-modify codes that have typically been written for solving inverse problems. It is available under the GPL at www.rub.de/aski. The Gauss-Newton FWI method for 3D-heterogeneous elastic earth models is based on waveform sensitivity kernels and can be applied to inverse problems at various spatial scales in both Cartesian and spherical geometries. The kernels are derived in the frequency domain from Born scattering theory as the Fréchet derivatives of linearized full waveform data functionals, quantifying the influence of elastic earth model parameters on the particular waveform data values. As an important innovation, we keep two independent spatial descriptions of the earth model - one for solving the forward problem and one representing the inverted model updates. Thereby we account for the independent needs of spatial model resolution of forward and inverse problem, respectively. Due to pre-integration of the kernels over the (in general much coarser) inversion grid, storage requirements for the sensitivity kernels are dramatically reduced.ASKI can be flexibly extended to other forward codes by providing it with specific interface routines that contain knowledge about forward code-specific file formats and auxiliary information provided by the new forward code. In order to sustain flexibility, the ASKI tools must communicate via file output/input, thus large storage capacities need to be accessible in a convenient way. Storing the complete sensitivity matrix to file, however, permits the scientist full manual control over each step in a customized procedure of sensitivity/resolution analysis and full waveform inversion.

Relationship Functioning Moderates the Association Between Depressive Symptoms and Life Stressors

PubMed Central

Trombello, Joseph M.; Schoebi, Dominik; Bradbury, Thomas N.

2017-01-01

Data from 172 newlywed couples were collected over the first 4 years of marriage to test how behaviors demonstrated during marital interactions moderate associations between depressive symptoms and subsequent life stressors. Depressive symptoms and behaviors coded from problem-solving and social support interactions were analyzed as predictors of nonmarital stressors that were interpersonal and dependent on the participant's actions. Behavioral codes were found to moderate 3 of 16 symptom-to-life event associations for husbands. Husbands' reports of more depressive symptoms predicted greater levels of stress when husbands' positive affect and hard negative affect during problem-solving were relatively infrequent and when wives made frequent displays of positive behaviors during husbands' support topics. These effects remained after controlling for marital satisfaction. For wives, behavioral moderators did not interact with depressive symptoms to predict changes in stress, but marital satisfaction consistently interacted with depressive symptoms to predict future stressors beyond interpersonal behaviors. Specifically, for wives, stress generation was more evident when relationship satisfaction was low than when it was high. Our results, though different for men and women, suggest that relationship functioning can alter associations between depressive symptoms and life stress in the early years of marriage. PMID:21355647

Reasoning strategies used by students to solve stoichiometry problems and its relationship to alternative conceptions, prior knowledge, and cognitive variables

NASA Astrophysics Data System (ADS)

de Astudillo, Luisa Rojas; Niaz, Mansoor

1996-06-01

Achievement in science depends on a series of factors that characterize the cognitive abilities of the students and the complex interactions between these factors and the environment that intervenes in the formation of students' background. The objective of this study is to: a) investigate reasoning strategies students use in solving stoichiometric problems; b) explore the relation between these strategies and alternative conceptions, prior knowledge and cognitive variables; and c) interpret the results within an epistemological framework. Results obtained show how stoichiometric relations produce conflicting situations for students, leading to conceptual misunderstanding of concepts, such as mass, atoms and moles. The wide variety of strategies used by students attest to the presence of competing and conflicting frameworks (progressive transitions, cf. Lakatos, 1970), leading to greater conceptual understanding. It is concluded that the methodology developed in this study (based on a series of closely related probing questions, generally requiring no calculations, that elicit student conceptual understanding to varying degrees within an intact classroom context) was influential in improving student performance. This improvement in performance, however, does not necessarily affect students' hard core of beliefs.

Removal of DLC film on polymeric materials by low temperature atmospheric-pressure plasma jet

NASA Astrophysics Data System (ADS)

Kobayashi, Daichi; Tanaka, Fumiyuki; Kasai, Yoshiyuki; Sahara, Junki; Asai, Tomohiko; Hiratsuka, Masanori; Takatsu, Mikio; Koguchi, Haruhisa

2017-10-01

Diamond-like carbon (DLC) thin film has various excellent functions. For example, high hardness, abrasion resistance, biocompatibility, etc. Because of these functionalities, DLC has been applied in various fields. Removal method of DLC has also been developed for purpose of microfabrication, recycling the substrate and so on. Oxygen plasma etching and shot-blast are most common method to remove DLC. However, the residual carbon, high cost, and damage onto the substrate are problems to be solved for further application. In order to solve these problems, removal method using low temperature atmospheric pressure plasma jet has been developed in this work. The removal effect of this method has been demonstrated for DLC on the SUS304 substrate. The principle of this method is considered that oxygen radical generated by plasma oxidize carbon constituting the DLC film and then the film is removed. In this study, in order to widen application range of this method and to understand the mechanism of film removal, plasma irradiation experiment has been attempted on DLC on the substrate with low heat resistance. The DLC was removed successfully without any significant thermal damage on the surface of polymeric material.

Adsorption of hard spheres via the non-uniform Percus-Yevick equation

NASA Astrophysics Data System (ADS)

Sokołowski, S.

We study the adsorption of hard spheres on solids interacting according to potentials whose Boltzmann functions contain a δ-function. The nonuniform Percus-Yevick equation is solved by using the method introduced by Lado to study two dimensional fluids.

PCM-Based Durable Write Cache for Fast Disk I/O

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Zhuo; Wang, Bin; Carpenter, Patrick

2012-01-01

Flash based solid-state devices (FSSDs) have been adopted within the memory hierarchy to improve the performance of hard disk drive (HDD) based storage system. However, with the fast development of storage-class memories, new storage technologies with better performance and higher write endurance than FSSDs are emerging, e.g., phase-change memory (PCM). Understanding how to leverage these state-of-the-art storage technologies for modern computing systems is important to solve challenging data intensive computing problems. In this paper, we propose to leverage PCM for a hybrid PCM-HDD storage architecture. We identify the limitations of traditional LRU caching algorithms for PCM-based caches, and develop amore » novel hash-based write caching scheme called HALO to improve random write performance of hard disks. To address the limited durability of PCM devices and solve the degraded spatial locality in traditional wear-leveling techniques, we further propose novel PCM management algorithms that provide effective wear-leveling while maximizing access parallelism. We have evaluated this PCM-based hybrid storage architecture using applications with a diverse set of I/O access patterns. Our experimental results demonstrate that the HALO caching scheme leads to an average reduction of 36.8% in execution time compared to the LRU caching scheme, and that the SFC wear leveling extends the lifetime of PCM by a factor of 21.6.« less

Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover

ERIC Educational Resources Information Center

Carruthers, Sarah; Masson, Michael E. J.; Stege, Ulrike

2012-01-01

Recent studies on a computationally hard visual optimization problem, the Traveling Salesperson Problem (TSP), indicate that humans are capable of finding close to optimal solutions in near-linear time. The current study is a preliminary step in investigating human performance on another hard problem, the Minimum Vertex Cover Problem, in which…

Algorithmics - Is There Hope for a Unified Theory?

NASA Astrophysics Data System (ADS)

Hromkovič, Juraj

Computer science was born with the formal definition of the notion of an algorithm. This definition provides clear limits of automatization, separating problems into algorithmically solvable problems and algorithmically unsolvable ones. The second big bang of computer science was the development of the concept of computational complexity. People recognized that problems that do not admit efficient algorithms are not solvable in practice. The search for a reasonable, clear and robust definition of the class of practically solvable algorithmic tasks started with the notion of the class {P} and of {NP}-completeness. In spite of the fact that this robust concept is still fundamental for judging the hardness of computational problems, a variety of approaches was developed for solving instances of {NP}-hard problems in many applications. Our 40-years short attempt to fix the fuzzy border between the practically solvable problems and the practically unsolvable ones partially reminds of the never-ending search for the definition of "life" in biology or for the definitions of matter and energy in physics. Can the search for the formal notion of "practical solvability" also become a never-ending story or is there hope for getting a well-accepted, robust definition of it? Hopefully, it is not surprising that we are not able to answer this question in this invited talk. But to deal with this question is of crucial importance, because only due to enormous effort scientists get a better and better feeling of what the fundamental notions of science like life and energy mean. In the flow of numerous technical results, we must not forget the fact that most of the essential revolutionary contributions to science were done by defining new concepts and notions.

An outer approximation method for the road network design problem

PubMed Central

2018-01-01

Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well. PMID:29590111

An outer approximation method for the road network design problem.

PubMed

Asadi Bagloee, Saeed; Sarvi, Majid

2018-01-01

Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well.

Coordinated control of active and reactive power of distribution network with distributed PV cluster via model predictive control

NASA Astrophysics Data System (ADS)

Ji, Yu; Sheng, Wanxing; Jin, Wei; Wu, Ming; Liu, Haitao; Chen, Feng

2018-02-01

A coordinated optimal control method of active and reactive power of distribution network with distributed PV cluster based on model predictive control is proposed in this paper. The method divides the control process into long-time scale optimal control and short-time scale optimal control with multi-step optimization. The models are transformed into a second-order cone programming problem due to the non-convex and nonlinear of the optimal models which are hard to be solved. An improved IEEE 33-bus distribution network system is used to analyse the feasibility and the effectiveness of the proposed control method

Perspectives on Industrial Innovation from Agilent, HP, and Bell Labs

NASA Astrophysics Data System (ADS)

Hollenhorst, James

2014-03-01

Innovation is the life blood of technology companies. I will give perspectives gleaned from a career in research and development at Bell Labs, HP Labs, and Agilent Labs, from the point of view of an individual contributor and a manager. Physicists bring a unique set of skills to the corporate environment, including a desire to understand the fundamentals, a solid foundation in physical principles, expertise in applied mathematics, and most importantly, an attitude: namely, that hard problems can be solved by breaking them into manageable pieces. In my experience, hiring managers in industry seldom explicitly search for physicists, but they want people with those skills.

Model of depositing layer on cylindrical surface produced by induction-assisted laser cladding process

NASA Astrophysics Data System (ADS)

Kotlan, Václav; Hamar, Roman; Pánek, David; Doležel, Ivo

2017-12-01

A model of hybrid cladding on a cylindrical surface is built and numerically solved. Heating of both substrate and the powder material to be deposited on its surface is realized by laser beam and preheating inductor. The task represents a hard-coupled electromagnetic-thermal problem with time-varying geometry. Two specific algorithms are developed to incorporate this effect into the model, driven by local distribution of temperature and its gradients. The algorithms are implemented into the COMSOL Multiphysics 5.2 code that is used for numerical computations of the task. The methodology is illustrated with a typical example whose results are discussed.

Charge of the right brigade? Communities, coverage, and care for the uninsured.

PubMed

Brown, Lawrence D; Stevens, Beth

2006-01-01

The Robert Wood Johnson Foundation's Communities in Charge (CIC) program funded projects in fourteen communities that aimed to expand health insurance coverage and improve care for their uninsured residents. Our examination of seven program sites suggests that despite solid community leadership and carefully crafted plans, political, economic, and organizational obstacles precluded much expansion of coverage and constrained reforms. Redistribution of financial and organizational resources among both mainstream and safety-net institutions in these communities was hard to achieve. CIC's record offers little evidence that communities are better equipped than are other sectors of U.S. society to solve the problem of uninsurance.

High resolution particle tracking method by suppressing the wavefront aberrations

NASA Astrophysics Data System (ADS)

Chang, Xinyu; Yang, Yuan; Kou, Li; Jin, Lei; Lu, Junsheng; Hu, Xiaodong

2018-01-01

Digital in-line holographic microscopy is one of the most efficient methods for particle tracking as it can precisely measure the axial position of particles. However, imaging systems are often limited by detector noise, image distortions and human operator misjudgment making the particles hard to locate. A general method is used to solve this problem. The normalized holograms of particles were reconstructed to the pupil plane and then fit to a linear superposition of the Zernike polynomial functions to suppress the aberrations. Relative experiments were implemented to validate the method and the results show that nanometer scale resolution was achieved even when the holograms were poorly recorded.

Image restoration by minimizing zero norm of wavelet frame coefficients

NASA Astrophysics Data System (ADS)

Bao, Chenglong; Dong, Bin; Hou, Likun; Shen, Zuowei; Zhang, Xiaoqun; Zhang, Xue

2016-11-01

In this paper, we propose two algorithms, namely the extrapolated proximal iterative hard thresholding (EPIHT) algorithm and the EPIHT algorithm with line-search, for solving the {{\\ell }}0-norm regularized wavelet frame balanced approach for image restoration. Under the theoretical framework of Kurdyka-Łojasiewicz property, we show that the sequences generated by the two algorithms converge to a local minimizer with linear convergence rate. Moreover, extensive numerical experiments on sparse signal reconstruction and wavelet frame based image restoration problems including CT reconstruction, image deblur, demonstrate the improvement of {{\\ell }}0-norm based regularization models over some prevailing ones, as well as the computational efficiency of the proposed algorithms.

Problem-solving variability in older spouses: how is it linked to problem-, person-, and couple-characteristics?

PubMed

Hoppmann, Christiane A; Blanchard-Fields, Fredda

2011-09-01

Problem-solving does not take place in isolation and often involves social others such as spouses. Using repeated daily life assessments from 98 older spouses (M age = 72 years; M marriage length = 42 years), the present study examined theoretical notions from social-contextual models of coping regarding (a) the origins of problem-solving variability and (b) associations between problem-solving and specific problem-, person-, and couple- characteristics. Multilevel models indicate that the lion's share of variability in everyday problem-solving is located at the level of the problem situation. Importantly, participants reported more proactive emotion regulation and collaborative problem-solving for social than nonsocial problems. We also found person-specific consistencies in problem-solving. That is, older spouses high in Neuroticism reported more problems across the study period as well as less instrumental problem-solving and more passive emotion regulation than older spouses low in Neuroticism. Contrary to expectations, relationship satisfaction was unrelated to problem-solving in the present sample. Results are in line with the stress and coping literature in demonstrating that everyday problem-solving is a dynamic process that has to be viewed in the broader context in which it occurs. Our findings also complement previous laboratory-based work on everyday problem-solving by underscoring the benefits of examining everyday problem-solving as it unfolds in spouses' own environment.

Resource Letter RPS-1: Research in problem solving

NASA Astrophysics Data System (ADS)

Hsu, Leonardo; Brewe, Eric; Foster, Thomas M.; Harper, Kathleen A.

2004-09-01

This Resource Letter provides a guide to the literature on research in problem solving, especially in physics. The references were compiled with two audiences in mind: physicists who are (or might become) engaged in research on problem solving, and physics instructors who are interested in using research results to improve their students' learning of problem solving. In addition to general references, journal articles and books are cited for the following topics: cognitive aspects of problem solving, expert-novice problem-solver characteristics, problem solving in mathematics, alternative problem types, curricular interventions, and the use of computers in problem solving.

Dynamic cellular manufacturing system considering machine failure and workload balance

NASA Astrophysics Data System (ADS)

Rabbani, Masoud; Farrokhi-Asl, Hamed; Ravanbakhsh, Mohammad

2018-02-01

Machines are a key element in the production system and their failure causes irreparable effects in terms of cost and time. In this paper, a new multi-objective mathematical model for dynamic cellular manufacturing system (DCMS) is provided with consideration of machine reliability and alternative process routes. In this dynamic model, we attempt to resolve the problem of integrated family (part/machine cell) formation as well as the operators' assignment to the cells. The first objective minimizes the costs associated with the DCMS. The second objective optimizes the labor utilization and, finally, a minimum value of the variance of workload between different cells is obtained by the third objective function. Due to the NP-hard nature of the cellular manufacturing problem, the problem is initially validated by the GAMS software in small-sized problems, and then the model is solved by two well-known meta-heuristic methods including non-dominated sorting genetic algorithm and multi-objective particle swarm optimization in large-scaled problems. Finally, the results of the two algorithms are compared with respect to five different comparison metrics.

A Hybrid Cellular Genetic Algorithm for Multi-objective Crew Scheduling Problem

NASA Astrophysics Data System (ADS)

Jolai, Fariborz; Assadipour, Ghazal

Crew scheduling is one of the important problems of the airline industry. This problem aims to cover a number of flights by crew members, such that all the flights are covered. In a robust scheduling the assignment should be so that the total cost, delays, and unbalanced utilization are minimized. As the problem is NP-hard and the objectives are in conflict with each other, a multi-objective meta-heuristic called CellDE, which is a hybrid cellular genetic algorithm, is implemented as the optimization method. The proposed algorithm provides the decision maker with a set of non-dominated or Pareto-optimal solutions, and enables them to choose the best one according to their preferences. A set of problems of different sizes is generated and solved using the proposed algorithm. Evaluating the performance of the proposed algorithm, three metrics are suggested, and the diversity and the convergence of the achieved Pareto front are appraised. Finally a comparison is made between CellDE and PAES, another meta-heuristic algorithm. The results show the superiority of CellDE.

A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems

NASA Astrophysics Data System (ADS)

Takata, Kenta; Marandi, Alireza; Hamerly, Ryan; Haribara, Yoshitaka; Maruo, Daiki; Tamate, Shuhei; Sakaguchi, Hiromasa; Utsunomiya, Shoko; Yamamoto, Yoshihisa

2016-09-01

Many tasks in our modern life, such as planning an efficient travel, image processing and optimizing integrated circuit design, are modeled as complex combinatorial optimization problems with binary variables. Such problems can be mapped to finding a ground state of the Ising Hamiltonian, thus various physical systems have been studied to emulate and solve this Ising problem. Recently, networks of mutually injected optical oscillators, called coherent Ising machines, have been developed as promising solvers for the problem, benefiting from programmability, scalability and room temperature operation. Here, we report a 16-bit coherent Ising machine based on a network of time-division-multiplexed femtosecond degenerate optical parametric oscillators. The system experimentally gives more than 99.6% of success rates for one-dimensional Ising ring and nondeterministic polynomial-time (NP) hard instances. The experimental and numerical results indicate that gradual pumping of the network combined with multiple spectral and temporal modes of the femtosecond pulses can improve the computational performance of the Ising machine, offering a new path for tackling larger and more complex instances.

Grover Search and the No-Signaling Principle

NASA Astrophysics Data System (ADS)

Bao, Ning; Bouland, Adam; Jordan, Stephen P.

2016-09-01

Two of the key properties of quantum physics are the no-signaling principle and the Grover search lower bound. That is, despite admitting stronger-than-classical correlations, quantum mechanics does not imply superluminal signaling, and despite a form of exponential parallelism, quantum mechanics does not imply polynomial-time brute force solution of NP-complete problems. Here, we investigate the degree to which these two properties are connected. We examine four classes of deviations from quantum mechanics, for which we draw inspiration from the literature on the black hole information paradox. We show that in these models, the physical resources required to send a superluminal signal scale polynomially with the resources needed to speed up Grover's algorithm. Hence the no-signaling principle is equivalent to the inability to solve NP-hard problems efficiently by brute force within the classes of theories analyzed.

Design and characterization of high-speed CMOS pseudo-LVDS transceivers

NASA Astrophysics Data System (ADS)

Kondratenko, S. V.

2016-02-01

High-speed transceiver for on-board systems of data collection and processing need to meet additional requirements, such as low power consumption and increased radiation hardness. It is therefore necessary to compare and search for alternative variants of transceivers on the physical layer, where high transfer speed is not achieved at the cost of a significant increase in power consumption or a limitation of transmission distance by the size of a printed circuit board. For on-board applications, it is also necessary to solve the problem of increasing the radiation hardness without going to expensive types of technology. In this paper, we studied some variants of implementation of pseudo-LVDS transceivers and analyzed their achievable quantitative characteristics. According to the results of calculations and analysis of the literature, specialized transceivers of this type, intended for the manufacture or manufactured according to the bulk CMOS technology processes in the range of 250-80 nm, can provide data speeds up to 6 Gbps at a specific power consumption of less than 4 mW/Gbps.

["The hard core". Science between politics and philosophy by Carl Friedrich von Weizsäcker and in the finalization theory].

PubMed

Krohn, Wolfgang

2014-01-01

In the Starnberg Max-Planck Institute one of the working groups was concerned with science as the formative condition--or "hard core"--of societal modernity, and with science as potential resource for solving social problems and addressing future goals. More precisely, the group intended to differentiate between phases in which scientific disciplines predominantly care for their own paradigmatic completion and those allowing their theoretical potential resonate with external needs. The conceptual model was coined "finalization in science". It soon provoked a heated controversy on the dangers of social control of science. The paper analyses Carl Friedrich von Weizsäcker's views on the relation between philosophy and policy of science including his interpretation of Thomas Kuhn and reconstructs the impact of his ideas on the finalization model. It finally reflects on the relationship between science development and change of consciousness in the context of scientific responsibility for (the use of) research outcomes.

Students’ difficulties in probabilistic problem-solving

NASA Astrophysics Data System (ADS)

Arum, D. P.; Kusmayadi, T. A.; Pramudya, I.

2018-03-01

There are many errors can be identified when students solving mathematics problems, particularly in solving the probabilistic problem. This present study aims to investigate students’ difficulties in solving the probabilistic problem. It focuses on analyzing and describing students errors during solving the problem. This research used the qualitative method with case study strategy. The subjects in this research involve ten students of 9th grade that were selected by purposive sampling. Data in this research involve students’ probabilistic problem-solving result and recorded interview regarding students’ difficulties in solving the problem. Those data were analyzed descriptively using Miles and Huberman steps. The results show that students have difficulties in solving the probabilistic problem and can be divided into three categories. First difficulties relate to students’ difficulties in understanding the probabilistic problem. Second, students’ difficulties in choosing and using appropriate strategies for solving the problem. Third, students’ difficulties with the computational process in solving the problem. Based on the result seems that students still have difficulties in solving the probabilistic problem. It means that students have not able to use their knowledge and ability for responding probabilistic problem yet. Therefore, it is important for mathematics teachers to plan probabilistic learning which could optimize students probabilistic thinking ability.

A learning approach to the bandwidth multicolouring problem

NASA Astrophysics Data System (ADS)

Akbari Torkestani, Javad

2016-05-01

In this article, a generalisation of the vertex colouring problem known as bandwidth multicolouring problem (BMCP), in which a set of colours is assigned to each vertex such that the difference between the colours, assigned to each vertex and its neighbours, is by no means less than a predefined threshold, is considered. It is shown that the proposed method can be applied to solve the bandwidth colouring problem (BCP) as well. BMCP is known to be NP-hard in graph theory, and so a large number of approximation solutions, as well as exact algorithms, have been proposed to solve it. In this article, two learning automata-based approximation algorithms are proposed for estimating a near-optimal solution to the BMCP. We show, for the first proposed algorithm, that by choosing a proper learning rate, the algorithm finds the optimal solution with a probability close enough to unity. Moreover, we compute the worst-case time complexity of the first algorithm for finding a 1/(1-ɛ) optimal solution to the given problem. The main advantage of this method is that a trade-off between the running time of algorithm and the colour set size (colouring optimality) can be made, by a proper choice of the learning rate also. Finally, it is shown that the running time of the proposed algorithm is independent of the graph size, and so it is a scalable algorithm for large graphs. The second proposed algorithm is compared with some well-known colouring algorithms and the results show the efficiency of the proposed algorithm in terms of the colour set size and running time of algorithm.

Development of a problem solving evaluation instrument; untangling of specific problem solving assets

NASA Astrophysics Data System (ADS)

Adams, Wendy Kristine

The purpose of my research was to produce a problem solving evaluation tool for physics. To do this it was necessary to gain a thorough understanding of how students solve problems. Although physics educators highly value problem solving and have put extensive effort into understanding successful problem solving, there is currently no efficient way to evaluate problem solving skill. Attempts have been made in the past; however, knowledge of the principles required to solve the subject problem are so absolutely critical that they completely overshadow any other skills students may use when solving a problem. The work presented here is unique because the evaluation tool removes the requirement that the student already have a grasp of physics concepts. It is also unique because I picked a wide range of people and picked a wide range of tasks for evaluation. This is an important design feature that helps make things emerge more clearly. This dissertation includes an extensive literature review of problem solving in physics, math, education and cognitive science as well as descriptions of studies involving student use of interactive computer simulations, the design and validation of a beliefs about physics survey and finally the design of the problem solving evaluation tool. I have successfully developed and validated a problem solving evaluation tool that identifies 44 separate assets (skills) necessary for solving problems. Rigorous validation studies, including work with an independent interviewer, show these assets identified by this content-free evaluation tool are the same assets that students use to solve problems in mechanics and quantum mechanics. Understanding this set of component assets will help teachers and researchers address problem solving within the classroom.

Age differences in everyday problem-solving effectiveness: older adults select more effective strategies for interpersonal problems.

PubMed

Blanchard-Fields, Fredda; Mienaltowski, Andrew; Seay, Renee Baldi

2007-01-01

Using the Everyday Problem Solving Inventory of Cornelius and Caspi, we examined differences in problem-solving strategy endorsement and effectiveness in two domains of everyday functioning (instrumental or interpersonal, and a mixture of the two domains) and for four strategies (avoidance-denial, passive dependence, planful problem solving, and cognitive analysis). Consistent with past research, our research showed that older adults were more problem focused than young adults in their approach to solving instrumental problems, whereas older adults selected more avoidant-denial strategies than young adults when solving interpersonal problems. Overall, older adults were also more effective than young adults when solving everyday problems, in particular for interpersonal problems.

Spontaneous gestures influence strategy choices in problem solving.

PubMed

Alibali, Martha W; Spencer, Robert C; Knox, Lucy; Kita, Sotaro

2011-09-01

Do gestures merely reflect problem-solving processes, or do they play a functional role in problem solving? We hypothesized that gestures highlight and structure perceptual-motor information, and thereby make such information more likely to be used in problem solving. Participants in two experiments solved problems requiring the prediction of gear movement, either with gesture allowed or with gesture prohibited. Such problems can be correctly solved using either a perceptual-motor strategy (simulation of gear movements) or an abstract strategy (the parity strategy). Participants in the gesture-allowed condition were more likely to use perceptual-motor strategies than were participants in the gesture-prohibited condition. Gesture promoted use of perceptual-motor strategies both for participants who talked aloud while solving the problems (Experiment 1) and for participants who solved the problems silently (Experiment 2). Thus, spontaneous gestures influence strategy choices in problem solving.

Too upset to think: the interplay of borderline personality features, negative emotions, and social problem solving in the laboratory.

PubMed

Dixon-Gordon, Katherine L; Chapman, Alexander L; Lovasz, Nathalie; Walters, Kris

2011-10-01

Borderline personality disorder (BPD) is associated with poor social problem solving and problems with emotion regulation. In this study, the social problem-solving performance of undergraduates with high (n = 26), mid (n = 32), or low (n = 29) levels of BPD features was assessed with the Social Problem-Solving Inventory-Revised and using the means-ends problem-solving procedure before and after a social rejection stressor. The high-BP group, but not the low-BP group, showed a significant reduction in relevant solutions to social problems and more inappropriate solutions following the negative emotion induction. Increases in self-reported negative emotions during the emotion induction mediated the relationship between BP features and reductions in social problem-solving performance. In addition, the high-BP group demonstrated trait deficits in social problem solving on the Social Problem-Solving Inventory-Revised. These findings suggest that future research must examine social problem solving under differing emotional conditions, and that clinical interventions to improve social problem solving among persons with BP features should focus on responses to emotional contexts.

An Investigation of Secondary Teachers’ Understanding and Belief on Mathematical Problem Solving

NASA Astrophysics Data System (ADS)

Yuli Eko Siswono, Tatag; Wachidul Kohar, Ahmad; Kurniasari, Ika; Puji Astuti, Yuliani

2016-02-01

Weaknesses on problem solving of Indonesian students as reported by recent international surveys give rise to questions on how Indonesian teachers bring out idea of problem solving in mathematics lesson. An explorative study was undertaken to investigate how secondary teachers who teach mathematics at junior high school level understand and show belief toward mathematical problem solving. Participants were teachers from four cities in East Java province comprising 45 state teachers and 25 private teachers. Data was obtained through questionnaires and written test. The results of this study point out that the teachers understand pedagogical problem solving knowledge well as indicated by high score of observed teachers‘ responses showing understanding on problem solving as instruction as well as implementation of problem solving in teaching practice. However, they less understand on problem solving content knowledge such as problem solving strategies and meaning of problem itself. Regarding teacher's difficulties, teachers admitted to most frequently fail in (1) determining a precise mathematical model or strategies when carrying out problem solving steps which is supported by data of test result that revealed transformation error as the most frequently observed errors in teachers’ work and (2) choosing suitable real situation when designing context-based problem solving task. Meanwhile, analysis of teacher's beliefs on problem solving shows that teachers tend to view both mathematics and how students should learn mathematics as body static perspective, while they tend to believe to apply idea of problem solving as dynamic approach when teaching mathematics.

The Impact of Teacher Training on Creative Writing and Problem-Solving Using Futuristic Scenarios for Creative Problem Solving and Creative Problem Solving Programs

ERIC Educational Resources Information Center

Hayel Al-Srour, Nadia; Al-Ali, Safa M.; Al-Oweidi, Alia

2016-01-01

The present study aims to detect the impact of teacher training on creative writing and problem-solving using both Futuristic scenarios program to solve problems creatively, and creative problem solving. To achieve the objectives of the study, the sample was divided into two groups, the first consist of 20 teachers, and 23 teachers to second…

HFEM3D

DOE Office of Scientific and Technical Information (OSTI.GOV)

Weiss, Chester J

Software solves the three-dimensional Poisson equation div(k(grad(u)) = f, by the finite element method for the case when material properties, k, are distributed over hierarchy of edges, facets and tetrahedra in the finite element mesh. Method is described in Weiss, CJ, Finite element analysis for model parameters distributed on a hierarchy of geometric simplices, Geophysics, v82, E155-167, doi:10.1190/GEO2017-0058.1 (2017). A standard finite element method for solving Poisson’s equation is augmented by including in the 3D stiffness matrix additional 2D and 1D stiffness matrices representing the contributions from material properties associated with mesh faces and edges, respectively. The resulting linear systemmore » is solved iteratively using the conjugate gradient method with Jacobi preconditioning. To minimize computer storage for program execution, the linear solver computes matrix-vector contractions element-by-element over the mesh, without explicit storage of the global stiffness matrix. Program output vtk compliant for visualization and rendering by 3rd party software. Program uses dynamic memory allocation and as such there are no hard limits on problem size outside of those imposed by the operating system and configuration on which the software is run. Dimension, N, of the finite element solution vector is constrained by the the addressable space in 32-vs-64 bit operating systems. Total storage requirements for the problem. Total working space required for the program is approximately 13*N double precision words.« less

Problem-solving skills in high school biology: The effectiveness of the IMMEX problem-solving assessment software

NASA Astrophysics Data System (ADS)

Palacio-Cayetano, Joycelin

"Problem-solving through reflective thinking should be both the method and valuable outcome of science instruction in America's schools" proclaimed John Dewey (Gabel, 1995). If the development of problem-solving is a primary goal of science education, more problem-solving opportunities must be an integral part of K-16 education. To examine the effective use of technology in developing and assessing problem-solving skills, a problem-solving authoring, learning, and assessment software, the UCLA IMMEX Program-Interactive Multimedia Exercises-was investigated. This study was a twenty-week quasi-experimental study that was implemented as a control-group time series design among 120 tenth grade students. Both the experimental group (n = 60) and the control group (n = 60) participated in a problem-based learning curriculum; however, the experimental group received regular intensive experiences with IMMEX problem-solving and the control group did not. Problem-solving pretest and posttest were administered to all students. The instruments used were a 35-item Processes of Biological Inquiry Test and an IMMEX problem-solving assessment test, True Roots. Students who participated in the IMMEX Program achieved significant (p <.05) gains in problem-solving skills on both problem-solving assessment instruments. This study provided evidence that IMMEX software is highly efficient in evaluating salient elements of problem-solving. Outputs of students' problem-solving strategies revealed that unsuccessful problem solvers primarily used the following four strategies: (1) no data search strategy, students simply guessed; (2) limited data search strategy leading to insufficient data and premature closing; (3) irrelevant data search strategy, students focus in areas bearing no substantive data; and (4) extensive data search strategy with inadequate integration and analysis. On the contrary, successful problem solvers used the following strategies; (1) focused search strategy coupled with the ability to fill in knowledge gaps by accessing the appropriate resources; (2) targeted search strategy coupled with high level of analytical and integration skills; and (3) focused search strategy coupled with superior discrimination, analytical, and integration skills. The strategies of students who were successful and unsuccessful solving IMMEX problems were consistent with those of expert and novice problem solvers identified in the literature on problem-solving.

Pre-Service Class Teacher' Ability in Solving Mathematical Problems and Skills in Solving Daily Problems

ERIC Educational Resources Information Center

Aljaberi, Nahil M.; Gheith, Eman

2016-01-01

This study aims to investigate the ability of pre-service class teacher at University of Petrain solving mathematical problems using Polya's Techniques, their level of problem solving skills in daily-life issues. The study also investigates the correlation between their ability to solve mathematical problems and their level of problem solving…

The Association between Motivation, Affect, and Self-regulated Learning When Solving Problems.

PubMed

Baars, Martine; Wijnia, Lisette; Paas, Fred

2017-01-01

Self-regulated learning (SRL) skills are essential for learning during school years, particularly in complex problem-solving domains, such as biology and math. Although a lot of studies have focused on the cognitive resources that are needed for learning to solve problems in a self-regulated way, affective and motivational resources have received much less research attention. The current study investigated the relation between affect (i.e., Positive Affect and Negative Affect Scale), motivation (i.e., autonomous and controlled motivation), mental effort, SRL skills, and problem-solving performance when learning to solve biology problems in a self-regulated online learning environment. In the learning phase, secondary education students studied video-modeling examples of how to solve hereditary problems, solved hereditary problems which they chose themselves from a set of problems with different complexity levels (i.e., five levels). In the posttest, students solved hereditary problems, self-assessed their performance, and chose a next problem from the set of problems but did not solve these problems. The results from this study showed that negative affect, inaccurate self-assessments during the posttest, and higher perceptions of mental effort during the posttest were negatively associated with problem-solving performance after learning in a self-regulated way.

Quadratic constrained mixed discrete optimization with an adiabatic quantum optimizer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh; Jacobson, N. Tobias; Moussa, Jonathan E.; Frankel, Steven H.; Kais, Sabre

2014-07-01

We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic constrained mixed discrete optimization (QCMDO) problem. QCMDO problems are NP-hard, and no efficient classical algorithm for their solution is known. Included in the class of QCMDO problems are combinatorial optimization problems constrained by a linear partial differential equation (PDE) or system of linear PDEs. An essential complication commonly encountered in solving this type of problem is that the linear constraint may introduce many intermediate continuous variables into the optimization while the computational cost grows exponentially with problem size. We resolve this difficulty by developing a constructive mapping from QCMDO to quadratic unconstrained binary optimization (QUBO) such that the size of the QUBO problem depends only on the number of discrete control variables. With a suitable embedding, taking into account the physical constraints of the realizable coupling graph, the resulting QUBO problem can be implemented on an existing AQO. The mapping itself is efficient, scaling cubically with the number of continuous variables in the general case and linearly in the PDE case if an efficient preconditioner is available.

Research on Protective Coating on Inner Surface of Alloy Tube

NASA Astrophysics Data System (ADS)

Zhang, Y. C.; Liu, Y. H.; Zhou, Z. J.; Zheng, M. M.; Kong, S. Y.; Xia, H. H.; Li, H. L.

2017-09-01

Materials are one of the most important factors which limit reactor development. Molten salt not only used as the coolant but used as application in which fissile materials and fission products are dissolved in Molten Salt Reactors (MSRs). Therefore the corrosion resistance of structure materials is the one of most important aspects for application in MSRs. Compatibility and chemical stability with the molten salt should be considered for some common structural alloys such as Incoloy-800H. In this research, the pure nickel coating was obtained by electroplating on the inner surface of nickel alloy to improve the corrosion resistance. However, there are some problems for plating on the inner surface of tube. For example the current is shielded and the anode is easy to passivate. The inner anode was used for solving these problems in this study. Pure nickel coating was obtain and the microstructure and properties of coating were analysed using this method. The thickness, hardness and microstructure of coating were observed by metallographic microscope, micro hardness tester and field emission scanning electron microscope, and the influence of deposition duration and annealing treatment duration on properties were analysed. Thermal shock performance was investigated as well. The results showed that the coating thickness increased linearly with the increasing of plating durations and the size of grain increased with the durations as well, the surface of coating became inhomogeneous correspondingly. The hardness of coating changed as the change of durations of annealing treatment. The thermal shock test showed that bonding strength of coating with substrate was good.

Extraction of a group-pair relation: problem-solving relation from web-board documents.

PubMed

Pechsiri, Chaveevan; Piriyakul, Rapepun

2016-01-01

This paper aims to extract a group-pair relation as a Problem-Solving relation, for example a DiseaseSymptom-Treatment relation and a CarProblem-Repair relation, between two event-explanation groups, a problem-concept group as a symptom/CarProblem-concept group and a solving-concept group as a treatment-concept/repair concept group from hospital-web-board and car-repair-guru-web-board documents. The Problem-Solving relation (particularly Symptom-Treatment relation) including the graphical representation benefits non-professional persons by supporting knowledge of primarily solving problems. The research contains three problems: how to identify an EDU (an Elementary Discourse Unit, which is a simple sentence) with the event concept of either a problem or a solution; how to determine a problem-concept EDU boundary and a solving-concept EDU boundary as two event-explanation groups, and how to determine the Problem-Solving relation between these two event-explanation groups. Therefore, we apply word co-occurrence to identify a problem-concept EDU and a solving-concept EDU, and machine-learning techniques to solve a problem-concept EDU boundary and a solving-concept EDU boundary. We propose using k-mean and Naïve Bayes to determine the Problem-Solving relation between the two event-explanation groups involved with clustering features. In contrast to previous works, the proposed approach enables group-pair relation extraction with high accuracy.

Students’ Mathematical Problem-Solving Abilities Through The Application of Learning Models Problem Based Learning

NASA Astrophysics Data System (ADS)

Nasution, M. L.; Yerizon, Y.; Gusmiyanti, R.

2018-04-01

One of the purpose mathematic learning is to develop problem solving abilities. Problem solving is obtained through experience in questioning non-routine. Improving students’ mathematical problem-solving abilities required an appropriate strategy in learning activities one of them is models problem based learning (PBL). Thus, the purpose of this research is to determine whether the problem solving abilities of mathematical students’ who learn to use PBL better than on the ability of students’ mathematical problem solving by applying conventional learning. This research included quasi experiment with static group design and population is students class XI MIA SMAN 1 Lubuk Alung. Class experiment in the class XI MIA 5 and class control in the class XI MIA 6. The instrument of final test students’ mathematical problem solving used essay form. The result of data final test in analyzed with t-test. The result is students’ mathematical problem solving abilities with PBL better then on the ability of students’ mathematical problem solving by applying conventional learning. It’s seen from the high percentage achieved by the group of students who learn to use PBL for each indicator of students’ mathematical problem solving.

Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.

PubMed

Hüffner, Falk; Komusiewicz, Christian; Niedermeier, Rolf; Wernicke, Sebastian

2017-01-01

Fixed-parameter algorithms are designed to efficiently find optimal solutions to some computationally hard (NP-hard) problems by identifying and exploiting "small" problem-specific parameters. We survey practical techniques to develop such algorithms. Each technique is introduced and supported by case studies of applications to biological problems, with additional pointers to experimental results.

Using a general problem-solving strategy to promote transfer.

PubMed

Youssef-Shalala, Amina; Ayres, Paul; Schubert, Carina; Sweller, John

2014-09-01

Cognitive load theory was used to hypothesize that a general problem-solving strategy based on a make-as-many-moves-as-possible heuristic could facilitate problem solutions for transfer problems. In four experiments, school students were required to learn about a topic through practice with a general problem-solving strategy, through a conventional problem solving strategy or by studying worked examples. In Experiments 1 and 2 using junior high school students learning geometry, low knowledge students in the general problem-solving group scored significantly higher on near or far transfer tests than the conventional problem-solving group. In Experiment 3, an advantage for a general problem-solving group over a group presented worked examples was obtained on far transfer tests using the same curriculum materials, again presented to junior high school students. No differences between conditions were found in Experiments 1, 2, or 3 using test problems similar to the acquisition problems. Experiment 4 used senior high school students studying economics and found the general problem-solving group scored significantly higher than the conventional problem-solving group on both similar and transfer tests. It was concluded that the general problem-solving strategy was helpful for novices, but not for students that had access to domain-specific knowledge. PsycINFO Database Record (c) 2014 APA, all rights reserved.

Revising explanatory models to accommodate anomalous genetic phenomena: Problem solving in the context of discovery

NASA Astrophysics Data System (ADS)

Hafner, Robert; Stewart, Jim

Past problem-solving research has provided a basis for helping students structure their knowledge and apply appropriate problem-solving strategies to solve problems for which their knowledge (or mental models) of scientific phenomena is adequate (model-using problem solving). This research examines how problem solving in the domain of Mendelian genetics proceeds in situations where solvers' mental models are insufficient to solve problems at hand (model-revising problem solving). Such situations require solvers to use existing models to recognize anomalous data and to revise those models to accommodate the data. The study was conducted in the context of 9-week high school genetics course and addressed: the heuristics charactenstic of successful model-revising problem solving: the nature of the model revisions, made by students as well as the nature of model development across problem types; and the basis upon which solvers decide that a revised model is sufficient (that t has both predictive and explanatory power).

Parent-Teacher Communication about Children with Autism Spectrum Disorder: An Examination of Collaborative Problem-Solving

PubMed Central

Azad, Gazi F.; Kim, Mina; Marcus, Steven C.; Mandell, David S.; Sheridan, Susan M.

2016-01-01

Effective parent-teacher communication involves problem-solving concerns about students. Few studies have examined problem solving interactions between parents and teachers of children with autism spectrum disorder (ASD), with a particular focus on identifying communication barriers and strategies for improving them. This study examined the problem-solving behaviors of parents and teachers of children with ASD. Participants included 18 teachers and 39 parents of children with ASD. Parent-teacher dyads were prompted to discuss and provide a solution for a problem that a student experienced at home and at school. Parents and teachers also reported on their problem-solving behaviors. Results showed that parents and teachers displayed limited use of the core elements of problem-solving. Teachers displayed more problem-solving behaviors than parents. Both groups reported engaging in more problem-solving behaviors than they were observed to display during their discussions. Our findings suggest that teacher and parent training programs should include collaborative approaches to problem-solving. PMID:28392604

Parent-Teacher Communication about Children with Autism Spectrum Disorder: An Examination of Collaborative Problem-Solving.

PubMed

Azad, Gazi F; Kim, Mina; Marcus, Steven C; Mandell, David S; Sheridan, Susan M

2016-12-01

Effective parent-teacher communication involves problem-solving concerns about students. Few studies have examined problem solving interactions between parents and teachers of children with autism spectrum disorder (ASD), with a particular focus on identifying communication barriers and strategies for improving them. This study examined the problem-solving behaviors of parents and teachers of children with ASD. Participants included 18 teachers and 39 parents of children with ASD. Parent-teacher dyads were prompted to discuss and provide a solution for a problem that a student experienced at home and at school. Parents and teachers also reported on their problem-solving behaviors. Results showed that parents and teachers displayed limited use of the core elements of problem-solving. Teachers displayed more problem-solving behaviors than parents. Both groups reported engaging in more problem-solving behaviors than they were observed to display during their discussions. Our findings suggest that teacher and parent training programs should include collaborative approaches to problem-solving.

Errors analysis of problem solving using the Newman stage after applying cooperative learning of TTW type

NASA Astrophysics Data System (ADS)

Rr Chusnul, C.; Mardiyana, S., Dewi Retno

2017-12-01

Problem solving is the basis of mathematics learning. Problem solving teaches us to clarify an issue coherently in order to avoid misunderstanding information. Sometimes there may be mistakes in problem solving due to misunderstanding the issue, choosing a wrong concept or misapplied concept. The problem-solving test was carried out after students were given treatment on learning by using cooperative learning of TTW type. The purpose of this study was to elucidate student problem regarding to problem solving errors after learning by using cooperative learning of TTW type. Newman stages were used to identify problem solving errors in this study. The new research used a descriptive method to find out problem solving errors in students. The subject in this study were students of Vocational Senior High School (SMK) in 10th grade. Test and interview was conducted for data collection. Thus, the results of this study suggested problem solving errors in students after learning by using cooperative learning of TTW type for Newman stages.

Rejection Sensitivity and Depression: Indirect Effects Through Problem Solving.

PubMed

Kraines, Morganne A; Wells, Tony T

2017-01-01

Rejection sensitivity (RS) and deficits in social problem solving are risk factors for depression. Despite their relationship to depression and the potential connection between them, no studies have examined RS and social problem solving together in the context of depression. As such, we examined RS, five facets of social problem solving, and symptoms of depression in a young adult sample. A total of 180 participants completed measures of RS, social problem solving, and depressive symptoms. We used bootstrapping to examine the indirect effect of RS on depressive symptoms through problem solving. RS was positively associated with depressive symptoms. A negative problem orientation, impulsive/careless style, and avoidance style of social problem solving were positively associated with depressive symptoms, and a positive problem orientation was negatively associated with depressive symptoms. RS demonstrated an indirect effect on depressive symptoms through two social problem-solving facets: the tendency to view problems as threats to one's well-being and an avoidance problem-solving style characterized by procrastination, passivity, or overdependence on others. These results are consistent with prior research that found a positive association between RS and depression symptoms, but this is the first study to implicate specific problem-solving deficits in the relationship between RS and depression. Our results suggest that depressive symptoms in high RS individuals may result from viewing problems as threats and taking an avoidant, rather than proactive, approach to dealing with problems. These findings may have implications for problem-solving interventions for rejection sensitive individuals.

The Cyclic Nature of Problem Solving: An Emergent Multidimensional Problem-Solving Framework

ERIC Educational Resources Information Center

Carlson, Marilyn P.; Bloom, Irene

2005-01-01

This paper describes the problem-solving behaviors of 12 mathematicians as they completed four mathematical tasks. The emergent problem-solving framework draws on the large body of research, as grounded by and modified in response to our close observations of these mathematicians. The resulting "Multidimensional Problem-Solving Framework" has four…

Mathematical Problem Solving: A Review of the Literature.

ERIC Educational Resources Information Center

Funkhouser, Charles

The major perspectives on problem solving of the twentieth century are reviewed--associationism, Gestalt psychology, and cognitive science. The results of the review on teaching problem solving and the uses of computers to teach problem solving are included. Four major issues related to the teaching of problem solving are discussed: (1)…

Teaching Problem Solving Skills to Elementary Age Students with Autism

ERIC Educational Resources Information Center

Cote, Debra L.; Jones, Vita L.; Barnett, Crystal; Pavelek, Karin; Nguyen, Hoang; Sparks, Shannon L.

2014-01-01

Students with disabilities need problem-solving skills to promote their success in solving the problems of daily life. The research into problem-solving instruction has been limited for students with autism. Using a problem-solving intervention and the Self Determined Learning Model of Instruction, three elementary age students with autism were…

Quantum proofs can be verified using only single-qubit measurements

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki; Nagaj, Daniel; Schuch, Norbert

2016-02-01

Quantum Merlin Arthur (QMA) is the class of problems which, though potentially hard to solve, have a quantum solution that can be verified efficiently using a quantum computer. It thus forms a natural quantum version of the classical complexity class NP (and its probabilistic variant MA, Merlin-Arthur games), where the verifier has only classical computational resources. In this paper, we study what happens when we restrict the quantum resources of the verifier to the bare minimum: individual measurements on single qubits received as they come, one by one. We find that despite this grave restriction, it is still possible to soundly verify any problem in QMA for the verifier with the minimum quantum resources possible, without using any quantum memory or multiqubit operations. We provide two independent proofs of this fact, based on measurement-based quantum computation and the local Hamiltonian problem. The former construction also applies to QMA1, i.e., QMA with one-sided error.

REVIEWS OF TOPICAL PROBLEMS: Concept of consciousness in the context of quantum mechanics

NASA Astrophysics Data System (ADS)

Menskii, Mikhail B.

2005-04-01

Conceptual problems of the quantum theory of measurement are considered, which are embodied in well-known paradoxes and in Bell's inequalities. Arguments are advanced in favor of the viewpoint that these problems may hardly be solved without direct inclusion of the observer's consciousness in the theoretical description of a quantum measurement. Discussed in this connection is the so-called many-worlds interpretation of quantum mechanics proposed by Everett, as is the extension of Everett's concept, which consists in the assumption that separating the quantum state components corresponding to alternative measurements is not only associated with the observer's consciousness but is completely identified with it. This approach is shown to open up qualitatively new avenues for the unification of physics and psychology and, more broadly, of the sciences and the humanities. This may lead to an extension of the theory of consciousness and shed light on significant and previously misunderstood phenomena in the sphere of consciousness.

Learning problem-solving skills in a distance education physics course

NASA Astrophysics Data System (ADS)

Rampho, G. J.; Ramorola, M. Z.

2017-10-01

In this paper we present the results of a study on the effectiveness of combinations of delivery modes of distance education in learning problem-solving skills in a distance education introductory physics course. A problem-solving instruction with the explicit teaching of a problem-solving strategy and worked-out examples were implemented in the course. The study used the ex post facto research design with stratified sampling to investigate the effect of the learning of a problem-solving strategy on the problem-solving performance. The number of problems attempted and the mean frequency of using a strategy in solving problems in the three course presentation modes were compared. The finding of the study indicated that combining the different course presentation modes had no statistically significant effect in the learning of problem-solving skills in the distance education course.

The Association between Motivation, Affect, and Self-regulated Learning When Solving Problems

PubMed Central

Baars, Martine; Wijnia, Lisette; Paas, Fred

2017-01-01

Self-regulated learning (SRL) skills are essential for learning during school years, particularly in complex problem-solving domains, such as biology and math. Although a lot of studies have focused on the cognitive resources that are needed for learning to solve problems in a self-regulated way, affective and motivational resources have received much less research attention. The current study investigated the relation between affect (i.e., Positive Affect and Negative Affect Scale), motivation (i.e., autonomous and controlled motivation), mental effort, SRL skills, and problem-solving performance when learning to solve biology problems in a self-regulated online learning environment. In the learning phase, secondary education students studied video-modeling examples of how to solve hereditary problems, solved hereditary problems which they chose themselves from a set of problems with different complexity levels (i.e., five levels). In the posttest, students solved hereditary problems, self-assessed their performance, and chose a next problem from the set of problems but did not solve these problems. The results from this study showed that negative affect, inaccurate self-assessments during the posttest, and higher perceptions of mental effort during the posttest were negatively associated with problem-solving performance after learning in a self-regulated way. PMID:28848467

Evaluating clustering methods within the Artificial Ecosystem Algorithm and their application to bike redistribution in London.

PubMed

Adham, Manal T; Bentley, Peter J

2016-08-01

This paper proposes and evaluates a solution to the truck redistribution problem prominent in London's Santander Cycle scheme. Due to the complexity of this NP-hard combinatorial optimisation problem, no efficient optimisation techniques are known to solve the problem exactly. This motivates our use of the heuristic Artificial Ecosystem Algorithm (AEA) to find good solutions in a reasonable amount of time. The AEA is designed to take advantage of highly distributed computer architectures and adapt to changing problems. In the AEA a problem is first decomposed into its relative sub-components; they then evolve solution building blocks that fit together to form a single optimal solution. Three variants of the AEA centred on evaluating clustering methods are presented: the baseline AEA, the community-based AEA which groups stations according to journey flows, and the Adaptive AEA which actively modifies clusters to cater for changes in demand. We applied these AEA variants to the redistribution problem prominent in bike share schemes (BSS). The AEA variants are empirically evaluated using historical data from Santander Cycles to validate the proposed approach and prove its potential effectiveness. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

An experience sampling study of learning, affect, and the demands control support model.

PubMed

Daniels, Kevin; Boocock, Grahame; Glover, Jane; Holland, Julie; Hartley, Ruth

2009-07-01

The demands control support model (R. A. Karasek & T. Theorell, 1990) indicates that job control and social support enable workers to engage in problem solving. In turn, problem solving is thought to influence learning and well-being (e.g., anxious affect, activated pleasant affect). Two samples (N = 78, N = 106) provided data up to 4 times per day for up to 5 working days. The extent to which job control was used for problem solving was assessed by measuring the extent to which participants changed aspects of their work activities to solve problems. The extent to which social support was used to solve problems was assessed by measuring the extent to which participants discussed problems to solve problems. Learning mediated the relationship between changing aspects of work activities to solve problems and activated pleasant affect. Learning also mediated the relationship between discussing problems to solve problems and activated pleasant affect. The findings indicated that how individuals use control and support to respond to problem-solving demands is associated with organizational and individual phenomena, such as learning and affective well-being.

What Does (and Doesn't) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective

ERIC Educational Resources Information Center

Wareham, Todd; Evans, Patricia; van Rooij, Iris

2011-01-01

Solving new problems can be made easier if one can build on experiences with other problems one has already successfully solved. The ability to exploit earlier problem-solving experiences in solving new problems seems to require several cognitive sub-abilities. Minimally, one needs to be able to retrieve relevant knowledge of earlier solved…

Synthesizing Huber's Problem Solving and Kolb's Learning Cycle: A Balanced Approach to Technical Problem Solving

ERIC Educational Resources Information Center

Kamis, Arnold; Khan, Beverly K.

2009-01-01

How do we model and improve technical problem solving, such as network subnetting? This paper reports an experimental study that tested several hypotheses derived from Kolb's experiential learning cycle and Huber's problem solving model. As subjects solved a network subnetting problem, they mapped their mental processes according to Huber's…

Generalization of Social Skills: Strategies and Results of a Training Program in Problem Solving Skills.

ERIC Educational Resources Information Center

Paraschiv, Irina; Olley, J. Gregory

This paper describes the "Problem Solving for Life" training program which trains adolescents and adults with mental retardation in skills for solving social problems. The program requires group participants to solve social problems by practicing two prerequisite skills (relaxation and positive self-statements) and four problem solving steps: (1)…

Young Children's Analogical Problem Solving: Gaining Insights from Video Displays

ERIC Educational Resources Information Center

Chen, Zhe; Siegler, Robert S.

2013-01-01

This study examined how toddlers gain insights from source video displays and use the insights to solve analogous problems. Two- to 2.5-year-olds viewed a source video illustrating a problem-solving strategy and then attempted to solve analogous problems. Older but not younger toddlers extracted the problem-solving strategy depicted in the video…

Investigating Problem-Solving Perseverance Using Lesson Study

ERIC Educational Resources Information Center

Bieda, Kristen N.; Huhn, Craig

2017-01-01

Problem solving has long been a focus of research and curriculum reform (Kilpatrick 1985; Lester 1994; NCTM 1989, 2000; CCSSI 2010). The importance of problem solving is not new, but the Common Core introduced the idea of making sense of problems and persevering in solving them (CCSSI 2010, p. 6) as an aspect of problem solving. Perseverance is…

Problem-solving deficits in Iranian people with borderline personality disorder.

PubMed

Akbari Dehaghi, Ashraf; Kaviani, Hossein; Tamanaeefar, Shima

2014-01-01

Interventions for people suffering from borderline personality disorder (BPD), such as dialectical behavior therapy, often include a problem-solving component. However, there is an absence of published studies examining the problem-solving abilities of this client group in Iran. The study compared inpatients and outpatients with BPD and a control group on problem-solving capabilities in an Iranian sample. It was hypothesized that patients with BPD would have more deficiencies in this area. Fifteen patients with BPD were compared to 15 healthy participants. Means-ends problem-solving task (MEPS) was used to measure problem-solving skills in both groups. BPD group reported less effective strategies in solving problems as opposed to the healthy group. Compared to the control group, participants with BPD provided empirical support for the use of problem-solving interventions with people suffering from BPD. The findings supported the idea that a problem-solving intervention can be efficiently applied either as a stand-alone therapy or in conjunction with other available psychotherapies to treat people with BPD.

Quantum Attack-Resistent Certificateless Multi-Receiver Signcryption Scheme

PubMed Central

Li, Huixian; Chen, Xubao; Pang, Liaojun; Shi, Weisong

2013-01-01

The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards. PMID:23967037

Impulsivity as a mediator in the relationship between problem solving and suicidal ideation.

PubMed

Gonzalez, Vivian M; Neander, Lucía L

2018-03-15

This study examined whether three facets of impulsivity previously shown to be associated with suicidal ideation and attempts (negative urgency, lack of premeditation, and lack of perseverance) help to account for the established association between problem solving deficits and suicidal ideation. Emerging adult college student drinkers with a history of at least passive suicidal ideation (N = 387) completed measures of problem solving, impulsivity, and suicidal ideation. A path analysis was conducted to examine the mediating role of impulsivity variables in the association between problem solving (rational problem solving, positive and negative problem orientation, and avoidance style) and suicidal ideation. Direct and indirect associations through impulsivity, particularly negative urgency, were found between problem solving and severity of suicidal ideation. Interventions aimed at teaching problem solving skills, as well as self-efficacy and optimism for solving life problems, may help to reduce impulsivity and suicidal ideation. © 2018 Wiley Periodicals, Inc.

Interpersonal Functioning Among Treatment-Seeking Trans Individuals.

PubMed

Davey, Amanda; Bouman, Walter Pierre; Meyer, Caroline; Arcelus, Jon

2015-12-01

Trans people have been found to have high levels of depression. In view of the association between interpersonal problems and depression and the importance of interpersonal skills to navigate the transition of trans people, this study aims to investigate the levels of interpersonal problems among treatment-seeking trans men and women and the role of depression in this association. A total of 104 patients from a UK gender identity clinic and 104 age- and gender-matched control participants completed self-report measures of interpersonal problems and general psychopathology, including depression. Trans people reported significantly higher scores on global interpersonal problems and on the Inventory of Interpersonal Problems-32 (IIP-32) Hard to be Sociable, Hard to be Supportive, and Hard to be Involved subscales and lower scores on the Too Open subscale. Depression accounted for significant differences on IIP-32 global and the Too Open subscale but not on Hard to be Sociable, Hard to be Supportive, and Hard to be Involved subscales. Trans individuals present with interpersonal problems, which could potentially increase their vulnerability to mental health problems. Therefore, addressing interpersonal problems may help to prevent the development of depressive symptomatology and facilitate transition. © 2015 Wiley Periodicals, Inc.

Improving mathematical problem solving skills through visual media

NASA Astrophysics Data System (ADS)

Widodo, S. A.; Darhim; Ikhwanudin, T.

2018-01-01

The purpose of this article was to find out the enhancement of students’ mathematical problem solving by using visual learning media. The ability to solve mathematical problems is the ability possessed by students to solve problems encountered, one of the problem-solving model of Polya. This preliminary study was not to make a model, but it only took a conceptual approach by comparing the various literature of problem-solving skills by linking visual learning media. The results of the study indicated that the use of learning media had not been appropriated so that the ability to solve mathematical problems was not optimal. The inappropriateness of media use was due to the instructional media that was not adapted to the characteristics of the learners. Suggestions that can be given is the need to develop visual media to increase the ability to solve problems.

Sparsest representations and approximations of an underdetermined linear system

NASA Astrophysics Data System (ADS)

Tardivel, Patrick J. C.; Servien, Rémi; Concordet, Didier

2018-05-01

In an underdetermined linear system of equations, constrained l 1 minimization methods such as the basis pursuit or the lasso are often used to recover one of the sparsest representations or approximations of the system. The null space property is a sufficient and ‘almost’ necessary condition to recover a sparsest representation with the basis pursuit. Unfortunately, this property cannot be easily checked. On the other hand, the mutual coherence is an easily checkable sufficient condition insuring the basis pursuit to recover one of the sparsest representations. Because the mutual coherence condition is too strong, it is hardly met in practice. Even if one of these conditions holds, to our knowledge, there is no theoretical result insuring that the lasso solution is one of the sparsest approximations. In this article, we study a novel constrained problem that gives, without any condition, one of the sparsest representations or approximations. To solve this problem, we provide a numerical method and we prove its convergence. Numerical experiments show that this approach gives better results than both the basis pursuit problem and the reweighted l 1 minimization problem.

Efficient RNA structure comparison algorithms.

PubMed

Arslan, Abdullah N; Anandan, Jithendar; Fry, Eric; Monschke, Keith; Ganneboina, Nitin; Bowerman, Jason

2017-12-01

Recently proposed relative addressing-based ([Formula: see text]) RNA secondary structure representation has important features by which an RNA structure database can be stored into a suffix array. A fast substructure search algorithm has been proposed based on binary search on this suffix array. Using this substructure search algorithm, we present a fast algorithm that finds the largest common substructure of given multiple RNA structures in [Formula: see text] format. The multiple RNA structure comparison problem is NP-hard in its general formulation. We introduced a new problem for comparing multiple RNA structures. This problem has more strict similarity definition and objective, and we propose an algorithm that solves this problem efficiently. We also develop another comparison algorithm that iteratively calls this algorithm to locate nonoverlapping large common substructures in compared RNAs. With the new resulting tools, we improved the RNASSAC website (linked from http://faculty.tamuc.edu/aarslan ). This website now also includes two drawing tools: one specialized for preparing RNA substructures that can be used as input by the search tool, and another one for automatically drawing the entire RNA structure from a given structure sequence.

Sequential Test Strategies for Multiple Fault Isolation

NASA Technical Reports Server (NTRS)

Shakeri, M.; Pattipati, Krishna R.; Raghavan, V.; Patterson-Hine, Ann; Kell, T.

1997-01-01

In this paper, we consider the problem of constructing near optimal test sequencing algorithms for diagnosing multiple faults in redundant (fault-tolerant) systems. The computational complexity of solving the optimal multiple-fault isolation problem is super-exponential, that is, it is much more difficult than the single-fault isolation problem, which, by itself, is NP-hard. By employing concepts from information theory and Lagrangian relaxation, we present several static and dynamic (on-line or interactive) test sequencing algorithms for the multiple fault isolation problem that provide a trade-off between the degree of suboptimality and computational complexity. Furthermore, we present novel diagnostic strategies that generate a static diagnostic directed graph (digraph), instead of a static diagnostic tree, for multiple fault diagnosis. Using this approach, the storage complexity of the overall diagnostic strategy reduces substantially. Computational results based on real-world systems indicate that the size of a static multiple fault strategy is strictly related to the structure of the system, and that the use of an on-line multiple fault strategy can diagnose faults in systems with as many as 10,000 failure sources.

Problem based learning - A brief review

NASA Astrophysics Data System (ADS)

Nunes, Sandra; Oliveira, Teresa A.; Oliveira, Amílcar

2017-07-01

Teaching is a complex mission that requires not only the theoretical knowledge transmission, but furthermore requires to provide the students the necessary skills for solving real problems in their respective professional activities where complex issues and problems must be frequently faced. Over more than twenty years we have been experiencing an increase in scholar failure in the scientific area of mathematics, which means that Teaching Mathematics and related areas can be even a more complex and hard task. Scholar failure is a complex phenomenon that depends on various factors as social factors, scholar factors or biophysical factors. After numerous attempts made in order to reduce scholar failure our goal in this paper is to understand the role of "Problem Based Learning" and how this methodology can contribute to the solution of both: increasing mathematical courses success and increasing skills in the near future professionals in Portugal. Before designing a proposal for applying this technique in our institutions, we decided to conduct a survey to provide us with the necessary information about and the respective advantages and disadvantages of this methodology, so this is the brief review aim.

New optimization model for routing and spectrum assignment with nodes insecurity

NASA Astrophysics Data System (ADS)

Xuan, Hejun; Wang, Yuping; Xu, Zhanqi; Hao, Shanshan; Wang, Xiaoli

2017-04-01

By adopting the orthogonal frequency division multiplexing technology, elastic optical networks can provide the flexible and variable bandwidth allocation to each connection request and get higher spectrum utilization. The routing and spectrum assignment problem in elastic optical network is a well-known NP-hard problem. In addition, information security has received worldwide attention. We combine these two problems to investigate the routing and spectrum assignment problem with the guaranteed security in elastic optical network, and establish a new optimization model to minimize the maximum index of the used frequency slots, which is used to determine an optimal routing and spectrum assignment schemes. To solve the model effectively, a hybrid genetic algorithm framework integrating a heuristic algorithm into a genetic algorithm is proposed. The heuristic algorithm is first used to sort the connection requests and then the genetic algorithm is designed to look for an optimal routing and spectrum assignment scheme. In the genetic algorithm, tailor-made crossover, mutation and local search operators are designed. Moreover, simulation experiments are conducted with three heuristic strategies, and the experimental results indicate that the effectiveness of the proposed model and algorithm framework.

Computing Role Assignments of Proper Interval Graphs in Polynomial Time

NASA Astrophysics Data System (ADS)

Heggernes, Pinar; van't Hof, Pim; Paulusma, Daniël

A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-role assignment of G. Role assignments have applications in distributed computing, social network theory, and topological graph theory. The Role Assignment problem has as input a pair of graphs (G,R) and asks whether G has an R-role assignment. This problem is NP-complete already on input pairs (G,R) where R is a path on three vertices. So far, the only known non-trivial tractable case consists of input pairs (G,R) where G is a tree. We present a polynomial time algorithm that solves Role Assignment on all input pairs (G,R) where G is a proper interval graph. Thus we identify the first graph class other than trees on which the problem is tractable. As a complementary result, we show that the problem is Graph Isomorphism-hard on chordal graphs, a superclass of proper interval graphs and trees.

The Relationship between Students' Problem Posing and Problem Solving Abilities and Beliefs: A Small-Scale Study with Chinese Elementary School Children

ERIC Educational Resources Information Center

Limin, Chen; Van Dooren, Wim; Verschaffel, Lieven

2013-01-01

The goal of the present study is to investigate the relationship between pupils' problem posing and problem solving abilities, their beliefs about problem posing and problem solving, and their general mathematics abilities, in a Chinese context. Five instruments, i.e., a problem posing test, a problem solving test, a problem posing questionnaire,…

An Investigation of the Effects on Students' Attitudes, Beliefs, and Abilities in Problem Solving and Mathematics after One Year of a Systematic Approach to the Learning of Problem Solving.

ERIC Educational Resources Information Center

Higgins, Karen M.

This study investigated the effects of Oregon's Lane County "Problem Solving in Mathematics" (PSM) materials on middle-school students' attitudes, beliefs, and abilities in problem solving and mathematics. The instructional approach advocated in PSM includes: the direct teaching of five problem-solving skills, weekly challenge problems,…

Integral Equation Study of Molecular Fluids and Liquid Crystals in Two Dimensions

NASA Astrophysics Data System (ADS)

Ward, David Atlee

The Ornstein-Zernike (OZ) equation is solved with a Percus-Yevick (PY) closure for the hard ellipse and hard planar dumbell fluids in two dimensions. The correlation functions, including the orientation correlation function, are expanded in a set of orthogonal functions and the coefficients are solved for using an iterative algorithm developed by Lado. The pressure, compressibility, and orientation coefficients are computed for a variety of densities and molecular elongations. The hard planar dumbell fluid shows no orientational ordering. The PY values for the pressure differ from the corresponding Monte Carlo (MC) values by as much as 8% for the cases studied. The hard ellipse fluid exhibits some orientational ordering. Ordering is much more pronounced for ellipses with an axis ratio larger than 2.0. Pressure values computed for the hard ellipse fluid from the PY theory differ from the corresponding MC values by as much as 11% for the cases studied. As the PY solutions do exhibit a nematic character in the hard ellipse fluid, we find it to be a viable reference system for further studies of the nematic liquid crystal phase, though the isotropic-nematic (I-N) phase transition found by Vieillard-Baron was not observed in the PY solutions. The Maier-Saupe theory was reformulated based on the density functional formalism of Sluckin and Shukla. Using PY data of the hard ellipse as input for the direct correlation function in the isotropic phase, the orientational distribution was calculated. The values obtained showed only extremely weak nematic behavior.

Observer-based H∞ resilient control for a class of switched LPV systems and its application

NASA Astrophysics Data System (ADS)

Yang, Dong; Zhao, Jun

2016-11-01

This paper deals with the issue of observer-based H∞ resilient control for a class of switched linear parameter-varying (LPV) systems by utilising a multiple parameter-dependent Lyapunov functions method. First, attention is focused upon the design of a resilient observer, an observer-based resilient controller and a parameter and estimate state-dependent switching signal, which can stabilise and achieve the disturbance attenuation for the given systems. Then, a solvability condition of the H∞ resilient control problem is given in terms of matrix inequality for the switched LPV systems. This condition allows the H∞ resilient control problem for each individual subsystem to be unsolvable. The observer, controller, and switching signal are explicitly computed by solving linear matrix inequalities (LMIs). Finally, the effectiveness of the proposed control scheme is illustrated by its application to a turbofan engine, which can hardly be handled by the existing approaches.

Facility Layout Problems Using Bays: A Survey

NASA Astrophysics Data System (ADS)

Davoudpour, Hamid; Jaafari, Amir Ardestani; Farahani, Leila Najafabadi

2010-06-01

Layout design is one of the most important activities done by industrial Engineers. Most of these problems have NP hard Complexity. In a basic layout design, each cell is represented by a rectilinear, but not necessarily convex polygon. The set of fully packed adjacent polygons is known as a block layout (Asef-Vaziri and Laporte 2007). Block layout is divided by slicing tree and bay layout. In bay layout, departments are located in vertical columns or horizontal rows, bays. Bay layout is used in real worlds especially in concepts such as semiconductor and aisles. There are several reviews in facility layout; however none of them focus on bay layout. The literature analysis given here is not limited to specific considerations about bay layout design. We present a state of art review for bay layout considering some issues such as the used objectives, the techniques of solving and the integration methods in bay.

FPFH-based graph matching for 3D point cloud registration

NASA Astrophysics Data System (ADS)

Zhao, Jiapeng; Li, Chen; Tian, Lihua; Zhu, Jihua

2018-04-01

Correspondence detection is a vital step in point cloud registration and it can help getting a reliable initial alignment. In this paper, we put forward an advanced point feature-based graph matching algorithm to solve the initial alignment problem of rigid 3D point cloud registration with partial overlap. Specifically, Fast Point Feature Histograms are used to determine the initial possible correspondences firstly. Next, a new objective function is provided to make the graph matching more suitable for partially overlapping point cloud. The objective function is optimized by the simulated annealing algorithm for final group of correct correspondences. Finally, we present a novel set partitioning method which can transform the NP-hard optimization problem into a O(n3)-solvable one. Experiments on the Stanford and UWA public data sets indicates that our method can obtain better result in terms of both accuracy and time cost compared with other point cloud registration methods.

Zero-temperature quantum annealing bottlenecks in the spin-glass phase.

PubMed

Knysh, Sergey

2016-08-05

A promising approach to solving hard binary optimization problems is quantum adiabatic annealing in a transverse magnetic field. An instantaneous ground state-initially a symmetric superposition of all possible assignments of N qubits-is closely tracked as it becomes more and more localized near the global minimum of the classical energy. Regions where the energy gap to excited states is small (for instance at the phase transition) are the algorithm's bottlenecks. Here I show how for large problems the complexity becomes dominated by O(log N) bottlenecks inside the spin-glass phase, where the gap scales as a stretched exponential. For smaller N, only the gap at the critical point is relevant, where it scales polynomially, as long as the phase transition is second order. This phenomenon is demonstrated rigorously for the two-pattern Gaussian Hopfield model. Qualitative comparison with the Sherrington-Kirkpatrick model leads to similar conclusions.

Single molecule sequencing-guided scaffolding and correction of draft assemblies.

PubMed

Zhu, Shenglong; Chen, Danny Z; Emrich, Scott J

2017-12-06

Although single molecule sequencing is still improving, the lengths of the generated sequences are inevitably an advantage in genome assembly. Prior work that utilizes long reads to conduct genome assembly has mostly focused on correcting sequencing errors and improving contiguity of de novo assemblies. We propose a disassembling-reassembling approach for both correcting structural errors in the draft assembly and scaffolding a target assembly based on error-corrected single molecule sequences. To achieve this goal, we formulate a maximum alternating path cover problem. We prove that this problem is NP-hard, and solve it by a 2-approximation algorithm. Our experimental results show that our approach can improve the structural correctness of target assemblies in the cost of some contiguity, even with smaller amounts of long reads. In addition, our reassembling process can also serve as a competitive scaffolder relative to well-established assembly benchmarks.

Matching CT and ultrasound data of the liver by landmark constrained image registration

NASA Astrophysics Data System (ADS)

Olesch, Janine; Papenberg, Nils; Lange, Thomas; Conrad, Matthias; Fischer, Bernd

2009-02-01

In navigated liver surgery the key challenge is the registration of pre-operative planing and intra-operative navigation data. Due to the patients individual anatomy the planning is based on segmented, pre-operative CT scans whereas ultrasound captures the actual intra-operative situation. In this paper we derive a novel method based on variational image registration methods and additional given anatomic landmarks. For the first time we embed the landmark information as inequality hard constraints and thereby allowing for inaccurately placed landmarks. The yielding optimization problem allows to ensure the accuracy of the landmark fit by simultaneous intensity based image registration. Following the discretize-then-optimize approach the overall problem is solved by a generalized Gauss-Newton-method. The upcoming linear system is attacked by the MinRes solver. We demonstrate the applicability of the new approach for clinical data which lead to convincing results.

A bi-objective model for robust yard allocation scheduling for outbound containers

NASA Astrophysics Data System (ADS)

Liu, Changchun; Zhang, Canrong; Zheng, Li

2017-01-01

This article examines the yard allocation problem for outbound containers, with consideration of uncertainty factors, mainly including the arrival and operation time of calling vessels. Based on the time buffer inserting method, a bi-objective model is constructed to minimize the total operational cost and to maximize the robustness of fighting against the uncertainty. Due to the NP-hardness of the constructed model, a two-stage heuristic is developed to solve the problem. In the first stage, initial solutions are obtained by a greedy algorithm that looks n-steps ahead with the uncertainty factors set as their respective expected values; in the second stage, based on the solutions obtained in the first stage and with consideration of uncertainty factors, a neighbourhood search heuristic is employed to generate robust solutions that can fight better against the fluctuation of uncertainty factors. Finally, extensive numerical experiments are conducted to test the performance of the proposed method.

A comparison of portfolio selection models via application on ISE 100 index data

NASA Astrophysics Data System (ADS)

Altun, Emrah; Tatlidil, Hüseyin

2013-10-01

Markowitz Model, a classical approach to portfolio optimization problem, relies on two important assumptions: the expected return is multivariate normally distributed and the investor is risk averter. But this model has not been extensively used in finance. Empirical results show that it is very hard to solve large scale portfolio optimization problems with Mean-Variance (M-V)model. Alternative model, Mean Absolute Deviation (MAD) model which is proposed by Konno and Yamazaki [7] has been used to remove most of difficulties of Markowitz Mean-Variance model. MAD model don't need to assume that the probability of the rates of return is normally distributed and based on Linear Programming. Another alternative portfolio model is Mean-Lower Semi Absolute Deviation (M-LSAD), which is proposed by Speranza [3]. We will compare these models to determine which model gives more appropriate solution to investors.

Student’s scheme in solving mathematics problems

NASA Astrophysics Data System (ADS)

Setyaningsih, Nining; Juniati, Dwi; Suwarsono

2018-03-01

The purpose of this study was to investigate students’ scheme in solving mathematics problems. Scheme are data structures for representing the concepts stored in memory. In this study, we used it in solving mathematics problems, especially ratio and proportion topics. Scheme is related to problem solving that assumes that a system is developed in the human mind by acquiring a structure in which problem solving procedures are integrated with some concepts. The data were collected by interview and students’ written works. The results of this study revealed are students’ scheme in solving the problem of ratio and proportion as follows: (1) the content scheme, where students can describe the selected components of the problem according to their prior knowledge, (2) the formal scheme, where students can explain in construct a mental model based on components that have been selected from the problem and can use existing schemes to build planning steps, create something that will be used to solve problems and (3) the language scheme, where students can identify terms, or symbols of the components of the problem.Therefore, by using the different strategies to solve the problems, the students’ scheme in solving the ratio and proportion problems will also differ.

Factors of Problem-Solving Competency in a Virtual Chemistry Environment: The Role of Metacognitive Knowledge about Strategies

ERIC Educational Resources Information Center

Scherer, Ronny; Tiemann, Rudiger

2012-01-01

The ability to solve complex scientific problems is regarded as one of the key competencies in science education. Until now, research on problem solving focused on the relationship between analytical and complex problem solving, but rarely took into account the structure of problem-solving processes and metacognitive aspects. This paper,…

Same Old Problem, New Name? Alerting Students to the Nature of the Problem-Solving Process

ERIC Educational Resources Information Center

Yerushalmi, Edit; Magen, Esther

2006-01-01

Students frequently misconceive the process of problem-solving, expecting the linear process required for solving an exercise, rather than the convoluted search process required to solve a genuine problem. In this paper we present an activity designed to foster in students realization and appreciation of the nature of the problem-solving process,…

The Problem-Solving Process in Physics as Observed When Engineering Students at University Level Work in Groups

ERIC Educational Resources Information Center

Gustafsson, Peter; Jonsson, Gunnar; Enghag, Margareta

2015-01-01

The problem-solving process is investigated for five groups of students when solving context-rich problems in an introductory physics course included in an engineering programme. Through transcripts of their conversation, the paths in the problem-solving process have been traced and related to a general problem-solving model. All groups exhibit…

Social Problem Solving and Depressive Symptoms Over Time: A Randomized Clinical Trial of Cognitive Behavioral Analysis System of Psychotherapy, Brief Supportive Psychotherapy, and Pharmacotherapy

PubMed Central

Klein, Daniel N.; Leon, Andrew C.; Li, Chunshan; D’Zurilla, Thomas J.; Black, Sarah R.; Vivian, Dina; Dowling, Frank; Arnow, Bruce A.; Manber, Rachel; Markowitz, John C.; Kocsis, James H.

2011-01-01

Objective Depression is associated with poor social problem-solving, and psychotherapies that focus on problem-solving skills are efficacious in treating depression. We examined the associations between treatment, social problem solving, and depression in a randomized clinical trial testing the efficacy of psychotherapy augmentation for chronically depressed patients who failed to fully respond to an initial trial of pharmacotherapy (Kocsis et al., 2009). Method Participants with chronic depression (n = 491) received Cognitive Behavioral Analysis System of Psychotherapy (CBASP), which emphasizes interpersonal problem-solving, plus medication; Brief Supportive Psychotherapy (BSP) plus medication; or medication alone for 12 weeks. Results CBASP plus pharmacotherapy was associated with significantly greater improvement in social problem solving than BSP plus pharmacotherapy, and a trend for greater improvement in problem solving than pharmacotherapy alone. In addition, change in social problem solving predicted subsequent change in depressive symptoms over time. However, the magnitude of the associations between changes in social problem solving and subsequent depressive symptoms did not differ across treatment conditions. Conclusions It does not appear that improved social problem solving is a mechanism that uniquely distinguishes CBASP from other treatment approaches. PMID:21500885

Implementing thinking aloud pair and Pólya problem solving strategies in fractions

NASA Astrophysics Data System (ADS)

Simpol, N. S. H.; Shahrill, M.; Li, H.-C.; Prahmana, R. C. I.

2017-12-01

This study implemented two pedagogical strategies, the Thinking Aloud Pair Problem Solving and Pólya’s Problem Solving, to support students’ learning of fractions. The participants were 51 students (ages 11-13) from two Year 7 classes in a government secondary school in Brunei Darussalam. A mixed method design was employed in the present study, with data collected from the pre- and post-tests, problem solving behaviour questionnaire and interviews. The study aimed to explore if there were differences in the students’ problem solving behaviour before and after the implementation of the problem solving strategies. Results from the Wilcoxon Signed Rank Test revealed a significant difference in the test results regarding student problem solving behaviour, z = -3.68, p = .000, with a higher mean score for the post-test (M = 95.5, SD = 13.8) than for the pre-test (M = 88.9, SD = 15.2). This implied that there was improvement in the students’ problem solving performance from the pre-test to the post-test. Results from the questionnaire showed that more than half of the students increased scores in all four stages of the Pólya’s problem solving strategy, which provided further evidence of the students’ improvement in problem solving.

Fitting population models from field data

USGS Publications Warehouse

Emlen, J.M.; Freeman, D.C.; Kirchhoff, M.D.; Alados, C.L.; Escos, J.; Duda, J.J.

2003-01-01

The application of population and community ecology to solving real-world problems requires population and community dynamics models that reflect the myriad patterns of interaction among organisms and between the biotic and physical environments. Appropriate models are not hard to construct, but the experimental manipulations needed to evaluate their defining coefficients are often both time consuming and costly, and sometimes environmentally destructive, as well. In this paper we present an empirical approach for finding the coefficients of broadly inclusive models without the need for environmental manipulation, demonstrate the approach with both an animal and a plant example, and suggest possible applications. Software has been developed, and is available from the senior author, with a manual describing both field and analytic procedures.

Cosmological signatures of a UV-conformal standard model.

PubMed

Dorsch, Glauber C; Huber, Stephan J; No, Jose Miguel

2014-09-19

Quantum scale invariance in the UV has been recently advocated as an attractive way of solving the gauge hierarchy problem arising in the standard model. We explore the cosmological signatures at the electroweak scale when the breaking of scale invariance originates from a hidden sector and is mediated to the standard model by gauge interactions (gauge mediation). These scenarios, while being hard to distinguish from the standard model at LHC, can give rise to a strong electroweak phase transition leading to the generation of a large stochastic gravitational wave signal in possible reach of future space-based detectors such as eLISA and BBO. This relic would be the cosmological imprint of the breaking of scale invariance in nature.

Constructing conceptual meaning from a popular scientific paper—the case of E = mc2

NASA Astrophysics Data System (ADS)

Kapon, Shulamit

2013-01-01

Although high school physics students solve problems using the expression E = mc2, the origin of this expression and its deep conceptual meaning are hardly ever discussed due to students’ limited prior knowledge. In 1946, a year after the atomic bombs were first dropped, Albert Einstein published a popular scientific paper explaining the equivalence between mass and energy to the general public and the implications of this principle for our daily lives. This paper describes the utilization of Einstein’s paper in a high-school physics lesson on the equivalence of mass and energy, and discusses the instructional affordances of discussing exemplary popular scientific texts in a physics lesson.

Genetic influences on insight problem solving: the role of catechol-O-methyltransferase (COMT) gene polymorphisms

PubMed Central

Jiang, Weili; Shang, Siyuan; Su, Yanjie

2015-01-01

People may experience an “aha” moment, when suddenly realizing a solution of a puzzling problem. This experience is called insight problem solving. Several findings suggest that catecholamine-related genes may contribute to insight problem solving, among which the catechol-O-methyltransferase (COMT) gene is the most promising candidate. The current study examined 753 healthy individuals to determine the associations between 7 candidate single nucleotide polymorphisms on the COMT gene and insight problem-solving performance, while considering gender differences. The results showed that individuals carrying A allele of rs4680 or T allele of rs4633 scored significantly higher on insight problem-solving tasks, and the COMT gene rs5993883 combined with gender interacted with correct solutions of insight problems, specifically showing that this gene only influenced insight problem-solving performance in males. This study presents the first investigation of the genetic impact on insight problem solving and provides evidence that highlights the role that the COMT gene plays in insight problem solving. PMID:26528222

Genetic influences on insight problem solving: the role of catechol-O-methyltransferase (COMT) gene polymorphisms.

PubMed

Jiang, Weili; Shang, Siyuan; Su, Yanjie

2015-01-01

People may experience an "aha" moment, when suddenly realizing a solution of a puzzling problem. This experience is called insight problem solving. Several findings suggest that catecholamine-related genes may contribute to insight problem solving, among which the catechol-O-methyltransferase (COMT) gene is the most promising candidate. The current study examined 753 healthy individuals to determine the associations between 7 candidate single nucleotide polymorphisms on the COMT gene and insight problem-solving performance, while considering gender differences. The results showed that individuals carrying A allele of rs4680 or T allele of rs4633 scored significantly higher on insight problem-solving tasks, and the COMT gene rs5993883 combined with gender interacted with correct solutions of insight problems, specifically showing that this gene only influenced insight problem-solving performance in males. This study presents the first investigation of the genetic impact on insight problem solving and provides evidence that highlights the role that the COMT gene plays in insight problem solving.

Understanding Undergraduates’ Problem-Solving Processes †

PubMed Central

Nehm, Ross H.

2010-01-01

Fostering effective problem-solving skills is one of the most longstanding and widely agreed upon goals of biology education. Nevertheless, undergraduate biology educators have yet to leverage many major findings about problem-solving processes from the educational and cognitive science research literatures. This article highlights key facets of problem-solving processes and introduces methodologies that may be used to reveal how undergraduate students perceive and represent biological problems. Overall, successful problem-solving entails a keen sensitivity to problem contexts, disciplined internal representation or modeling of the problem, and the principled management and deployment of cognitive resources. Context recognition tasks, problem representation practice, and cognitive resource management receive remarkably little emphasis in the biology curriculum, despite their central roles in problem-solving success. PMID:23653710

Thinking Process of Naive Problem Solvers to Solve Mathematical Problems

ERIC Educational Resources Information Center

Mairing, Jackson Pasini

2017-01-01

Solving problems is not only a goal of mathematical learning. Students acquire ways of thinking, habits of persistence and curiosity, and confidence in unfamiliar situations by learning to solve problems. In fact, there were students who had difficulty in solving problems. The students were naive problem solvers. This research aimed to describe…

Teaching Problem Solving without Modeling through "Thinking Aloud Pair Problem Solving."

ERIC Educational Resources Information Center

Pestel, Beverly C.

1993-01-01

Reviews research relevant to the problem of unsatisfactory student problem-solving abilities and suggests a teaching strategy that addresses the issue. Author explains how she uses teaching aloud problem solving (TAPS) in college chemistry and presents evaluation data. Among the findings are that the TAPS class got fewer problems completely right,…

Social Problem Solving, Conduct Problems, and Callous-Unemotional Traits in Children

ERIC Educational Resources Information Center

Waschbusch, Daniel A.; Walsh, Trudi M.; Andrade, Brendan F.; King, Sara; Carrey, Normand J.

2007-01-01

This study examined the association between social problem solving, conduct problems (CP), and callous-unemotional (CU) traits in elementary age children. Participants were 53 children (40 boys and 13 girls) aged 7-12 years. Social problem solving was evaluated using the Social Problem Solving Test-Revised, which requires children to produce…

Relationship functioning moderates the association between depressive symptoms and life stressors.

PubMed

Trombello, Joseph M; Schoebi, Dominik; Bradbury, Thomas N

2011-02-01

Data from 172 newlywed couples were collected over the first 4 years of marriage to test how behaviors demonstrated during marital interactions moderate associations between depressive symptoms and subsequent life stressors. Depressive symptoms and behaviors coded from problem-solving and social support interactions were analyzed as predictors of nonmarital stressors that were interpersonal and dependent on the participant's actions. Behavioral codes were found to moderate 3 of 16 symptom-to-life event associations for husbands. Husbands' reports of more depressive symptoms predicted greater levels of stress when husbands' positive affect and hard negative affect during problem-solving were relatively infrequent and when wives made frequent displays of positive behaviors during husbands' support topics. These effects remained after controlling for marital satisfaction. For wives, behavioral moderators did not interact with depressive symptoms to predict changes in stress, but marital satisfaction consistently interacted with depressive symptoms to predict future stressors beyond interpersonal behaviors. Specifically, for wives, stress generation was more evident when relationship satisfaction was low than when it was high. Our results, though different for men and women, suggest that relationship functioning can alter associations between depressive symptoms and life stress in the early years of marriage. (PsycINFO Database Record (c) 2011 APA, all rights reserved). PsycINFO Database Record (c) 2011 APA, all rights reserved.

Beyond Moore's law: towards competitive quantum devices

NASA Astrophysics Data System (ADS)

Troyer, Matthias

2015-05-01

A century after the invention of quantum theory and fifty years after Bell's inequality we see the first quantum devices emerge as products that aim to be competitive with the best classical computing devices. While a universal quantum computer of non-trivial size is still out of reach there exist a number commercial and experimental devices: quantum random number generators, quantum simulators and quantum annealers. In this colloquium I will present some of these devices and validation tests we performed on them. Quantum random number generators use the inherent randomness in quantum measurements to produce true random numbers, unlike classical pseudorandom number generators which are inherently deterministic. Optical lattice emulators use ultracold atomic gases in optical lattices to mimic typical models of condensed matter physics. In my talk I will focus especially on the devices built by Canadian company D-Wave systems, which are special purpose quantum simulators for solving hard classical optimization problems. I will review the controversy around the quantum nature of these devices and will compare them to state of the art classical algorithms. I will end with an outlook towards universal quantum computing and end with the question: which important problems that are intractable even for post-exa-scale classical computers could we expect to solve once we have a universal quantum computer?

Personality, problem solving, and adolescent substance use.

PubMed

Jaffee, William B; D'Zurilla, Thomas J

2009-03-01

The major aim of this study was to examine the role of social problem solving in the relationship between personality and substance use in adolescents. Although a number of studies have identified a relationship between personality and substance use, the precise mechanism by which this occurs is not clear. We hypothesized that problem-solving skills could be one such mechanism. More specifically, we sought to determine whether problem solving mediates, moderates, or both mediates and moderates the relationship between different personality traits and substance use. Three hundred and seven adolescents were administered the Substance Use Profile Scale, the Social Problem-Solving Inventory-Revised, and the Personality Experiences Inventory to assess personality, social problem-solving ability, and substance use, respectively. Results showed that the dimension of rational problem solving (i.e., effective problem-solving skills) significantly mediated the relationship between hopelessness and lifetime alcohol and marijuana use. The theoretical and clinical implications of these results were discussed.

Enhancing chemistry problem-solving achievement using problem categorization

NASA Astrophysics Data System (ADS)

Bunce, Diane M.; Gabel, Dorothy L.; Samuel, John V.

The enhancement of chemistry students' skill in problem solving through problem categorization is the focus of this study. Twenty-four students in a freshman chemistry course for health professionals are taught how to solve problems using the explicit method of problem solving (EMPS) (Bunce & Heikkinen, 1986). The EMPS is an organized approach to problem analysis which includes encoding the information given in a problem (Given, Asked For), relating this to what is already in long-term memory (Recall), and planning a solution (Overall Plan) before a mathematical solution is attempted. In addition to the EMPS training, treatment students receive three 40-minute sessions following achievement tests in which they are taught how to categorize problems. Control students use this time to review the EMPS solutions of test questions. Although problem categorization is involved in one section of the EMPS (Recall), treatment students who received specific training in problem categorization demonstrate significantly higher achievement on combination problems (those problems requiring the use of more than one chemical topic for their solution) at (p = 0.01) than their counterparts. Significantly higher achievement for treatment students is also measured on an unannounced test (p = 0.02). Analysis of interview transcripts of both treatment and control students illustrates a Rolodex approach to problem solving employed by all students in this study. The Rolodex approach involves organizing equations used to solve problems on mental index cards and flipping through them, matching units given when a new problem is to be solved. A second phenomenon observed during student interviews is the absence of a link in the conceptual understanding of the chemical concepts involved in a problem and the problem-solving skills employed to correctly solve problems. This study shows that explicit training in categorization skills and the EMPS can lead to higher achievement in complex problem-solving situations (combination problems and unannounced test). However, such achievement may be limited by the lack of linkages between students' conceptual understanding and improved problem-solving skill.

Decision-Making and Problem-Solving Approaches in Pharmacy Education

PubMed Central

Martin, Lindsay C.; Holdford, David A.

2016-01-01

Domain 3 of the Center for the Advancement of Pharmacy Education (CAPE) 2013 Educational Outcomes recommends that pharmacy school curricula prepare students to be better problem solvers, but are silent on the type of problems they should be prepared to solve. We identified five basic approaches to problem solving in the curriculum at a pharmacy school: clinical, ethical, managerial, economic, and legal. These approaches were compared to determine a generic process that could be applied to all pharmacy decisions. Although there were similarities in the approaches, generic problem solving processes may not work for all problems. Successful problem solving requires identification of the problems faced and application of the right approach to the situation. We also advocate that the CAPE Outcomes make explicit the importance of different approaches to problem solving. Future pharmacists will need multiple approaches to problem solving to adapt to the complexity of health care. PMID:27170823

Decision-Making and Problem-Solving Approaches in Pharmacy Education.

PubMed

Martin, Lindsay C; Donohoe, Krista L; Holdford, David A

2016-04-25

Domain 3 of the Center for the Advancement of Pharmacy Education (CAPE) 2013 Educational Outcomes recommends that pharmacy school curricula prepare students to be better problem solvers, but are silent on the type of problems they should be prepared to solve. We identified five basic approaches to problem solving in the curriculum at a pharmacy school: clinical, ethical, managerial, economic, and legal. These approaches were compared to determine a generic process that could be applied to all pharmacy decisions. Although there were similarities in the approaches, generic problem solving processes may not work for all problems. Successful problem solving requires identification of the problems faced and application of the right approach to the situation. We also advocate that the CAPE Outcomes make explicit the importance of different approaches to problem solving. Future pharmacists will need multiple approaches to problem solving to adapt to the complexity of health care.

Social problem-solving in Chinese baccalaureate nursing students.

PubMed

Fang, Jinbo; Luo, Ying; Li, Yanhua; Huang, Wenxia

2016-11-01

To describe social problem solving in Chinese baccalaureate nursing students. A descriptive cross-sectional study was conducted with a cluster sample of 681 Chinese baccalaureate nursing students. The Chinese version of the Social Problem-Solving scale was used. Descriptive analyses, independent t-test and one-way analysis of variance were applied to analyze the data. The final year nursing students presented the highest scores of positive social problem-solving skills. Students with experiences of self-directed and problem-based learning presented significantly higher scores in Positive Problem Orientation subscale. The group with Critical thinking training experience, however, displayed higher negative problem solving scores compared with nonexperience group. Social problem solving abilities varied based upon teaching-learning strategies. Self-directed and problem-based learning may be recommended as effective way to improve social problem-solving ability. © 2016 Chinese Cochrane Center, West China Hospital of Sichuan University and John Wiley & Sons Australia, Ltd.

Problem Solving and Chemical Equilibrium: Successful versus Unsuccessful Performance.

ERIC Educational Resources Information Center

Camacho, Moises; Good, Ron

1989-01-01

Describes the problem-solving behaviors of experts and novices engaged in solving seven chemical equilibrium problems. Lists 27 behavioral tendencies of successful and unsuccessful problem solvers. Discusses several implications for a problem solving theory, think-aloud techniques, adequacy of the chemistry domain, and chemistry instruction.…

Worry and problem-solving skills and beliefs in primary school children.

PubMed

Parkinson, Monika; Creswell, Cathy

2011-03-01

To examine the association between worry and problem-solving skills and beliefs (confidence and perceived control) in primary school children. Children (8-11 years) were screened using the Penn State Worry Questionnaire for Children. High (N= 27) and low (N= 30) scorers completed measures of anxiety, problem-solving skills (generating alternative solutions to problems, planfulness, and effectiveness of solutions) and problem-solving beliefs (confidence and perceived control). High and low worry groups differed significantly on measures of anxiety and problem-solving beliefs (confidence and control) but not on problem-solving skills. Consistent with findings with adults, worry in children was associated with cognitive distortions, not skills deficits. Interventions for worried children may benefit from a focus on increasing positive problem-solving beliefs. ©2010 The British Psychological Society.

Finite element method formulation in polar coordinates for transient heat conduction problems

NASA Astrophysics Data System (ADS)

Duda, Piotr

2016-04-01

The aim of this paper is the formulation of the finite element method in polar coordinates to solve transient heat conduction problems. It is hard to find in the literature a formulation of the finite element method (FEM) in polar or cylindrical coordinates for the solution of heat transfer problems. This document shows how to apply the most often used boundary conditions. The global equation system is solved by the Crank-Nicolson method. The proposed algorithm is verified in three numerical tests. In the first example, the obtained transient temperature distribution is compared with the temperature obtained from the presented analytical solution. In the second numerical example, the variable boundary condition is assumed. In the last numerical example the component with the shape different than cylindrical is used. All examples show that the introduction of the polar coordinate system gives better results than in the Cartesian coordinate system. The finite element method formulation in polar coordinates is valuable since it provides a higher accuracy of the calculations without compacting the mesh in cylindrical or similar to tubular components. The proposed method can be applied for circular elements such as boiler drums, outlet headers, flux tubes. This algorithm can be useful during the solution of inverse problems, which do not allow for high density grid. This method can calculate the temperature distribution in the bodies of different properties in the circumferential and the radial direction. The presented algorithm can be developed for other coordinate systems. The examples demonstrate a good accuracy and stability of the proposed method.

Fast Gaussian kernel learning for classification tasks based on specially structured global optimization.

PubMed

Zhong, Shangping; Chen, Tianshun; He, Fengying; Niu, Yuzhen

2014-09-01

For a practical pattern classification task solved by kernel methods, the computing time is mainly spent on kernel learning (or training). However, the current kernel learning approaches are based on local optimization techniques, and hard to have good time performances, especially for large datasets. Thus the existing algorithms cannot be easily extended to large-scale tasks. In this paper, we present a fast Gaussian kernel learning method by solving a specially structured global optimization (SSGO) problem. We optimize the Gaussian kernel function by using the formulated kernel target alignment criterion, which is a difference of increasing (d.i.) functions. Through using a power-transformation based convexification method, the objective criterion can be represented as a difference of convex (d.c.) functions with a fixed power-transformation parameter. And the objective programming problem can then be converted to a SSGO problem: globally minimizing a concave function over a convex set. The SSGO problem is classical and has good solvability. Thus, to find the global optimal solution efficiently, we can adopt the improved Hoffman's outer approximation method, which need not repeat the searching procedure with different starting points to locate the best local minimum. Also, the proposed method can be proven to converge to the global solution for any classification task. We evaluate the proposed method on twenty benchmark datasets, and compare it with four other Gaussian kernel learning methods. Experimental results show that the proposed method stably achieves both good time-efficiency performance and good classification performance. Copyright © 2014 Elsevier Ltd. All rights reserved.

The effectiveness of problem-based learning on students’ problem solving ability in vector analysis course

NASA Astrophysics Data System (ADS)

Mushlihuddin, R.; Nurafifah; Irvan

2018-01-01

The student’s low ability in mathematics problem solving proved to the less effective of a learning process in the classroom. Effective learning was a learning that affects student’s math skills, one of which is problem-solving abilities. Problem-solving capability consisted of several stages: understanding the problem, planning the settlement, solving the problem as planned, re-examining the procedure and the outcome. The purpose of this research was to know: (1) was there any influence of PBL model in improving ability Problem solving of student math in a subject of vector analysis?; (2) was the PBL model effective in improving students’ mathematical problem-solving skills in vector analysis courses? This research was a quasi-experiment research. The data analysis techniques performed from the test stages of data description, a prerequisite test is the normality test, and hypothesis test using the ANCOVA test and Gain test. The results showed that: (1) there was an influence of PBL model in improving students’ math problem-solving abilities in vector analysis courses; (2) the PBL model was effective in improving students’ problem-solving skills in vector analysis courses with a medium category.

Effects of Training in Problem Solving on the Problem-Solving Abilities of Gifted Fourth Graders: A Comparison of the Future Problem Solving and Instrumental Enrichment Programs.

ERIC Educational Resources Information Center

Dufner, Hillrey A.; Alexander, Patricia A.

The differential effects of two different types of problem-solving training on the problem-solving abilities of gifted fourth graders were studied. Two successive classes of gifted fourth graders from Weslaco Independent School District (Texas) were pretested with the Coloured Progressive Matrices (CPM) and Thinking Creatively With Pictures…

Social problem-solving among adolescents treated for depression.

PubMed

Becker-Weidman, Emily G; Jacobs, Rachel H; Reinecke, Mark A; Silva, Susan G; March, John S

2010-01-01

Studies suggest that deficits in social problem-solving may be associated with increased risk of depression and suicidality in children and adolescents. It is unclear, however, which specific dimensions of social problem-solving are related to depression and suicidality among youth. Moreover, rational problem-solving strategies and problem-solving motivation may moderate or predict change in depression and suicidality among children and adolescents receiving treatment. The effect of social problem-solving on acute treatment outcomes were explored in a randomized controlled trial of 439 clinically depressed adolescents enrolled in the Treatment for Adolescents with Depression Study (TADS). Measures included the Children's Depression Rating Scale-Revised (CDRS-R), the Suicidal Ideation Questionnaire--Grades 7-9 (SIQ-Jr), and the Social Problem-Solving Inventory-Revised (SPSI-R). A random coefficients regression model was conducted to examine main and interaction effects of treatment and SPSI-R subscale scores on outcomes during the 12-week acute treatment stage. Negative problem orientation, positive problem orientation, and avoidant problem-solving style were non-specific predictors of depression severity. In terms of suicidality, avoidant problem-solving style and impulsiveness/carelessness style were predictors, whereas negative problem orientation and positive problem orientation were moderators of treatment outcome. Implications of these findings, limitations, and directions for future research are discussed. Copyright 2009 Elsevier Ltd. All rights reserved.

Step by Step: Biology Undergraduates’ Problem-Solving Procedures during Multiple-Choice Assessment

PubMed Central

Prevost, Luanna B.; Lemons, Paula P.

2016-01-01

This study uses the theoretical framework of domain-specific problem solving to explore the procedures students use to solve multiple-choice problems about biology concepts. We designed several multiple-choice problems and administered them on four exams. We trained students to produce written descriptions of how they solved the problem, and this allowed us to systematically investigate their problem-solving procedures. We identified a range of procedures and organized them as domain general, domain specific, or hybrid. We also identified domain-general and domain-specific errors made by students during problem solving. We found that students use domain-general and hybrid procedures more frequently when solving lower-order problems than higher-order problems, while they use domain-specific procedures more frequently when solving higher-order problems. Additionally, the more domain-specific procedures students used, the higher the likelihood that they would answer the problem correctly, up to five procedures. However, if students used just one domain-general procedure, they were as likely to answer the problem correctly as if they had used two to five domain-general procedures. Our findings provide a categorization scheme and framework for additional research on biology problem solving and suggest several important implications for researchers and instructors. PMID:27909021

An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.

PubMed

Guturu, Parthasarathy; Dantu, Ram

2008-06-01

Many graph- and set-theoretic problems, because of their tremendous application potential and theoretical appeal, have been well investigated by the researchers in complexity theory and were found to be NP-hard. Since the combinatorial complexity of these problems does not permit exhaustive searches for optimal solutions, only near-optimal solutions can be explored using either various problem-specific heuristic strategies or metaheuristic global-optimization methods, such as simulated annealing, genetic algorithms, etc. In this paper, we propose a unified evolutionary algorithm (EA) to the problems of maximum clique finding, maximum independent set, minimum vertex cover, subgraph and double subgraph isomorphism, set packing, set partitioning, and set cover. In the proposed approach, we first map these problems onto the maximum clique-finding problem (MCP), which is later solved using an evolutionary strategy. The proposed impatient EA with probabilistic tabu search (IEA-PTS) for the MCP integrates the best features of earlier successful approaches with a number of new heuristics that we developed to yield a performance that advances the state of the art in EAs for the exploration of the maximum cliques in a graph. Results of experimentation with the 37 DIMACS benchmark graphs and comparative analyses with six state-of-the-art algorithms, including two from the smaller EA community and four from the larger metaheuristics community, indicate that the IEA-PTS outperforms the EAs with respect to a Pareto-lexicographic ranking criterion and offers competitive performance on some graph instances when individually compared to the other heuristic algorithms. It has also successfully set a new benchmark on one graph instance. On another benchmark suite called Benchmarks with Hidden Optimal Solutions, IEA-PTS ranks second, after a very recent algorithm called COVER, among its peers that have experimented with this suite.

Disciplinary Foundations for Solving Interdisciplinary Scientific Problems

ERIC Educational Resources Information Center

Zhang, Dongmei; Shen, Ji

2015-01-01

Problem-solving has been one of the major strands in science education research. But much of the problem-solving research has been conducted on discipline-based contexts; little research has been done on how students, especially individuals, solve interdisciplinary problems. To understand how individuals reason about interdisciplinary problems, we…

Engineering students' experiences and perceptions of workplace problem solving

NASA Astrophysics Data System (ADS)

Pan, Rui

In this study, I interviewed 22 engineering Co-Op students about their workplace problem solving experiences and reflections and explored: 1) Of Co-Op students who experienced workplace problem solving, what are the different ways in which students experience workplace problem solving? 2) How do students perceive a) the differences between workplace problem solving and classroom problem solving and b) in what areas are they prepared by their college education to solve workplace problems? To answer my first research question, I analyzed data through the lens of phenomenography and I conducted thematic analysis to answer my second research question. The results of this study have implications for engineering education and engineering practice. Specifically, the results reveal the different ways students experience workplace problem solving, which provide engineering educators and practicing engineers a better understanding of the nature of workplace engineering. In addition, the results indicate that there is still a gap between classroom engineering and workplace engineering. For engineering educators who aspire to prepare students to be future engineers, it is imperative to design problem solving experiences that can better prepare students with workplace competency.

Problem-Solving Deficits in Iranian People with Borderline Personality Disorder

PubMed Central

Akbari Dehaghi, Ashraf; Kaviani, Hossein; Tamanaeefar, Shima

2014-01-01

Objective: Interventions for people suffering from borderline personality disorder (BPD), such as dialectical behavior therapy, often include a problem-solving component. However, there is an absence of published studies examining the problem-solving abilities of this client group in Iran. The study compared inpatients and outpatients with BPD and a control group on problem-solving capabilities in an Iranian sample. It was hypothesized that patients with BPD would have more deficiencies in this area. Methods: Fifteen patients with BPD were compared to 15 healthy participants. Means-ends problem-solving task (MEPS) was used to measure problem-solving skills in both groups. Results: BPD group reported less effective strategies in solving problems as opposed to the healthy group. Compared to the control group, participants with BPD provided empirical support for the use of problem-solving interventions with people suffering from BPD. Conclusions: The findings supported the idea that a problem-solving intervention can be efficiently applied either as a stand-alone therapy or in conjunction with other available psychotherapies to treat people with BPD. PMID:25798169

Enhancing memory and imagination improves problem solving among individuals with depression.

PubMed

McFarland, Craig P; Primosch, Mark; Maxson, Chelsey M; Stewart, Brandon T

2017-08-01

Recent work has revealed links between memory, imagination, and problem solving, and suggests that increasing access to detailed memories can lead to improved imagination and problem-solving performance. Depression is often associated with overgeneral memory and imagination, along with problem-solving deficits. In this study, we tested the hypothesis that an interview designed to elicit detailed recollections would enhance imagination and problem solving among both depressed and nondepressed participants. In a within-subjects design, participants completed a control interview or an episodic specificity induction prior to completing memory, imagination, and problem-solving tasks. Results revealed that compared to the control interview, the episodic specificity induction fostered increased detail generation in memory and imagination and more relevant steps on the problem-solving task among depressed and nondepressed participants. This study builds on previous work by demonstrating that a brief interview can enhance problem solving among individuals with depression and supports the notion that episodic memory plays a key role in problem solving. It should be noted, however, that the results of the interview are relatively short-lived.

Measuring Family Problem Solving: The Family Problem Solving Diary.

ERIC Educational Resources Information Center

Kieren, Dianne K.

The development and use of the family problem-solving diary are described. The diary is one of several indicators and measures of family problem-solving behavior. It provides a record of each person's perception of day-to-day family problems (what the problem concerns, what happened, who got involved, what those involved did, how the problem…

Goal specificity and knowledge acquisition in statistics problem solving: evidence for attentional focus.

PubMed

Trumpower, David L; Goldsmith, Timothy E; Guynn, Melissa J

2004-12-01

Solving training problems with nonspecific goals (NG; i.e., solving for all possible unknown values) often results in better transfer than solving training problems with standard goals (SG; i.e., solving for one particular unknown value). In this study, we evaluated an attentional focus explanation of the goal specificity effect. According to the attentional focus view, solving NG problems causes attention to be directed to local relations among successive problem states, whereas solving SG problems causes attention to be directed to relations between the various problem states and the goal state. Attention to the former is thought to enhance structural knowledge about the problem domain and thus promote transfer. Results supported this view because structurally different transfer problems were solved faster following NG training than following SG training. Moreover, structural knowledge representations revealed more links depicting local relations following NG training and more links to the training goal following SG training. As predicted, these effects were obtained only by domain novices.

Problem-Solving After Traumatic Brain Injury in Adolescence: Associations With Functional Outcomes

PubMed Central

Wade, Shari L.; Cassedy, Amy E.; Fulks, Lauren E.; Taylor, H. Gerry; Stancin, Terry; Kirkwood, Michael W.; Yeates, Keith O.; Kurowski, Brad G.

2017-01-01

Objective To examine the association of problem-solving with functioning in youth with traumatic brain injury (TBI). Design Cross-sectional evaluation of pretreatment data from a randomized controlled trial. Setting Four children’s hospitals and 1 general hospital, with level 1 trauma units. Participants Youth, ages 11 to 18 years, who sustained moderate or severe TBI in the last 18 months (N=153). Main Outcome Measures Problem-solving skills were assessed using the Social Problem-Solving Inventory (SPSI) and the Dodge Social Information Processing Short Stories. Everyday functioning was assessed based on a structured clinical interview using the Child and Adolescent Functional Assessment Scale (CAFAS) and via adolescent ratings on the Youth Self Report (YSR). Correlations and multiple regression analyses were used to examine associations among measures. Results The TBI group endorsed lower levels of maladaptive problem-solving (negative problem orientation, careless/impulsive responding, and avoidant style) and lower levels of rational problem-solving, resulting in higher total problem-solving scores for the TBI group compared with a normative sample (P<.001). Dodge Social Information Processing Short Stories dimensions were correlated (r=.23–.37) with SPSI subscales in the anticipated direction. Although both maladaptive (P<.001) and adaptive (P=.006) problem-solving composites were associated with overall functioning on the CAFAS, only maladaptive problem-solving (P<.001) was related to the YSR total when outcomes were continuous. For the both CAFAS and YSR logistic models, maladaptive style was significantly associated with greater risk of impairment (P=.001). Conclusions Problem-solving after TBI differs from normative samples and is associated with functional impairments. The relation of problem-solving deficits after TBI with global functioning merits further investigation, with consideration of the potential effects of problem-solving interventions on functional outcomes. PMID:28389109

Problem-Solving After Traumatic Brain Injury in Adolescence: Associations With Functional Outcomes.

PubMed

Wade, Shari L; Cassedy, Amy E; Fulks, Lauren E; Taylor, H Gerry; Stancin, Terry; Kirkwood, Michael W; Yeates, Keith O; Kurowski, Brad G

2017-08-01

To examine the association of problem-solving with functioning in youth with traumatic brain injury (TBI). Cross-sectional evaluation of pretreatment data from a randomized controlled trial. Four children's hospitals and 1 general hospital, with level 1 trauma units. Youth, ages 11 to 18 years, who sustained moderate or severe TBI in the last 18 months (N=153). Problem-solving skills were assessed using the Social Problem-Solving Inventory (SPSI) and the Dodge Social Information Processing Short Stories. Everyday functioning was assessed based on a structured clinical interview using the Child and Adolescent Functional Assessment Scale (CAFAS) and via adolescent ratings on the Youth Self Report (YSR). Correlations and multiple regression analyses were used to examine associations among measures. The TBI group endorsed lower levels of maladaptive problem-solving (negative problem orientation, careless/impulsive responding, and avoidant style) and lower levels of rational problem-solving, resulting in higher total problem-solving scores for the TBI group compared with a normative sample (P<.001). Dodge Social Information Processing Short Stories dimensions were correlated (r=.23-.37) with SPSI subscales in the anticipated direction. Although both maladaptive (P<.001) and adaptive (P=.006) problem-solving composites were associated with overall functioning on the CAFAS, only maladaptive problem-solving (P<.001) was related to the YSR total when outcomes were continuous. For the both CAFAS and YSR logistic models, maladaptive style was significantly associated with greater risk of impairment (P=.001). Problem-solving after TBI differs from normative samples and is associated with functional impairments. The relation of problem-solving deficits after TBI with global functioning merits further investigation, with consideration of the potential effects of problem-solving interventions on functional outcomes. Copyright © 2017 American Congress of Rehabilitation Medicine. Published by Elsevier Inc. All rights reserved.

Solving the transient water age distribution problem in environmental flow systems

NASA Astrophysics Data System (ADS)

Cornaton, F. J.

2011-12-01

The temporal evolution of groundwater age and its frequency distributions can display important changes as flow regimes vary due to the natural change in climate and hydrologic conditions and/or to human induced pressures on the resource to satisfy the water demand. Groundwater age being nowadays frequently used to investigate reservoir properties and recharge conditions, special attention needs to be put on the way this property is characterized, would it be using isotopic methods, multiple tracer techniques, or mathematical modelling. Steady-state age frequency distributions can be modelled using standard numerical techniques, since the general balance equation describing age transport under steady-state flow conditions is exactly equivalent to a standard advection-dispersion equation. The time-dependent problem is however described by an extended transport operator that incorporates an additional coordinate for water age. The consequence is that numerical solutions can hardly be achieved, especially for real 3-D applications over large time periods of interest. The absence of any robust method has thus left us in the quantitative hydrogeology community dodging the issue of transience. Novel algorithms for solving the age distribution problem under time-varying flow regimes are presented and, for some specific configurations, extended to the problem of generalized component exposure time. The solution strategy is based on the combination of the Laplace Transform technique applied to the age (or exposure time) coordinate with standard time-marching schemes. The method is well-suited for groundwater problems with possible density-dependency of fluid flow (e.g. coupled flow and heat/salt concentration problems), but also presents significance to the homogeneous flow (compressible case) problem. The approach is validated using 1-D analytical solutions and exercised on some demonstration problems that are relevant to topical issues in groundwater age, including analysis of transfer times in the vadose zone, aquifer-aquitard interactions and the induction of transient age distributions when a well pump is started.

New Ideas on the Design of the Web-Based Learning System Oriented to Problem Solving from the Perspective of Question Chain and Learning Community

ERIC Educational Resources Information Center

Zhang, Yin; Chu, Samuel K. W.

2016-01-01

In recent years, a number of models concerning problem solving systems have been put forward. However, many of them stress on technology and neglect the research of problem solving itself, especially the learning mechanism related to problem solving. In this paper, we analyze the learning mechanism of problem solving, and propose that when…

Perceived problem solving, stress, and health among college students.

PubMed

Largo-Wight, Erin; Peterson, P Michael; Chen, W William

2005-01-01

To study the relationships among perceived problem solving, stress, and physical health. The Perceived Stress Questionnaire (PSQ), Personal Problem solving Inventory (PSI), and a stress-related physical health symptoms checklist were used to measure perceived stress, problem solving, and health among undergraduate college students (N = 232). Perceived problem-solving ability predicted self-reported physical health symptoms (R2 = .12; P < .001) and perceived stress (R2 = .19; P < .001). Perceived problem solving was a stronger predictor of physical health and perceived stress than were physical activity, alcohol consumption, or social support. Implications for college health promotion are discussed.

Problem-solving rubrics revisited: Attending to the blending of informal conceptual and formal mathematical reasoning

NASA Astrophysics Data System (ADS)

Hull, Michael M.; Kuo, Eric; Gupta, Ayush; Elby, Andrew

2013-06-01

Much research in engineering and physics education has focused on improving students’ problem-solving skills. This research has led to the development of step-by-step problem-solving strategies and grading rubrics to assess a student’s expertise in solving problems using these strategies. These rubrics value “communication” between the student’s qualitative description of the physical situation and the student’s formal mathematical descriptions (usually equations) at two points: when initially setting up the equations, and when evaluating the final mathematical answer for meaning and plausibility. We argue that (i) neither the rubrics nor the associated problem-solving strategies explicitly value this kind of communication during mathematical manipulations of the chosen equations, and (ii) such communication is an aspect of problem-solving expertise. To make this argument, we present a case study of two students, Alex and Pat, solving the same kinematics problem in clinical interviews. We argue that Pat’s solution, which connects manipulation of equations to their physical interpretation, is more expertlike than Alex’s solution, which uses equations more algorithmically. We then show that the types of problem-solving rubrics currently available do not discriminate between these two types of solutions. We conclude that problem-solving rubrics should be revised or repurposed to more accurately assess problem-solving expertise.

Examining Tasks that Facilitate the Experience of Incubation While Problem-Solving

ERIC Educational Resources Information Center

Both, Lilly; Needham, Douglas; Wood, Eileen

2004-01-01

The three studies presented here contrasted the problem-solving outcomes of university students when a break was provided or not provided during a problem-solving session. In addition, two studies explored the effect of providing hints (priming) and the placement of hints during the problem-solving session. First, the ability to solve a previously…

The profile of students’ problem-solving skill in physics across interest program in the secondary school

NASA Astrophysics Data System (ADS)

Jua, S. K.; Sarwanto; Sukarmin

2018-05-01

Problem-solving skills are important skills in physics. However, according to some researchers, the problem-solving skill of Indonesian students’ problem in physics learning is categorized still low. The purpose of this study was to identify the profile of problem-solving skills of students who follow the across the interests program of physics. The subjects of the study were high school students of Social Sciences, grade X. The type of this research was descriptive research. The data which used to analyze the problem-solving skills were obtained through student questionnaires and the test results with impulse materials and collision. From the descriptive analysis results, the percentage of students’ problem-solving skill based on the test was 52.93% and indicators respectively. These results indicated that students’ problem-solving skill is categorized low.

Learning graph matching.

PubMed

Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J

2009-06-01

As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.

High performance genetic algorithm for VLSI circuit partitioning

NASA Astrophysics Data System (ADS)

Dinu, Simona

2016-12-01

Partitioning is one of the biggest challenges in computer-aided design for VLSI circuits (very large-scale integrated circuits). This work address the min-cut balanced circuit partitioning problem- dividing the graph that models the circuit into almost equal sized k sub-graphs while minimizing the number of edges cut i.e. minimizing the number of edges connecting the sub-graphs. The problem may be formulated as a combinatorial optimization problem. Experimental studies in the literature have shown the problem to be NP-hard and thus it is important to design an efficient heuristic algorithm to solve it. The approach proposed in this study is a parallel implementation of a genetic algorithm, namely an island model. The information exchange between the evolving subpopulations is modeled using a fuzzy controller, which determines an optimal balance between exploration and exploitation of the solution space. The results of simulations show that the proposed algorithm outperforms the standard sequential genetic algorithm both in terms of solution quality and convergence speed. As a direction for future study, this research can be further extended to incorporate local search operators which should include problem-specific knowledge. In addition, the adaptive configuration of mutation and crossover rates is another guidance for future research.

A New Problem-Posing Approach Based on Problem-Solving Strategy: Analyzing Pre-Service Primary School Teachers' Performance

ERIC Educational Resources Information Center

Kiliç, Çigdem

2017-01-01

This study examined pre-service primary school teachers' performance in posing problems that require knowledge of problem-solving strategies. Quantitative and qualitative methods were combined. The 120 participants were asked to pose a problem that could be solved by using the find-a-pattern a particular problem-solving strategy. After that,…

Case of Two Electrostatics Problems: Can Providing a Diagram Adversely Impact Introductory Physics Students' Problem Solving Performance?

ERIC Educational Resources Information Center

Maries, Alexandru; Singh, Chandralekha

2018-01-01

Drawing appropriate diagrams is a useful problem solving heuristic that can transform a problem into a representation that is easier to exploit for solving it. One major focus while helping introductory physics students learn effective problem solving is to help them understand that drawing diagrams can facilitate problem solution. We conducted an…

School Leaders' Problem Framing: A Sense-Making Approach to Problem-Solving Processes of Beginning School Leaders

ERIC Educational Resources Information Center

Sleegers, Peter; Wassink, Hartger; van Veen, Klaas; Imants, Jeroen

2009-01-01

In addition to cognitive research on school leaders' problem solving, this study focuses on the situated and personal nature of problem framing by combining insights from cognitive research on problem solving and sense-making theory. The study reports the results of a case study of two school leaders solving problems in their daily context by…

The Place of Problem Solving in Contemporary Mathematics Curriculum Documents

ERIC Educational Resources Information Center

Stacey, Kaye

2005-01-01

This paper reviews the presentation of problem solving and process aspects of mathematics in curriculum documents from Australia, UK, USA and Singapore. The place of problem solving in the documents is reviewed and contrasted, and illustrative problems from teachers' support materials are used to demonstrate how problem solving is now more often…

Translation among Symbolic Representations in Problem-Solving. Revised.

ERIC Educational Resources Information Center

Shavelson, Richard J.; And Others

This study investigated the relationships among the symbolic representation of problems given to students to solve, the mental representations they use to solve the problems, and the accuracy of their solutions. Twenty eleventh-grade science students were asked to think aloud as they solved problems on the ideal gas laws. The problems were…

Using Students' Representations Constructed during Problem Solving to Infer Conceptual Understanding

ERIC Educational Resources Information Center

Domin, Daniel; Bodner, George

2012-01-01

The differences in the types of representations constructed during successful and unsuccessful problem-solving episodes were investigated within the context of graduate students working on problems that involve concepts from 2D-NMR. Success at problem solving was established by having the participants solve five problems relating to material just…

Errors and Understanding: The Effects of Error-Management Training on Creative Problem-Solving

ERIC Educational Resources Information Center

Robledo, Issac C.; Hester, Kimberly S.; Peterson, David R.; Barrett, Jamie D.; Day, Eric A.; Hougen, Dean P.; Mumford, Michael D.

2012-01-01

People make errors in their creative problem-solving efforts. The intent of this article was to assess whether error-management training would improve performance on creative problem-solving tasks. Undergraduates were asked to solve an educational leadership problem known to call for creative thought where problem solutions were scored for…

Encouraging Sixth-Grade Students' Problem-Solving Performance by Teaching through Problem Solving

ERIC Educational Resources Information Center

Bostic, Jonathan D.; Pape, Stephen J.; Jacobbe, Tim

2016-01-01

This teaching experiment provided students with continuous engagement in a problem-solving based instructional approach during one mathematics unit. Three sections of sixth-grade mathematics were sampled from a school in Florida, U.S.A. and one section was randomly assigned to experience teaching through problem solving. Students' problem-solving…

King Oedipus and the Problem Solving Process.

ERIC Educational Resources Information Center

Borchardt, Donald A.

An analysis of the problem solving process reveals at least three options: (1) finding the cause, (2) solving the problem, and (3) anticipating potential problems. These methods may be illustrated by examining "Oedipus Tyrannus," a play in which a king attempts to deal with a problem that appears to be beyond his ability to solve, and…

Problem Solving with the Elementary Youngster.

ERIC Educational Resources Information Center

Swartz, Vicki

This paper explores research on problem solving and suggests a problem-solving approach to elementary school social studies, using a culture study of the ancient Egyptians and King Tut as a sample unit. The premise is that problem solving is particularly effective in dealing with problems which do not have one simple and correct answer but rather…

The Effect of Learning Environments Based on Problem Solving on Students' Achievements of Problem Solving

ERIC Educational Resources Information Center

Karatas, Ilhan; Baki, Adnan

2013-01-01

Problem solving is recognized as an important life skill involving a range of processes including analyzing, interpreting, reasoning, predicting, evaluating and reflecting. For that reason educating students as efficient problem solvers is an important role of mathematics education. Problem solving skill is the centre of mathematics curriculum.…

Fast words boundaries localization in text fields for low quality document images

NASA Astrophysics Data System (ADS)

Ilin, Dmitry; Novikov, Dmitriy; Polevoy, Dmitry; Nikolaev, Dmitry

2018-04-01

The paper examines the problem of word boundaries precise localization in document text zones. Document processing on a mobile device consists of document localization, perspective correction, localization of individual fields, finding words in separate zones, segmentation and recognition. While capturing an image with a mobile digital camera under uncontrolled capturing conditions, digital noise, perspective distortions or glares may occur. Further document processing gets complicated because of its specifics: layout elements, complex background, static text, document security elements, variety of text fonts. However, the problem of word boundaries localization has to be solved at runtime on mobile CPU with limited computing capabilities under specified restrictions. At the moment, there are several groups of methods optimized for different conditions. Methods for the scanned printed text are quick but limited only for images of high quality. Methods for text in the wild have an excessively high computational complexity, thus, are hardly suitable for running on mobile devices as part of the mobile document recognition system. The method presented in this paper solves a more specialized problem than the task of finding text on natural images. It uses local features, a sliding window and a lightweight neural network in order to achieve an optimal algorithm speed-precision ratio. The duration of the algorithm is 12 ms per field running on an ARM processor of a mobile device. The error rate for boundaries localization on a test sample of 8000 fields is 0.3

The needs analysis of learning Inventive Problem Solving for technical and vocational students

NASA Astrophysics Data System (ADS)

Sai'en, Shanty; Tze Kiong, Tee; Yunos, Jailani Md; Foong, Lee Ming; Heong, Yee Mei; Mohaffyza Mohamad, Mimi

2017-08-01

Malaysian Ministry of Education highlighted in their National Higher Education Strategic plan that higher education’s need to focus adopting 21st century skills in order to increase a graduate’s employability. Current research indicates that most graduate lack of problem solving skills to help them securing the job. Realising the important of this skill hence an alternative way suggested as an option for high institution’s student to solve their problem. This study was undertaken to measure the level of problem solving skills, identify the needs of learning inventive problem solving skills and the needs of developing an Inventive problem solving module. Using a questionnaire, the study sampled 132 students from Faculty of Technical and Vocational Education. Findings indicated that majority of the students fail to define what is an inventive problem and the root cause of a problem. They also unable to state the objectives and goal thus fail to solve the problem. As a result, the students agreed on the developing Inventive Problem Solving Module to assist them.

Automation and adaptation: Nurses' problem-solving behavior following the implementation of bar coded medication administration technology.

PubMed

Holden, Richard J; Rivera-Rodriguez, A Joy; Faye, Héléne; Scanlon, Matthew C; Karsh, Ben-Tzion

2013-08-01

The most common change facing nurses today is new technology, particularly bar coded medication administration technology (BCMA). However, there is a dearth of knowledge on how BCMA alters nursing work. This study investigated how BCMA technology affected nursing work, particularly nurses' operational problem-solving behavior. Cognitive systems engineering observations and interviews were conducted after the implementation of BCMA in three nursing units of a freestanding pediatric hospital. Problem-solving behavior, associated problems, and goals, were specifically defined and extracted from observed episodes of care. Three broad themes regarding BCMA's impact on problem solving were identified. First, BCMA allowed nurses to invent new problem-solving behavior to deal with pre-existing problems. Second, BCMA made it difficult or impossible to apply some problem-solving behaviors that were commonly used pre-BCMA, often requiring nurses to use potentially risky workarounds to achieve their goals. Third, BCMA created new problems that nurses were either able to solve using familiar or novel problem-solving behaviors, or unable to solve effectively. Results from this study shed light on hidden hazards and suggest three critical design needs: (1) ecologically valid design; (2) anticipatory control; and (3) basic usability. Principled studies of the actual nature of clinicians' work, including problem solving, are necessary to uncover hidden hazards and to inform health information technology design and redesign.

Automation and adaptation: Nurses’ problem-solving behavior following the implementation of bar coded medication administration technology

PubMed Central

Holden, Richard J.; Rivera-Rodriguez, A. Joy; Faye, Héléne; Scanlon, Matthew C.; Karsh, Ben-Tzion

2012-01-01

The most common change facing nurses today is new technology, particularly bar coded medication administration technology (BCMA). However, there is a dearth of knowledge on how BCMA alters nursing work. This study investigated how BCMA technology affected nursing work, particularly nurses’ operational problem-solving behavior. Cognitive systems engineering observations and interviews were conducted after the implementation of BCMA in three nursing units of a freestanding pediatric hospital. Problem-solving behavior, associated problems, and goals, were specifically defined and extracted from observed episodes of care. Three broad themes regarding BCMA’s impact on problem solving were identified. First, BCMA allowed nurses to invent new problem-solving behavior to deal with pre-existing problems. Second, BCMA made it difficult or impossible to apply some problem-solving behaviors that were commonly used pre-BCMA, often requiring nurses to use potentially risky workarounds to achieve their goals. Third, BCMA created new problems that nurses were either able to solve using familiar or novel problem-solving behaviors, or unable to solve effectively. Results from this study shed light on hidden hazards and suggest three critical design needs: (1) ecologically valid design; (2) anticipatory control; and (3) basic usability. Principled studies of the actual nature of clinicians’ work, including problem solving, are necessary to uncover hidden hazards and to inform health information technology design and redesign. PMID:24443642

Do problem-solving skills affect success in nursing process applications? An application among Turkish nursing students.

PubMed

Bayindir Çevik, Ayfer; Olgun, Nermin

2015-04-01

This study aimed to determine the relationship between problem-solving and nursing process application skills of nursing. This is a longitudinal and correlational study. The sample included 71 students. An information form, Problem-Solving Inventory, and nursing processes the students presented at the end of clinical courses were used for data collection. Although there was no significant relationship between problem-solving skills and nursing process grades, improving problem-solving skills increased successful grades. Problem-solving skills and nursing process skills can be concomitantly increased. Students were suggested to use critical thinking, practical approaches, and care plans, as well as revising nursing processes in order to improve their problem-solving skills and nursing process application skills. © 2014 NANDA International, Inc.

Model and algorithm for container ship stowage planning based on bin-packing problem

NASA Astrophysics Data System (ADS)

Zhang, Wei-Ying; Lin, Yan; Ji, Zhuo-Shang

2005-09-01

In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage planning problem increases due to its multi-ports nature. This problem is NP-hard problem. In order to reduce the computational complexity, the problem is decomposed into two sub-problems in this paper. First, container ship stowage problem (CSSP) is regarded as “packing problem”, ship-bays on the board of vessel are regarded as bins, the number of slots at each bay are taken as capacities of bins, and containers with different characteristics (homogeneous containers group) are treated as items packed. At this stage, there are two objective functions, one is to minimize the number of bays packed by containers and the other is to minimize the number of overstows. Secondly, containers assigned to each bays at first stage are allocate to special slot, the objective functions are to minimize the metacentric height, heel and overstows. The taboo search heuristics algorithm are used to solve the subproblem. The main focus of this paper is on the first subproblem. A case certifies the feasibility of the model and algorithm.

Collis-Romberg Mathematical Problem Solving Profiles.

ERIC Educational Resources Information Center

Collis, K. F.; Romberg, T. A.

Problem solving has become a focus of mathematics programs in Australia in recent years, necessitating the assessment of students' problem-solving abilities. This manual provides a problem-solving assessment and teaching resource package containing four elements: (1) profiles assessment items; (2) profiles diagnostic forms for recording individual…

Tracing for the problem-solving ability in advanced calculus class based on modification of SAVI model at Universitas Negeri Semarang

NASA Astrophysics Data System (ADS)

Pujiastuti, E.; Waluya, B.; Mulyono

2018-03-01

There were many ways of solving the problem offered by the experts. The author combines various ways of solving the problem as a form of novelty. Among the learning model that was expected to support the growth of problem-solving skills was SAVI. The purpose, to obtain trace results from the analysis of the problem-solving ability of students in the Dual Integral material. The research method was a qualitative approach. Its activities include tests was filled with mathematical connections, observation, interviews, FGD, and triangulation. The results were: (1) some students were still experiencing difficulties in solving the problems. (2) The application of modification of SAVI learning model effective in supporting the growth of problem-solving abilities. (3) The strength of the students related to solving the problem, there were two students in the excellent category, there were three students in right classes and one student in the medium group.

Flexibility in Mathematics Problem Solving Based on Adversity Quotient

NASA Astrophysics Data System (ADS)

Dina, N. A.; Amin, S. M.; Masriyah

2018-01-01

Flexibility is an ability which is needed in problem solving. One of the ways in problem solving is influenced by Adversity Quotient (AQ). AQ is the power of facing difficulties. There are three categories of AQ namely climber, camper, and quitter. This research is a descriptive research using qualitative approach. The aim of this research is to describe flexibility in mathematics problem solving based on Adversity Quotient. The subjects of this research are climber student, camper student, and quitter student. This research was started by giving Adversity Response Profile (ARP) questioner continued by giving problem solving task and interviews. The validity of data measurement was using time triangulation. The results of this research shows that climber student uses two strategies in solving problem and doesn’t have difficulty. The camper student uses two strategies in solving problem but has difficulty to finish the second strategies. The quitter student uses one strategy in solving problem and has difficulty to finish it.

Analogy as a strategy for supporting complex problem solving under uncertainty.

PubMed

Chan, Joel; Paletz, Susannah B F; Schunn, Christian D

2012-11-01

Complex problem solving in naturalistic environments is fraught with uncertainty, which has significant impacts on problem-solving behavior. Thus, theories of human problem solving should include accounts of the cognitive strategies people bring to bear to deal with uncertainty during problem solving. In this article, we present evidence that analogy is one such strategy. Using statistical analyses of the temporal dynamics between analogy and expressed uncertainty in the naturalistic problem-solving conversations among scientists on the Mars Rover Mission, we show that spikes in expressed uncertainty reliably predict analogy use (Study 1) and that expressed uncertainty reduces to baseline levels following analogy use (Study 2). In addition, in Study 3, we show with qualitative analyses that this relationship between uncertainty and analogy is not due to miscommunication-related uncertainty but, rather, is primarily concentrated on substantive problem-solving issues. Finally, we discuss a hypothesis about how analogy might serve as an uncertainty reduction strategy in naturalistic complex problem solving.

Interference thinking in constructing students’ knowledge to solve mathematical problems

NASA Astrophysics Data System (ADS)

Jayanti, W. E.; Usodo, B.; Subanti, S.

2018-04-01

This research aims to describe interference thinking in constructing students’ knowledge to solve mathematical problems. Interference thinking in solving problems occurs when students have two concepts that interfere with each other’s concept. Construction of problem-solving can be traced using Piaget’s assimilation and accommodation framework, helping to know the students’ thinking structures in solving the problems. The method of this research was a qualitative method with case research strategy. The data in this research involving problem-solving result and transcripts of interviews about students’ errors in solving the problem. The results of this research focus only on the student who experience proactive interference, where student in solving a problem using old information to interfere with the ability to recall new information. The student who experience interference thinking in constructing their knowledge occurs when the students’ thinking structures in the assimilation and accommodation process are incomplete. However, after being given reflection to the student, then the students’ thinking process has reached equilibrium condition even though the result obtained remains wrong.

Insightful problem solving and emulation in brown capuchin monkeys.

PubMed

Renner, Elizabeth; Abramo, Allison M; Karen Hambright, M; Phillips, Kimberley A

2017-05-01

We investigated problem solving abilities of capuchin monkeys via the "floating object problem," a task in which the subject must use creative problem solving to retrieve a favored food item from the bottom of a clear tube. Some great apes have solved this problem by adding water to raise the object to a level at which it can be easily grabbed. We presented seven capuchins with the task over eight trials (four "dry" and four "wet"). None of the subjects solved the task, indicating that no capuchin demonstrated insightful problem solving under these experimental conditions. We then investigated whether capuchins would emulate a solution to the task. Seven subjects observed a human model solve the problem by pouring water from a cup into the tube, which brought the object to the top of the tube, allowing the subject to retrieve it. Subjects were then allowed to interact freely with an unfilled tube containing the object in the presence of water and objects that could be used to solve the task. While most subjects were unable to solve the task after viewing a demonstrator solve it, one subject did so, but in a unique way. Our results are consistent with some previous results in great ape species and indicate that capuchins do not spontaneously solve the floating object problem via insight.

Detecting math problem solving strategies: an investigation into the use of retrospective self-reports, latency and fMRI data.

PubMed

Tenison, Caitlin; Fincham, Jon M; Anderson, John R

2014-02-01

This research explores how to determine when mathematical problems are solved by retrieval versus computation strategies. Past research has indicated that verbal reports, solution latencies, and neural imaging all provide imperfect indicators of this distinction. Participants in the current study solved mathematical problems involving two distinct problem types, called 'Pyramid' and 'Formula' problems. Participants were given extensive training solving 3 select Pyramid and 3 select Formula problems. Trained problems were highly practiced, whereas untrained problems were not. The distinction between untrained and trained problems was observed in the data. Untrained problems took longer to solve, more often used procedural strategies and showed a greater activation in the horizontal intraparietal sulcus (HIPS) when compared to trained problems. A classifier fit to the neural distinction between trained-untrained problems successfully predicted training within and between the two problem types. We employed this classifier to generate a prediction of strategy use. By combining evidence from the classifier, problem solving latencies, and retrospective reports, we predicted the strategy used to solve each problem in the scanner and gained unexpected insight into the distinction between different strategies. Copyright © 2013 Elsevier Ltd. All rights reserved.

Problem solving therapy - use and effectiveness in general practice.

PubMed

Pierce, David

2012-09-01

Problem solving therapy (PST) is one of the focused psychological strategies supported by Medicare for use by appropriately trained general practitioners. This article reviews the evidence base for PST and its use in the general practice setting. Problem solving therapy involves patients learning or reactivating problem solving skills. These skills can then be applied to specific life problems associated with psychological and somatic symptoms. Problem solving therapy is suitable for use in general practice for patients experiencing common mental health conditions and has been shown to be as effective in the treatment of depression as antidepressants. Problem solving therapy involves a series of sequential stages. The clinician assists the patient to develop new empowering skills, and then supports them to work through the stages of therapy to determine and implement the solution selected by the patient. Many experienced GPs will identify their own existing problem solving skills. Learning about PST may involve refining and focusing these skills.

Collection of solved problems in physics

NASA Astrophysics Data System (ADS)

Koupilová, ZdeÅka; Mandíková, Dana; Snětinová, Marie

2017-01-01

To solve physics problems is a key ability which students should reach during their physics education. Ten years ago we started to develop a Collection of fully solved problems. The structure of problems' solutions is specially designed to substitute tutor's help during lesson and encourage students to solve at least some parts of a problem independently. Nowadays the database contains about 770 fully solved problems in physics in Czech, more than 100 problems in Polish and more than 140 problems in English. Other problems are still being translated. Except for physics problems, the Collection has also a mathematical part, which contains more than 300 fully solved problems in mathematics. This paper follows the presentation of the Collection of solved problems from previous years and introduces a new interface of the Collection, its enhanced functionality, new topics, newly created interface for teachers, user feedback and plans for future development. The database is placed at the website of the Department of Physics Education, Faculty of Mathematics and Physics, Charles University in Prague, the links are: http://reseneulohy.cz/fyzika (Czech version); http://www.physicstasks.eu/ (English version).

Pre-service mathematics teachers’ ability in solving well-structured problem

NASA Astrophysics Data System (ADS)

Paradesa, R.

2018-01-01

This study aimed to describe the mathematical problem-solving ability of undergraduate students of mathematics education in solving the well-structured problem. The type of this study was qualitative descriptive. The subjects in this study were 100 undergraduate students of Mathematics Education at one of the private universities in Palembang city. The data in this study was collected through two test items with essay form. The results of this study showed that, from the first problem, only 8% students can solve it, but do not check back again to validate the process. Based on a scoring rubric that follows Polya strategy, their answer satisfied 2 4 2 0 patterns. But, from the second problem, 45% students satisfied it. This is because the second problem imitated from the example that was given in learning process. The average score of undergraduate students mathematical problem-solving ability in solving well-structured problems showed 56.00 with standard deviation was 13.22. It means that, from 0 - 100 scale, undergraduate students mathematical problem-solving ability can be categorized low. From this result, the conclusion was undergraduate students of mathematics education in Palembang still have a problem in solving mathematics well-structured problem.

An Investigation on Chinese Teachers' Realistic Problem Posing and Problem Solving Ability and Beliefs

ERIC Educational Resources Information Center

Chen, Limin; Van Dooren, Wim; Chen, Qi; Verschaffel, Lieven

2011-01-01

In the present study, which is a part of a research project about realistic word problem solving and problem posing in Chinese elementary schools, a problem solving and a problem posing test were administered to 128 pre-service and in-service elementary school teachers from Tianjin City in China, wherein the teachers were asked to solve 3…

Problem-solving skills and perceived stress among undergraduate students: The moderating role of hardiness.

PubMed

Abdollahi, Abbas; Abu Talib, Mansor; Carlbring, Per; Harvey, Richard; Yaacob, Siti Nor; Ismail, Zanariah

2016-06-01

This study was designed to examine the relationships between problem-solving skills, hardiness, and perceived stress and to test the moderating role of hardiness in the relationship between problem-solving skills and perceived stress among 500 undergraduates from Malaysian public universities. The analyses showed that undergraduates with poor problem-solving confidence, external personal control of emotion, and approach-avoidance style were more likely to report perceived stress. Hardiness moderated the relationships between problem-solving skills and perceived stress. These findings reinforce the importance of moderating role of hardiness as an influencing factor that explains how problem-solving skills affect perceived stress among undergraduates.