Search results

1 – 10 of over 21000
To view the access options for this content please click here
Article
Publication date: 1 January 1976

MICHAEL A. BAUER

The notion of a computation graph is introduced. A computation graph is a rooted, directed graph whose nodes are labelled by statements (instructions) to be executed. The…

Abstract

The notion of a computation graph is introduced. A computation graph is a rooted, directed graph whose nodes are labelled by statements (instructions) to be executed. The motivation for developing computation graphs comes from a desire to represent programs by well‐defined, manipulable structures and to permit search (especially backtracking) to be a natural part of the execution of such programs. This initial work considers very simple computation graphs where the only statements that can be executed are assignment statements and tests. Procedure calls, parameter passing, etc. are not considered. The execution rule for computation graphs is based upon search procedures. The computation rule presented permits a computation graph to be executed depth first, breadth first or using a combination of both. This is done by defining functions, which are arguments to the computation rule, to control the traversal of the graph. The use of the rule is illustrated by describing functions to permit the rule to execute the same graph depth first and breadth first.

Details

Kybernetes, vol. 5 no. 1
Type: Research Article
ISSN: 0368-492X

To view the access options for this content please click here
Article
Publication date: 1 March 2001

David Finkel, Craig E. Wills, Michael J. Ciaraldi, Kevin Amorin, Adam Covati and Michael Lee

Anonymous distributed computing systems consist of potentially millions of heterogeneous processing nodes connected by the global Internet. These nodes can be…

Abstract

Anonymous distributed computing systems consist of potentially millions of heterogeneous processing nodes connected by the global Internet. These nodes can be administered by thousands of organizations and individuals, with no direct knowledge of each other. This work defines anonymous distributed computing systems in general then focuses on the specifics of an applet‐based approach for large‐scale, anonymous, distributed computing on the Internet. A user wishing to participate in a computation connects to a distribution server, which provides information about available computations, and then connects to a computation server with a computation to distribute. A Java class is downloaded, which communicates with the computation server to obtain data, performs the computation, and returns the result. Since any computer on the Internet can participate in these computations, potentially a large number of computers can participate in a single computation.

Details

Internet Research, vol. 11 no. 1
Type: Research Article
ISSN: 1066-2243

Keywords

To view the access options for this content please click here
Article
Publication date: 17 June 2019

Lamya Abdullah and Juan Quintero

The purpose of this study is to propose an approach to avoid having to trust a single entity in cloud-based applications. In cloud computing, data processing is delegated…

Abstract

Purpose

The purpose of this study is to propose an approach to avoid having to trust a single entity in cloud-based applications. In cloud computing, data processing is delegated to a remote party for efficiency and flexibility reasons. A practical user requirement usually is data privacy; hence, the confidentiality and integrity of data processing needs to be protected. In the common scenarios of cloud computing today, this can only be achieved by assuming that the remote party does not in any form act maliciously.

Design/methodology/approach

An approach that avoids having to trust a single entity is proposed. This approach is based on two concepts: the technical abstraction of sealed computation, i.e. a technical mechanism to confine a privacy-aware processing of data within a tamper-proof hardware container, and the role of an auditing party that itself cannot add functionality to the system but is able to check whether the system (including the mechanism for sealed computation) works as expected.

Findings

Discussion and analysis of the abstract, technical and procedural requirements of these concepts and how they can be applied in practice are explained.

Originality/value

A preliminary version of this paper was published in the proceedings of the second International Workshop on SECurity and Privacy Requirements Engineering (SECPRE, 2018).

Details

Information & Computer Security, vol. 27 no. 5
Type: Research Article
ISSN: 2056-4961

Keywords

To view the access options for this content please click here
Article
Publication date: 1 March 1999

David Finkel, Craig E. Wills, Brian Brennan and Chris Brennan

Describes a system for using the World Wide Web to distribute computational tasks to multiple hosts on the Web. A programmer with a computation to distribute registers it…

Abstract

Describes a system for using the World Wide Web to distribute computational tasks to multiple hosts on the Web. A programmer with a computation to distribute registers it with a Web server. An idle host uses this server to identify available computations and downloads a Java class to perform the computation ‐ we call this class a distriblet. The paper describes the programs written to carry out the load distribution, the structure of a distriblet class, and our experience in using this system.

Details

Internet Research, vol. 9 no. 1
Type: Research Article
ISSN: 1066-2243

Keywords

To view the access options for this content please click here
Article
Publication date: 1 June 2000

A. Savini

Gives introductory remarks about chapter 1 of this group of 31 papers, from ISEF 1999 Proceedings, in the methodologies for field analysis, in the electromagnetic…

Abstract

Gives introductory remarks about chapter 1 of this group of 31 papers, from ISEF 1999 Proceedings, in the methodologies for field analysis, in the electromagnetic community. Observes that computer package implementation theory contributes to clarification. Discusses the areas covered by some of the papers ‐ such as artificial intelligence using fuzzy logic. Includes applications such as permanent magnets and looks at eddy current problems. States the finite element method is currently the most popular method used for field computation. Closes by pointing out the amalgam of topics.

Details

COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, vol. 19 no. 2
Type: Research Article
ISSN: 0332-1649

Keywords

To view the access options for this content please click here
Article
Publication date: 14 December 2018

