Declarative definition of group indexed data structures and approximation of their domains

2001 ◽  
Author(s):  
Jean-Louis Giavitto ◽  
Olivier Michel
Keyword(s):  
Data Structures ◽  
Definition Of

scholarly journals The Proposal of a Evolutionary Strategy Generating the Data Structures Based on a Horizontal Tree for the Tests

2016 ◽  
Vol 23 (3) ◽  
pp. 145-149
Author(s):  
Marek Żukowicz ◽  
Michał Markiewicz
Keyword(s):  
Mathematical Model ◽  
Evolutionary Algorithm ◽  
Computer Science ◽  
Data Structures ◽  
Evolutionary Strategy ◽  
Future Research ◽  
Object Model ◽  
The Third ◽  
Testing Data ◽  
Definition Of

Abstract The aim of the article is to present a mathematical definition of the object model, that is known in computer science as TreeList and to show application of this model for design evolutionary algorithm, that purpose is to generate structures based on this object. The first chapter introduces the reader to the problem of presenting data using the TreeList object. The second chapter describes the problem of testing data structures based on TreeList. The third one shows a mathematical model of the object TreeList and the parameters, used in determining the utility of structures created through this model and in evolutionary strategy, that generates these structures for testing purposes. The last chapter provides a brief summary and plans for future research related to the algorithm presented in the article.

Object-oriented programming

2018 ◽  
Author(s):  
Michael Metcalf ◽  
John Reid ◽  
Malcolm Cohen
Keyword(s):  
Data Structures ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Language Support ◽  
Data Object ◽  
Object Oriented Approach ◽  
Definition Of ◽  
Abstract Types ◽  
Oriented Approach ◽  
Special Language

The object-oriented approach to programming and design is characterized by its focus on the data structures of a program rather than the procedures. Often, invoking a procedure with a data object as its principal argument is thought of as ‘sending a message’ to the object. Special language support is typically available for collecting these procedures (sometimes known as ‘methods’) together with the definition of the type of the object. This approach is supported in Fortran by type extension, polymorphic variables, type-bound procedures, abstract types, and finalization.

Chapter 23. MaxSAT, Hard and Soft Constraints

2021 ◽  
Author(s):  
Chu Min Li ◽  
Felip Manyà
Keyword(s):  
Combinatorial Optimization ◽  
Lower Bounds ◽  
Branch And Bound ◽  
Data Structures ◽  
Optimization Problems ◽  
Soft Constraints ◽  
Inference Rules ◽  
Combinatorial Optimization Problems ◽  
Definition Of ◽  
Hard And Soft Constraints

MaxSAT solving is becoming a competitive generic approach for solving combinatorial optimization problems, partly due to the development of new solving techniques that have been recently incorporated into modern MaxSAT solvers, and to the challenge problems posed at the MaxSAT Evaluations. In this chapter we present the most relevant results on both approximate and exact MaxSAT solving, and survey in more detail the techniques that have proven to be useful in branch and bound MaxSAT and Weighted MaxSAT solvers. Among such techniques, we pay special attention to the definition of good quality lower bounds, powerful inference rules, clever variable selection heuristics and suitable data structures. Moreover, we discuss the advantages of dealing with hard and soft constraints in the Partial MaxSAT formalims, and present a summary of the MaxSAT Evaluations that have been organized so far as affiliated events of the International Conference on Theory and Applications of Satisfiability Testing.

DESIGN OF KNOWLEDGE DRIVEN INTERFACES IN CULTURAL CONTEXTS

2008 ◽  
Vol 02 (04) ◽  
pp. 525-553 ◽  
Author(s):  
STEFANO VALTOLINA
Keyword(s):  
Data Structures ◽  
Huge Amount ◽  
Cultural Contexts ◽  
Interactive Applications ◽  
Cultural Domain ◽  
Interactive Interfaces ◽  
Definition Of ◽  
Information Domain ◽  
Cultural Experts ◽  
Different Sources

A major problem in developing interactive interfaces is how to guide users with respect to which queries they can ask. This is because users need to know what is possible to ask in a particular domain. This paper explores these issues in the context of cultural heritage (CH) environments. The effective presentation of CH information requires the application of sophisticated techniques from different areas, mainly human-computer interaction and knowledge management. In this kind of interactive applications users should adopt different accessing strategies independently of how the information is organized in the repositories. Thus, if the information domain is spread in different sources the user has to be able to operate in a transparent way independently of the data-structures of the archives. Moreover, the user would not be taken aback by a huge amount of data available, but the information has to be tailored according to the real user's interests. The proposed approach is based on the definition of relationships between the information cultural domain fitting the conceptual model of the cultural experts (represented by an appropriate knowledge base) and an information domain which can be understood by the machine (modeled by a domain ontology). The final system's infrastructure filters the richness of the data-sources to comply with the users' needs, tailoring the information according to their context of use. In this way the user can properly navigate through the heritage and create their own personalized thematic tour through a large number of information trails.

Labelled cyclic proofs for separation logic

2021 ◽  
Author(s):  
Didier Galmiche ◽  
Daniel Méry
Keyword(s):  
Data Structures ◽  
Program Verification ◽  
Separation Logic ◽  
Proof System ◽  
Proof Systems ◽  
Verification Tools ◽  
Definition Of ◽  
Logical Formalism

