952 resultados para subtraction solving
Resumo:
One of the major planks of some visions for E-Gov is that there is a willing participatory group who are more than happy to be involved in new forms of democracy and will be active and useful suppliers of input to e-consultation or e-participation processes. This group is different from that which goes online to the government site web and signs a petition asking the prime minister to resign. It is becoming clear, though, that the commitment to e-participation may well be there in theory, but difficult to access in practice. Further, the participation which is most welcome can frequently require training and expertise which is not widely available or there may be differences in opinion as to the point of participation. In this paper I will look to the attempts to encourage participation in the patent system. The UK is about to initiate a trial system utilising New York Law School’s Peer To Patent project, but has also attempted to involve participants in previous consultation exercises. I will use these as demonstrations of the sorts of problems which e-participation has met, and consider whether this new form of E-Gov is perhaps being oversold. The interesting question is whether participation is a growing tool which can ensure better public services from the State. My conclusion is that consultation and participatory projects can demonstrate involvement and are certainly educative but e-participatory projects are most likely incapable of achieving the goals set by their more optimistic advocates. The paper emphasises the patents field, but the lessons from it can – I suggest – be viewed as indicators having wider governance relevance. The primary point being made is that the technocratic view is always over-optimistic.
Resumo:
Nonclassical states of a mechanical mode at nonzero temperature are achieved in a scheme that combines radiation-pressure coupling to a light field and photon subtraction. The scheme embodies an original and experimentally realistic way to obtain mesoscopic quantumness by putting together two mature technologies for quantum control. The protocol is quasi-insensitive to mechanical damping.
Resumo:
The problem of diffraction of an optical wave by a 2D periodic metal aperture array with square, circular, and ring apertures is solved with allowance for the finite permittivity of a metal in the optical band. The correctness of the obtained results is verified through comparison with experimental data. It is shown that the transmission coefficient can be substantially greater than the corresponding value reached in the case of diffraction by a grating in a perfectly conducting screen.
Resumo:
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation, which is a generalisation of the feedback vertex set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. We study all these formulations by experimentally comparing them on a variety of randomly generated instances of the feature subscription problem.
Resumo:
The study investigated problem solving ability in schizophrenia. Thirty DSM-IIIR schizophrenic patients and 27 matched normal controls were tested on the Three-Dimensional Computerised Tower of London Test (3-D CTL Test) (Morris et al., 1993). The patients took significantly more moves to solve a series of problems and solved significantly fewer problems in the predetermined minimum number of moves. The patients response times, as measured using a control version of the task (the 3-D CTL Control), were longer than those of the controls. However, when latencies were adjusted to take into account the slower responses overall, the patients planning times were not significantly increased. Inaccurate planning, as defined by taking more moves, did not correlate with either positive or negative symptoms, but the response times tended to be longer in patients who had more negative symptoms. The findings suggest that there is a deficit in problem solving activity in schizophrenia that may be associated with translating 'willed intentions' into action, independent of slower motor speed.
Resumo:
Problem-solving ability was investigated in 25 DSM-IIIR schizophrenic (SC) patients using the Tower of Hanoi (TOH) task. Their performance was compared to that of: (1) 22 patients with neurosurgical unilateral prefrontal lesions, 11 left (LF) and 10 right hemisphere (RF); (2) 38 patients with unilateral temporal lobectomies, 19 left (LT) and 19 right (RT); and (3) 44 matched control subjects. Like the RT and LF group, the schizophrenics were significantly impaired on the TOH. The deficit shown by the schizophrenic group was equivalent whether or not the problems to be solved included goal-subgoal conflicts, unlike the LF group who were impaired specifically on these problems. The nature of the SC deficit was also distinct from that of the RT group, in that the problem-solving deficit remained after controlling for the effects of spatial memory performance. This study indicates, therefore, that neither focal frontal nor temporal lobe damage sustained in adult life is a sufficient explanation for the problem-solving deficits found in patients with schizophrenia. (C) 1999 Elsevier Science B.V. All rights reserved.
Resumo:
Mixture of Gaussians (MoG) modelling [13] is a popular approach to background subtraction in video sequences. Although the algorithm shows good empirical performance, it lacks theoretical justification. In this paper, we give a justification for it from an online stochastic expectation maximization (EM) viewpoint and extend it to a general framework of regularized online classification EM for MoG with guaranteed convergence. By choosing a special regularization function, l1 norm, we derived a new set of updating equations for l1 regularized online MoG. It is shown empirically that l1 regularized online MoG converge faster than the original online MoG .
Resumo:
Since the first launch of the new engineering contract (NEC) in 1993, early warning of problems has been widely recognized as an important approach of proactive management during a construction or engineering project. Is early warning really effective for the improvement of problem solving and project performance? This is a research question that still lacks a good answer. For this reason, an empirical investigation was made in the United Kingdom (U.K.) to answer the question. This study adopts a combination of literature review, expert interview, and questionnaire survey. Nearly 100 questionnaire responses were collected from the U.K. construction industry, based on which the use of early warning under different forms of contract is compared in this paper. Problem solving and project performance are further compared between the projects using early warning and the projects not using early warning. The comparison provides clear evidence for the significant effect of early warning on problem solving and project performance in terms of time, cost, and quality. Subsequently, an input-process-output model is developed in this paper to explore the relationship among early warning, problem solving, and project
performance. All these help construction researchers and practitioners to better understand the role of early warning in ensuring project success.
Resumo:
In this paper we describe the design of a parallel solution of the inhomogeneous Schrodinger equation, which arises in the construction of continuum orbitals in the R-matrix theory of atomic continuum processes. A prototype system is described which has been programmed in occam2 and implemented on a bi-directional pipeline of transputers. Some timing results for the prototype system are presented, and the development of a full production system is discussed.
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
Resumo:
Influence diagrams are intuitive and concise representations of structured decision problems. When the problem is non-Markovian, an optimal strategy can be exponentially large in the size of the diagram. We can avoid the inherent intractability by constraining the size of admissible strategies, giving rise to limited memory influence diagrams. A valuable question is then how small do strategies need to be to enable efficient optimal planning. Arguably, the smallest strategies one can conceive simply prescribe an action for each time step, without considering past decisions or observations. Previous work has shown that finding such optimal strategies even for polytree-shaped diagrams with ternary variables and a single value node is NP-hard, but the case of binary variables was left open. In this paper we address such a case, by first noting that optimal strategies can be obtained in polynomial time for polytree-shaped diagrams with binary variables and a single value node. We then show that the same problem is NP-hard if the diagram has multiple value nodes. These two results close the fixed-parameter complexity analysis of optimal strategy selection in influence diagrams parametrized by the shape of the diagram, the number of value nodes and the maximum variable cardinality.
Resumo:
We present a new algorithm for exactly solving decision-making problems represented as an influence diagram. We do not require the usual assumptions of no forgetting and regularity, which allows us to solve problems with limited information. The algorithm, which implements a sophisticated variable elimination procedure, is empirically shown to outperform a state-of-the-art algorithm in randomly generated problems of up to 150 variables and 10^64 strategies.