Hierarchically Tiled Array as a High-Level Abstraction for Codelets

2014 ◽  
Author(s):  
Chih-Chieh Yang ◽  
Juan C. Pichel ◽  
Adam R. Smith ◽  
David A. Padua
Keyword(s):  
High Level ◽  
High Level Abstraction

scholarly journals A New QoS Routing Northbound Interface for SDN

2017 ◽  
Vol 5 (1) ◽  
pp. 92-115
Author(s):  
Siamak Layeghy ◽  
Farzaneh Pakzad ◽  
Marius Portmann
Keyword(s):  
Constraint Programming ◽  
Traffic Engineering ◽  
Qos Routing ◽  
Modelling Language ◽  
Routing Problem ◽  
Programming Techniques ◽  
Network Topologies ◽  
High Level ◽  
Basic Constraint ◽  
High Level Abstraction

In this paper, we introduce SCOR (Software-defined Constrained Optimal Routing), a new Software Defined Networking (SDN) Northbound Interface for QoS routing and traffic engineering. SCOR is based on constraint-programming techniques and is implemented in the MiniZinc modelling language. It provides a powerful, high-level abstraction layer, consisting of 10 basic constraint-programming predicates. A key feature of SCOR is that it is declarative, where only the constraints and utility function of the routing problem need to be expressed, and the complexity of solving the problem is hidden from the user, and handled by a powerful generic solver. We show that the interface (set of predicates) of SCOR is sufficiently expressive to handle all the known and relevant QoS routing problems. We further demonstrate the practicality and scalability of the approach via a number of example scenarios, with varying network topologies, network sizes and number of flows.

A Logic-Based Typology of Science and Theology

1996 ◽  
Vol 8 (1) ◽  
pp. 149-167
Author(s):  
K. Helmut Reich ◽  
Keyword(s):  
New Age ◽  
Symbolic Logic ◽  
Logical Relationship ◽  
Dialectical Logic ◽  
Relationship Types ◽  
Science And Theology ◽  
High Level ◽  
Logical Types ◽  
High Level Abstraction

The classification, comparison, and evaluation of science-theology relationships is facilitated by employing a high-level abstraction, such as a logic-based typology. The application of formal symbolic logic, fact-related dialectical logic, and the logic of complementarity yields six logical relationship types. Typologies proposed by leading exponents of science-theology interfaces like Barbour, Bube, Drees, Hefner, Miller, Peacocke, and Russell are examined in terms of logical types. Since both science and theology have a role in individual and societal life, the types "overlap" and "complementarity" look particularly promising: the distinctiveness of each domain is recognized, but also their linkages. An analysis of the New Age worldview highlights its deficiencies and suggests an elaboration of more complex logical types as combinations of basic types.

scholarly journals Block-structured compressible Navier–Stokes solution using the OPS high-level abstraction

2016 ◽  
Vol 30 (6) ◽  
pp. 450-454 ◽  
Author(s):  
Satya P. Jammy ◽  
Gihan R. Mudalige ◽  
Istvan Z. Reguly ◽  
Neil D. Sandham ◽  
Mike Giles
Keyword(s):  
Navier Stokes ◽  
High Level ◽  
High Level Abstraction ◽  
Block Structured

A HIGH-ORDER GRAPH GENERATING SELF–ORGANIZING STRUCTURE

2005 ◽  
Vol 15 (05) ◽  
pp. 349-355
Author(s):  
RICCARDO RIZZO
Keyword(s):  
Neural Network ◽  
Large Class ◽  
General Structure ◽  
Network Models ◽  
High Order ◽  
Neural Network Models ◽  
Fixed Topology ◽  
High Level ◽  
High Level Abstraction ◽  
Self Organizing

A large class of neural network models have their units organized in a lattice with fixed topology or generate their topology during the learning process. These network models can be used as neighborhood preserving map of the input manifold, but such a structure is difficult to manage since these maps are graphs with a number of nodes that is just one or two orders of magnitude less than the number of input points (i.e., the complexity of the map is comparable with the complexity of the manifold) and some hierarchical algorithms were proposed in order to obtain a high-level abstraction of these structures. In this paper a general structure capable to extract high order information from the graph generated by a large class of self–organizing networks is presented. This algorithm will allow to build a two layers hierarchical structure starting from the results obtained by using the suitable neural network for the distribution of the input data. Moreover the proposed algorithm is also capable to build a topology preserving map if it is trained using a graph that is also a topology preserving map.

A proposed new high level abstraction for computer technology

2001 ◽  
Vol 33 (1) ◽  
pp. 199-203
Author(s):  
S. P. Maj ◽  
D. Veal ◽  
R. Duley
Keyword(s):  
Computer Technology ◽  
High Level ◽  
High Level Abstraction
Sign in / Sign up

Export Citation Format

Share Document