Our aim was to study what kind of bases can be provided to understand the basic terms of differential equation through teaching mathematical material in secondary school and to what extent this basis has to be expanded so that we can help the demonstration of differential equation. So if we give up the usual expansion of mathematical device we have to find another method which is easy to algori...

We introduce the dynamic SAT problem, a generalisation of the satisfiability problem in propositional logic which allows changes of a problem over time. DynSAT can be seen as a particular form of a dynamic CSP, but considering results and recent success in solving conventional SAT problems, we believe that the conceptual simplicity of SAT will allow us to more easily devise and investigate high...

Given a graph G, we investigate the problem of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph homomorphism problems are either polynomial-time solvable or ⊕P–complete, and provide a conjectured characterisation of the easy cases. We show that the conjecture is t...

Meeting transcription is a very useful and challenging task. The majority of research to date has focused on individual meeting, or only a small group of meetings. In many practical deployments, multiple related meetings will take place over a long period of time. This paper describes an initial investigation of how this long-term data can be used to improve meeting transcription. A corpus of t...

Single crystalline ZnSe nanowires were fabricated on GaAs substrates by molecular beam epitaxy technique via Au-catalyzed vapor-liquid-solid reaction. The nucleation and initial growth of the nanowires were investigated by high-resolution transmission electron microscopy. It was revealed that Au catalysts initially reacted with the substrate forming binary AuGa2 alloy droplets. The sizes of the...

Multi-valued networks provide a simple yet expressive qualitative state based modelling approach for biological systems. In this paper we develop an abstraction theory for asynchronous multi-valued network models that allows the state space of a model to be reduced while preserving key properties of the model. The abstraction theory therefore provides a mechanism for coping with the state space...

It is appealing to imagine software packages that provide personally tailored product recommendations to a consumer. One way to predict the rating of a particular product by a particular consumer is through inference from a database of previous ratings by many consumers of many products. Such a database consists of triplets of the form: (product-identi er, consumer-identi er, rating) Generally ...

When using Simple Temporal Networks, it may be that not all constraints must be met, rather that they should be met if possible with some degree of preference. To express this, a utility value is added to represent the importance of some temporal constraints. Various search procedures are looked at to try to maximise the total utility whilst still maintaining consistency. It is found that a gre...

Very little has been published on best practice approaches to managing eBusiness change for SMEs, particularly at the level of the small business. SMEs are however increasingly implementing more advanced eBusiness solutions, and in turn could benefit from adopting a more informed manner to taking on some of these change management challenges. This potentially has implications in terms of the lo...

In this work, we present the concept of Continuous Search, the objective of which is to allow any user to eventually get top performance from their constraint solver. Unlike previous approaches (see [9] for a recent survey), Continuous Search does not require the disposal of a large set of representative instances to properly train and learn parameters. It only assumes that once the solver runs...