Increased use of machine vision systems is making a significant contribution to ensuring competitiveness in modern manufacturing. However, the multi-disciplinary nature of machine vision necessitates a high level of c...
详细信息
Increased use of machine vision systems is making a significant contribution to ensuring competitiveness in modern manufacturing. However, the multi-disciplinary nature of machine vision necessitates a high level of competence in a diverse range of subjects. These factors have resulted in a shortage of qualified machine vision engineers. Overcoming this skills shortage can be approached in two ways; the education of more machine vision engineers or a reduction in the time taken to design and implement a machine vision system. One possible solution to both these problems is the use of an intelligent design tool that will aid an engineer in designing a complete machine vision system. This work focuses on one component of such a tool, a hybrid intelligent system to aid in the selection of algorithms for use in a particular machine vision task. The approach taken in this work belongs to the more general category of systems for the intelligent supervision of a library of operators and as such can be generalized to other applications and domains. The system design is based around an evolutionary algorithm (EA), case based reasoning (CBR) and rule based reasoning (RBR) architectures.
Constant innovation and product evolution in the area of embedded systems necessitates educational institutions and other training providers to continuingly reassess the content of engineering curricula in the context...
详细信息
Constant innovation and product evolution in the area of embedded systems necessitates educational institutions and other training providers to continuingly reassess the content of engineering curricula in the context of this developing field. Increasingly Web based distance education courses are on offer, augmented by the provision of remote experimentation laboratories facilitating distant access to campus based physical resources. This migration to a remote experimentation platform requires substantial financial investment and time commitments. However remote experimentation provision may lack flexibility in terms of concurrent usage typically restricted to synchronous access by single users through resource timetabling. This paper details our recent experiences in the provision of remote experimentation facilities for embedded system training. The paper focuses on the development costs incurred, the cost effectiveness of the approach and issues related to scalability and the delivery of asynchronous learning facilities in the context of remotely accessible embedded systems
Inter-organizational systems (IOS) that enable cross-enterprise value creation have moved in the focus of both the scientific and business community. However, a lack of formal methodological backing, and the absence o...
详细信息
The focus of the thesis is to develop algorithms for enabling and executing automated compatibility tests for business related aspects of software components. Compatibility tests are necessary for the identification o...
详细信息
Compositional reuse of software components requires standardized specification techniques if applications are created by combining third party components. Adequate techniques need to be used in order to specify not on...
详细信息
In this paper, we propose a new method which makes transient simulation faster for the circuit including both nonlinear and linear elements. First, the method for generating the projection matrix with Krylovsubspace t...
详细信息
In this paper, we propose a new method which makes transient simulation faster for the circuit including both nonlinear and linear elements. First, the method for generating the projection matrix with Krylovsubspace technique is described. The order of the circuit equation is reduced by congruence transformation with the projection matrix. Next, we suggest a method which can calculate the reduced Jacobian matrix directly in each Newton-Raphson iteration. Since this technique does not need to calculate the original size of Jacobian matrix, the calculation cost is reduced drastically. Therefore, efficient circuit simulation can be achieved. Finally, our method is applied to some example circuits and the validity of the nonlinear circuit reduction technique is verified.
In this paper, we study how to collect n balls moving with constant velocities in the Euclidean plane by k robots moving on straight track-lines through the origin. Since all the balls might not be caught by robots, d...
详细信息
We propose a declaration and validation method for finite state machine specification in an initial design phase of a user interface. The declaration is based on mathematical algebra. The validation has an input of th...
详细信息
We propose a declaration and validation method for finite state machine specification in an initial design phase of a user interface. The declaration is based on mathematical algebra. The validation has an input of the algebra and is done based on C.A.R. Hoare's (1973) effort using a prepared axiom set. The algebraic declaration is transferred to an assertion and validated for a specific subject. This methodology has the advantage of mathematical robustness and flexibility to cover a lot of dynamic models. We developed a prototype system using Mathematica and used VWC (visual wireless communicator) as a test case for declaration and validation. We report on the background, subjects, the fundamental method, and implementation and validation of the declared VWC specification.
In this paper, we study how to collect n balls moving with constant velocities in the Euclidean plane by k robots moving on straight track-lines through the origin. Since all the balls might not be caught by robots, d...
详细信息
In this paper, we study how to collect n balls moving with constant velocities in the Euclidean plane by k robots moving on straight track-lines through the origin. Since all the balls might not be caught by robots, differently from Moving-Target TSP, we consider the following 3 problems in various situations: (i) deciding if k robots can collect all n balls, (ii) maximizing the number of the balls collected by k robots, and (iii) minimizing the number of the robots to collect all n balls. The situations considered here contain the cases in which track-lines are given (or not), and track-lines are identical (or not). For all problems and situations, we provide polynomial time algorithms or proofs of intractability, which clarify the tractability-intractability frontier in the ball collecting problems in the Euclidean plane.
暂无评论