Abstract Separation logic (SL) is a logical formalism for reasoning about programs that use pointers to mutate data structures. It is successful for program verification as an assertion language to state properties about memory heaps using Hoare triples. Most of the proof systems and verification tools for ${\textrm{SL}}$ focus on the decidable but rather restricted symbolic heaps fragment. Moreover, recent proof systems that go beyond symbolic heaps are purely syntactic or labelled systems dedicated to some fragments of ${\textrm{SL}}$ and they mainly allow either the full set of connectives, or the definition of arbitrary inductive predicates, but not both. In this work, we present a labelled proof system, called ${\textrm{G}_{\textrm{SL}}}$, that allows both the definition of cyclic proofs with arbitrary inductive predicates and the full set of SL connectives. We prove its soundness and show that we can derive in ${\textrm{G}_{\textrm{SL}}}$ the built-in rules for data structures of another non-cyclic labelled proof system and also that ${\textrm{G}_{\textrm{SL}}}$ is strictly more powerful than that system.

scholarly journals Algebraic fusion of functions with an accumulating parameter and its improvement

2008 ◽  
Vol 18 (5-6) ◽  
pp. 781-819 ◽  
Author(s):  
SHIN-YA KATSUMATA ◽  
SUSUMU NISHIMURA
Keyword(s):  
Data Structures ◽  
Continuous Functions ◽  
Mathematical Basis ◽  
Intermediate Data ◽  
Monoid Homomorphism ◽  
Fusion Methods ◽  
Particular Solution ◽  
Definition Of ◽  
Composition Of Functions ◽  
Data Context

AbstractThis paper develops a new framework for fusion that is designed for eliminating the intermediate data structures involved in the composition of functions that have one accumulating parameter. The new fusion framework comprises two steps: algebraic fusion and its subsequent improvement process. The key idea in our development is to regard functions with an accumulating parameter as functions that operate over the monoid of data contexts. Algebraic fusion composes each such function with a monoid homomorphism that is derived from the definition of the consumer function to obtain a higher-order function that computes over the monoid of endofunctions. The transformation result may be further refined by an improvement process, which replaces the operation over the monoid of endofunctions (i.e., function closures) with another monoid operation over a monoid structure other than function closures.Using our framework, one can formulate a particular solution to the fusion problem by devising appropriate monoids and monoid homomorphisms. This provides a unified exposition of a variety of fusion methods that have been developed so far in different formalisms. Furthermore, the cleaner formulation makes it possible to argue about some delicate issues on a firm mathematical basis. We demonstrate that algebraic fusion and improvement in the world of complete pointed partial orders (CPOs) and continuous functions can correctly fuse functions that operate on partial and infinite data structures. We also show that subtle differences in termination behaviours of transformed programmes caused by certain different fusion methods can be cleanly explained by corresponding improvement processes that have different underlying monoid structures.

scholarly journals Personality In Conversational UI design.

2019 ◽  
Author(s):  
Anil Kumar Bheemaiah
Keyword(s):  
Data Structures ◽  
Mathematical Representations ◽  
Ui Design ◽  
Definition Of

This paper describes mathematical representations for personality as an emergence, in the designof conversational UI, from voice, video and image. We use SoulMachines conversational UI as a casestudy, for the determination of data structures for personality definition. This model differs fromother models in the existence of several aspects of personalities, with the possibility of the stabilityof one or more atomic aspects of a personality. Thus naturalness exists for the definition of apersonality

DEFINING REUSABLE ADMINISTRATIVE PROCESSES USING A GENERIC ONTOLOGY

2012 ◽  
Vol 22 (02) ◽  
pp. 243-264 ◽  
Author(s):  
ALVARO E. PRIETO ◽  
ADOLFO LOZANO-TELLO
Keyword(s):  
Data Structures ◽  
Business Process ◽  
Public Institutions ◽  
The Other ◽  
Complete Model ◽  
Administrative Process ◽  
The One ◽  
Definition Of

Administrative processes are a type of business process commonly used in public institutions and large companies. The workflow definitions of these processes are frequently reused within the organizations. The reuse of these workflow definitions can be easier if they are divided into three separate but related definitions: on the one hand, the definition of the data structures to be managed by the process activities, on the other, the users that can perform each activity and, finally, the process activities together with the relationships among the three definitions. The use of ontologies can facilitate these workflow definitions in the three related parts. In this paper, we describe OntoMetaWorkflow, a generic ontology to represent canonical workflow terms in the domain of administrative processes, and the methods for using it in defining administrative processes. This ontology is the basis of the WEAPON Model, a complete model supported by tools, for defining and managing administrative process workflows.

Application of Functional Approach to Lists for Development of Relational Model Databases and Petri Net Analysis

2014 ◽  
pp. 407-444
Author(s):  
Sasanko Sekhar Gantayat ◽  
B. K. Tripathy
Keyword(s):  
Characteristic Function ◽  
Query Processing ◽  
Data Structures ◽  
Petri Net ◽  
Relational Databases ◽  
Functional Approach ◽  
Relational Algebra ◽  
Relational Model ◽  
Algebraic Operations ◽  
Definition Of

The concept of list is very important in functional programming and data structures in computer science. The classical definition of lists was redefined by Jena, Tripathy, and Ghosh (2001) by using the notion of position functions, which is an extension of the concept of count function of multisets and of characteristic function of sets. Several concepts related to lists have been defined from this new angle and properties are proved further in subsequent articles. In this chapter, the authors focus on crisp lists and present all the concepts and properties developed so far. Recently, the functional approach to realization of relational databases and realization of operations on them has been proposed. In this chapter, a list theory-based relational database model using position function approach is designed to illustrate how query processing can be realized for some of the relational algebraic operations. The authors also develop a list theoretic relational algebra (LRA) and realize analysis of Petri nets using this LRA.

Sign in / Sign up

Export Citation Format

Share Document