Yicha Zhang, Ramy Harik, Georges Fadel and Alain Bernard

For part models with complex shape features or freeform shapes, the existing build orientation determination methods may have issues, such as difficulty in defining…

Abstract

Purpose

For part models with complex shape features or freeform shapes, the existing build orientation determination methods may have issues, such as difficulty in defining features and costly computation. To deal with these issues, this paper aims to introduce a new statistical method to develop fast automatic decision support tools for additive manufacturing build orientation determination.

Design/methodology/approach

The proposed method applies a non-supervised machine learning method, K-Means Clustering with Davies–Bouldin Criterion cluster measuring, to rapidly decompose a surface model into facet clusters and efficiently generate a set of meaningful alternative build orientations. To evaluate alternative build orientations at a generic level, a statistical approach is defined.

Findings

A group of illustrative examples and comparative case studies are presented in the paper for method validation. The proposed method can help production engineers solve decision problems related to identifying an optimal build orientation for complex and freeform CAD models, especially models from the medical and aerospace application domains with much efficiency.

Originality/value

The proposed method avoids the limitations of traditional feature-based methods and pure computation-based methods. It provides engineers a new efficient decision-making tool to rapidly determine the optimal build orientation for complex and freeform CAD models.

Details

Rapid Prototyping Journal, vol. 25 no. 1
Type: Research Article
ISSN: 1355-2546

Keywords

To view the access options for this content please click here
Article
Publication date: 1 March 2005

Andrzej Jordan, Jarosław Forenc and Marek Tudruj

To present a new parallel method for solving differential equations that describe transient states in physical systems.

Abstract

Purpose

To present a new parallel method for solving differential equations that describe transient states in physical systems.

Design/methodology/approach

The proposed speculative method first solves a differential equation with a large integration step to determine initial data for parallel computations in sub‐intervals of time, then speculatively computes in parallel solutions in all the sub‐intervals with a smaller integration step and finally composes the final solution from the speculatively computed ones. The basic numerical method applied is the well‐known Runge‐Kutta algorithm.

Findings

The speculative method allows important reduction of the computation time of sequential algorithms. The speed‐up of the speculative method that we propose, as compared to the sequential execution, depends on the number of sub‐intervals that are defined inside the total analysed time interval. The speed‐up increases almost linearly with the number of sub‐intervals. The good accuracy of computations in the presented example was obtained.

Research limitations/implications

The proposed method can be applied to non‐linear systems without discontinuity points and to stable systems (i.e. systems insensitive to the selection of initial conditions).

Practical implications

The method can be especially applied for long‐lasting computations with a slow convergence of state variables values along with the decrease of integration steps.

Originality/value

The paper presents an original parallel method for solving differential equations, which significantly speeds up transient states analysis in physical systems.

Details

COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, vol. 24 no. 1
Type: Research Article
ISSN: 0332-1649

Keywords

To view the access options for this content please click here
Article
Publication date: 1 February 1996

Jaroslav Mackerle

Presents a review on implementing finite element methods on supercomputers, workstations and PCs and gives main trends in hardware and software developments. An appendix…

Abstract

Presents a review on implementing finite element methods on supercomputers, workstations and PCs and gives main trends in hardware and software developments. An appendix included at the end of the paper presents a bibliography on the subjects retrospectively to 1985 and approximately 1,100 references are listed.

Details

Engineering Computations, vol. 13 no. 1
Type: Research Article
ISSN: 0264-4401

Keywords

Content available

Abstract

Details

Kybernetes, vol. 41 no. 7/8
Type: Research Article
ISSN: 0368-492X

To view the access options for this content please click here
Article
Publication date: 14 June 2021

Shengpei Zhou, Zhenting Chang, Haina Song, Yuejiang Su, Xiaosong Liu and Jingfeng Yang

With the continuous technological development of automated driving and expansion of its application scope, the types of on-board equipment continue to be enriched and the…

Abstract

Purpose

With the continuous technological development of automated driving and expansion of its application scope, the types of on-board equipment continue to be enriched and the computing capabilities of on-board equipment continue to increase and corresponding applications become more diverse. As the applications need to run on on-board equipment, the requirements for the computing capabilities of on-board equipment become higher. Mobile edge computing is one of the effective methods to solve practical application problems in automated driving.

Design/methodology/approach

In this study, in accordance with practical requirements, this paper proposed an optimal resource management allocation method of autonomous-vehicle-infrastructure cooperation in a mobile edge computing environment and conducted an experiment in practical application.

Findings

The design of the road-side unit module and its corresponding real-time operating system task coordination in edge computing are proposed in the study, as well as the method for edge computing load integration and heterogeneous computing. Then, the real-time scheduling of highly concurrent computation tasks, adaptive computation task migration method and edge server collaborative resource allocation method is proposed. Test results indicate that the method proposed in this study can greatly reduce the task computing delay, and the power consumption generally increases with the increase of task size and task complexity.

Originality/value

The results showed that the proposed method can achieve lower power consumption and lower computational overhead while ensuring the quality of service for users, indicating a great application prospect of the method.

Details

Assembly Automation, vol. ahead-of-print no. ahead-of-print
Type: Research Article
ISSN: 0144-5154

Keywords

1 – 10 of over 21000