E-Participation and E-Participants: solving the patent ‘crisis’

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.

Image segmentation based on multi-scan constraint satisfaction neural network

A novel image segmentation method based on a constraint satisfaction neural network (CSNN) is presented. The new method uses CSNN-based relaxation but with a modified scanning scheme of the image. The pixels are visited with more distant intervals and wider neighborhoods in the first level of the algorithm. The intervals between pixels and their neighborhoods are reduced in the following stages of the algorithm. This method contributes to the formation of more regular segments rapidly and consistently. A cluster validity index to determine the number of segments is also added to complete the proposed method into a fully automatic unsupervised segmentation scheme. The results are compared quantitatively by means of a novel segmentation evaluation criterion. The results are promising.

Solving the problem of diffraction of an optical-band electromagnetic wave by metal nanostructured aperture arrays with the use of the method of impedance boundary conditions

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.

Improved conjugate gradient implementation for least squares support vector machines

As a promising method for pattern recognition and function estimation, least squares support vector machines (LS-SVM) express the training in terms of solving a linear system instead of a quadratic programming problem as for conventional support vector machines (SVM). In this paper, by using the information provided by the equality constraint, we transform the minimization problem with a single equality constraint in LS-SVM into an unconstrained minimization problem, then propose reduced formulations for LS-SVM. By introducing this transformation, the times of using conjugate gradient (CG) method, which is a greatly time-consuming step in obtaining the numerical solution, are reduced to one instead of two as proposed by Suykens et al. (1999). The comparison on computational speed of our method with the CG method proposed by Suykens et al. and the first order and second order SMO methods on several benchmark data sets shows a reduction of training time by up to 44%. (C) 2011 Elsevier B.V. All rights reserved.

PROBLEM-SOLVING IN SCHIZOPHRENIA - A SPECIFIC DEFICIT IN PLANNING ABILITY

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.

Problem-solving and spatial working memory in patients with schizophrenia and with focal frontal and temporal lobe lesions

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.

Constraint rule-based programming of norms for electronic institutions

Norms constitute a powerful coordination mechanism among heterogeneous agents. In this paper, we propose a rule language to specify and explicitly manage the normative positions of agents (permissions, prohibitions and obligations), with which distinct deontic notions and their relationships can be captured. Our rule-based formalism includes constraints for more expressiveness and precision and allows to supplement (and implement) electronic institutions with norms. We also show how some normative aspects are given computational interpretation. © 2008 Springer Science+Business Media, LLC.

Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments

The scheduling problem in distributed data-intensive computing environments has become an active research topic due to the tremendous growth in grid and cloud computing environments. As an innovative distributed intelligent paradigm, swarm intelligence provides a novel approach to solving these potentially intractable problems. In this paper, we formulate the scheduling problem for work-flow applications with security constraints in distributed data-intensive computing environments and present a novel security constraint model. Several meta-heuristic adaptations to the particle swarm optimization algorithm are introduced to deal with the formulation of efficient schedules. A variable neighborhood particle swarm optimization algorithm is compared with a multi-start particle swarm optimization and multi-start genetic algorithm. Experimental results illustrate that population based meta-heuristics approaches usually provide a good balance between global exploration and local exploitation and their feasibility and effectiveness for scheduling work-flow applications. © 2010 Elsevier Inc. All rights reserved.