Journal articles: 'Rulous type'

1

Ren, L., and P. Ren. "Type I error of t-tests from the simple moving average technical trading rules." Applied Econometrics 61 (2021): 47–61. http://dx.doi.org/10.22394/1993-7601-2021-61-47-61.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ichniarsyah, Annisa Nur, Titis Pury Purboningtyas, and Widiya Apriliani. "KEGIATAN PABRIKASI MESIN PENGUPAS BAWANG MERAH MEREK BEJE TIPE PB 01." Jurnal Bioindustri 4, no. 1 (November 30, 2021): 12–24. http://dx.doi.org/10.31326/jbio.v4i1.1224.

Full text

Abstract:

Shallot peeling activities in small scale industry are still manually done. This process takes huge time and effort. Therefore, shallot dehuller was designed and developed to increase effectivity and efficiency. The objectives of the study were to develop shallot dehuller machine and conduct functional tests. Identification tests indicated workshop tools needed for machine development were grinder, rulers, scales, and various machines such as drilling, welding, roll and bender, and cutting plasma machine. Machine development started from manufacturing the frames, dehuller hopper and inlet, rotating disc, outlet for shallot hull, and outlet for shallot. Functional tests indicated that the machine construction was according to the design plan.

APA, Harvard, Vancouver, ISO, and other styles

3

LUO, ZHAOHUI, and ROBIN ADAMS. "Structural subtyping for inductive types with functorial equality rules." Mathematical Structures in Computer Science 18, no. 5 (October 2008): 931–72. http://dx.doi.org/10.1017/s0960129508006956.

Full text

Abstract:

In this paper we study subtyping for inductive types in dependent type theories in the framework of coercive subtyping. General structural subtyping rules for parameterised inductive types are formulated based on the notion of inductive schemata. Certain extensional equality rules play an important role in proving some of the crucial properties of the type system with these subtyping rules. In particular, it is shown that the structural subtyping rules are coherent and that transitivity is admissible in the presence of the functorial rules of computational equality.

APA, Harvard, Vancouver, ISO, and other styles

4

Bokhari, M. A., Asghar Qadir, and H. Al-Attas. "On Gauss-Type Quadrature Rules." Numerical Functional Analysis and Optimization 31, no. 10 (September 16, 2010): 1120–34. http://dx.doi.org/10.1080/01630563.2010.510981.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Belingeri, C., and B. Germano. "On Appel-Type Quadrature Rules." gmj 9, no. 3 (September 2002): 405–12. http://dx.doi.org/10.1515/gmj.2002.405.

Full text

Abstract:

Abstract The Radon technique is applied in order to recover a quadrature rule based on Appel polynomials and the so called Appel numbers. The relevant formula generalizes both the Euler-MacLaurin quadrature rule and a similar rule using Euler (instead of Bernoulli) numbers and even (instead of odd) derivatives of the given function at the endpoints of the considered interval. In the general case, the remainder term is expressed in terms of Appel numbers, and all derivatives appear. A numerical example is also included.

APA, Harvard, Vancouver, ISO, and other styles

6

COLE, DANIEL H. "Laws, norms, and the Institutional Analysis and Development framework." Journal of Institutional Economics 13, no. 4 (February 28, 2017): 829–47. http://dx.doi.org/10.1017/s1744137417000030.

Full text

Abstract:

AbstractElinor Ostrom's Institutional Analysis and Development (IAD) framework has been described as ‘one of the most developed and sophisticated attempts to use institutional and stakeholder assessment in order to link theory and practice, analysis and policy’. But not all elements in the framework are sufficiently well developed. This paper focuses on one such element: the ‘rules-in-use’ (a.k.a. ‘rules’ or ‘working rules’). Specifically, it begins a long-overdue conversation about relations between formal legal rules and ‘working rules’ by offering a tentative and very simple typology of relations. Type 1: Some formal legal rules equal or approximate the working rules; Type 2: Some legal rules plus (or emended by) widely held social norms equal or approximate the working rules; and Type 3: Some legal rules bear no evident relation to the working rules. Several examples, including some previously used by Ostrom, are provided to illustrate each of the three types, which can be conceived of as nodes or ranges along a continuum. The paper concludes with a call for empirical research, especially case studies and meta-analyses, to determine the relevant scope of each of these types of relations, and to provide data for furthering our understanding of how different types of rules, from various sources, function (or not) as institutions.

APA, Harvard, Vancouver, ISO, and other styles

7

COPESTAKE, ANN. "Appendix: Definitions of typed feature structures." Natural Language Engineering 6, no. 1 (March 2000): 109–12. http://dx.doi.org/10.1017/s1351324900002357.

Full text

Abstract:

The LinGO grammar consists of a specification of a type system and of various typed feature structures which are well-formed according to the type system. The typed feature structures function as grammar rules, lexical rules and lexical entries. There are several variant typed feature structure formalisms, with different computational properties, so in this appendix we very briefly specify the version assumed by the LinGO grammar.This appendix is necessarily terse, and is only intended to allow a reader who already has a knowledge of typed feature structures to understand the specific formalism used in the LinGO grammar. The definitions given below basically follow Carpenter (1992), with the notion of type constraint from Copestake (1992). For formal details of typed feature structures in general see Carpenter (1992). A detailed account of the specific assumptions made here is given in Copestake (1999) (See Chapter 4 for an introduction, and Chapter 5 for a semi-formal account.)Note that the LinGO grammar uses a very restricted formalism. For instance, it does not utilize disjunctive feature structures, negation, implication, inequalities, defaults, set-valued features, extensionality or relational constraints. Constraint resolution does not require that every type be made maximally specific, and the type inference system is essentially non-recursive. The recursive power necessary in grammars is explicitly encoded via rules, which are expressed as typed feature structures, but interpreted as phrase structure rules.

APA, Harvard, Vancouver, ISO, and other styles

8

Franjić, Iva. "Hermite-Hadamard-type inequalities for Radau-type quadrature rules." Journal of Mathematical Inequalities, no. 3 (2009): 395–407. http://dx.doi.org/10.7153/jmi-03-39.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

MU, SHIN-CHENG, HSIANG-SHANG KO, and PATRIK JANSSON. "Algebra of programming in Agda: Dependent types for relational program derivation." Journal of Functional Programming 19, no. 5 (July 23, 2009): 545–79. http://dx.doi.org/10.1017/s0956796809007345.

Full text

Abstract:

AbstractRelational program derivation is the technique of stepwise refining a relational specification to a program by algebraic rules. The program thus obtained is correct by construction. Meanwhile, dependent type theory is rich enough to express various correctness properties to be verified by the type checker. We have developed a library, AoPA (Algebra of Programming in Agda), to encode relational derivations in the dependently typed programming language Agda. A program is coupled with an algebraic derivation whose correctness is guaranteed by the type system. Two non-trivial examples are presented: an optimisation problem and a derivation of quicksort in which well-founded recursion is used to model terminating hylomorphisms in a language with inductive types.

APA, Harvard, Vancouver, ISO, and other styles

10

Mao, Yanying, and Honghui Chen. "Rule-Guided Compositional Representation Learning on Knowledge Graphs with Hierarchical Types." Mathematics 9, no. 16 (August 18, 2021): 1978. http://dx.doi.org/10.3390/math9161978.

Full text

Abstract:

The representation learning of the knowledge graph projects the entities and relationships in the triples into a low-dimensional continuous vector space. Early representation learning mostly focused on the information contained in the triplet itself but ignored other useful information. Since entities have different types of representations in different scenarios, the rich information in the types of entity levels is helpful for obtaining a more complete knowledge representation. In this paper, a new knowledge representation frame (TRKRL) combining rule path information and entity hierarchical type information is proposed to exploit interpretability of logical rules and the advantages of entity hierarchical types. Specifically, for entity hierarchical type information, we consider that entities have multiple representations of different types, as well as treat it as the projection matrix of entities, using the type encoder to model entity hierarchical types. For rule path information, we mine Horn rules from the knowledge graph to guide the synthesis of relations in paths. Experimental results show that TRKRL outperforms baselines on the knowledge graph completion task, which indicates that our model is capable of using entity hierarchical type information, relation paths information, and logic rules information for representation learning.

APA, Harvard, Vancouver, ISO, and other styles

11

Wu, Tianxing, Guilin Qi, Bin Luo, Lei Zhang, and Haofen Wang. "Language-Independent Type Inference of the Instances from Multilingual Wikipedia." International Journal on Semantic Web and Information Systems 15, no. 2 (April 2019): 22–46. http://dx.doi.org/10.4018/ijswis.2019040102.

Full text

Abstract:

Extracting knowledge from Wikipedia has attracted much attention in recent ten years. One of the most valuable kinds of knowledge is type information, which refers to the axioms stating that an instance is of a certain type. Current approaches for inferring the types of instances from Wikipedia mainly rely on some language-specific rules. Since these rules cannot catch the semantic associations between instances and classes (i.e. candidate types), it may lead to mistakes and omissions in the process of type inference. The authors propose a new approach leveraging attributes to perform language-independent type inference of the instances from Wikipedia. The proposed approach is applied to the whole English and Chinese Wikipedia, which results in the first version of MulType (Multilingual Type Information), a knowledge base describing the types of instances from multilingual Wikipedia. Experimental results show that not only the proposed approach outperforms the state-of-the-art comparison methods, but also MulType contains lots of new and high-quality type information.

APA, Harvard, Vancouver, ISO, and other styles

12

Alves, Sandra, and Mário Florido. "Type Inference using Constraint Handling Rules." Electronic Notes in Theoretical Computer Science 64 (September 2002): 56–72. http://dx.doi.org/10.1016/s1571-0661(04)80346-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Elfving, Tommy, and Touraj Nikazad. "Stopping rules for Landweber-type iteration." Inverse Problems 23, no. 4 (June 13, 2007): 1417–32. http://dx.doi.org/10.1088/0266-5611/23/4/004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Pombrio, Justin, and Shriram Krishnamurthi. "Inferring type rules for syntactic sugar." ACM SIGPLAN Notices 53, no. 4 (December 2, 2018): 812–25. http://dx.doi.org/10.1145/3296979.3192398.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Mahesh, Ch. "The 3-point quadrature rules with constant weight function." Asian-European Journal of Mathematics 13, no. 02 (October 17, 2018): 2050041. http://dx.doi.org/10.1142/s1793557120500412.

Full text

Abstract:

In this paper, we present all types of 3-point quadrature rules on continuous function on interval [Formula: see text] with constant weight function and compare there with the composite type also. All 3-point (open and closed) rules are taken from available papers and some new results like non-polynomial fitting and derivative type are introduced. Also, differences, comparisons, and errors between method procedures have been shown.

APA, Harvard, Vancouver, ISO, and other styles

16

LUO, ZHAOHUI. "PAL+: a lambda-free logical framework." Journal of Functional Programming 13, no. 2 (March 2003): 317–38. http://dx.doi.org/10.1017/s0956796802004525.

Full text

Abstract:

A lambda-free logical framework takes parameterisation and definitions as the basic notions to provide schematic mechanisms for specification of type theories and their use in practice. The framework presented here, PAL+, is a logical framework for specification and implementation of type theories, such as Martin-Löf's type theory or UTT. As in Martin-Löf's logical framework (Nordström et al., 1990), computational rules can be introduced and are used to give meanings to the declared constants. However, PAL+ only allows one to talk about the concepts that are intuitively in the object type theories: types and their objects, and families of types and families of objects of types. In particular, in PAL+, one cannot directly represent families of families of entities, which could be done in other logical frameworks by means of lambda abstraction. PAL+ is in the spirit of de Bruijn's PAL+ for Automath (de Bruijn, 1980). Compared with PAL, PAL+ allows one to represent parametric concepts such as families of types and families of non-parametric objects, which can be used by themselves as totalities as well as when they are fully instantiated. Such parametric objects are represented by local definitions (let-expressions). We claim that PAL+ is a correct meta-language for specifying type theories (e.g., dependent type theories), as it has the advantage of exactly capturing the intuitive concepts in object type theories, and that its implementation reflects the actual use of type theories in practice. We shall study the meta-theory of PAL+ by developing its typed operational semantics and showing that it has nice meta-theoretic properties.

APA, Harvard, Vancouver, ISO, and other styles

17

LEVIN, MICHAEL Y., and BENJAMIN C. PIERCE. "TinkerType: a language for playing with formal systems." Journal of Functional Programming 13, no. 2 (March 2003): 295–316. http://dx.doi.org/10.1017/s0956796802004550.

Full text

Abstract:

TinkerType is a pragmatic framework for compact and modular description of formal systems (type systems, operational semantics, logics, etc.). A family of related systems is broken down into a set of clauses – individual inference rules – and a set of features controlling the inclusion of clauses in particular systems. Simple static checks are used to help maintain consistency of the generated systems. We present TinkerType and its implementation and describe its application to two substantial repositories of typed lambda-calculi. The first repository covers a broad range of typing features, including subtyping, polymorphism, type operators and kinding, computational effects, and dependent types. It describes both declarative and algorithmic aspects of the systems, and can be used with our tool, the TinkerType Assembler, to generate calculi either in the form of typeset collections of inference rules or as executable ML typecheckers. The second repository addresses a smaller collection of systems, and provides modularized proofs of basic safety properties.

APA, Harvard, Vancouver, ISO, and other styles

18

Cumming, John, and Tina Y. Mallie. "Accounting for Divestitures: A Comparison of Sell-Offs, Spin-Offs, Split-Offs, and Split-Ups." Issues in Accounting Education 14, no. 1 (February 1, 1999): 75–97. http://dx.doi.org/10.2308/iace.1999.14.1.75.

Full text

Abstract:

In the 1990s, the financial press has frequently announced corporate spin-offs and split-offs. Financial accounting textbooks, though, contain little or no coverage of spin-offs, split-offs and other types of divestitures. This paper discusses the reasons for divestitures, identifies four types of divestitures, describes the characteristics and common conditions associated with each type, reviews the accounting standards and federal income tax rules and regulations pertaining to each type, illustrates the application of the accounting standards for each type and discusses the potential impact of these accounting standards and tax rules and regulations on a corporation's choice of one type of divestiture over another. As such, this paper may be used as a supplement in an upper-division financial accounting course.

APA, Harvard, Vancouver, ISO, and other styles

19

Lando, Giorgio. "A Uniform, Concretist Metaphysics for Linguistic Types." Metaphysica 20, no. 2 (October 25, 2019): 195–221. http://dx.doi.org/10.1515/mp-2019-2014.

Full text

Abstract:

Abstract I argue that it is not acceptable to restrict the claim that linguistic types are concrete entities (type-concretism) to some categories of linguistic types (such as words or proper names), while at the same time conceding that other categories of linguistic types (such as sentence types) are abstract entities. Moreover, I suggest a way in which type-concretism can be extended to every linguistic type, thereby responding to the so-called productivity objection to type-concretism, according to which, whenever tokens of a type t are produced in different, causally isolated circumstances, then t needs to be identified by a certain form or structure. This extension of type-concretism detaches type-concretism from so-called originalism and gives rules a prominent role in type-concretism.

APA, Harvard, Vancouver, ISO, and other styles

20

Sepúlveda-Torres, Robiert, Alba Bonet-Jover, and Estela Saquete. "“Here Are the Rules: Ignore All Rules”: Automatic Contradiction Detection in Spanish." Applied Sciences 11, no. 7 (March 30, 2021): 3060. http://dx.doi.org/10.3390/app11073060.

Full text

Abstract:

This paper tackles automatic detection of contradictions in Spanish within the news domain. Two pieces of information are classified as compatible, contradictory, or unrelated information. To deal with the task, the ES-Contradiction dataset was created. This dataset contains a balanced number of each of the three types of information. The novelty of the research is the fine-grained annotation of the different types of contradictions in the dataset. Presently, four different types of contradictions are covered in the contradiction examples: negation, antonyms, numerical, and structural. However, future work will extend the dataset with all possible types of contradictions. In order to validate the effectiveness of the dataset, a pretrained model is used (BETO), and after performing different experiments, the system is able to detect contradiction with a F1m of 92.47%. Regarding the type of contradictions, the best results are obtained with negation contradiction (F1m = 98%), whereas structural contradictions obtain the lowest results (F1m = 69%) because of the smaller number of structural examples, due to the complexity of generating them. When dealing with a more generalistic dataset such as XNLI, our dataset fails to detect most of the contradictions properly, as the size of both datasets are very different and our dataset only covers four types of contradiction. However, using the classification of the contradictions leads us to conclude that there are highly complex contradictions that will need external knowledge in order to be properly detected and this will avoid the need for them to be previously exposed to the system.

APA, Harvard, Vancouver, ISO, and other styles

21

Wang, Min, Liuyao Zhu, Jun Fan, Jingjing Yan, Ying Dun, Rui Yu, Lizhen Liu, and Shuye Zhang. "Rules governing genetic exchanges among viral types from different Enterovirus A clusters." Journal of General Virology 101, no. 11 (November 1, 2020): 1145–55. http://dx.doi.org/10.1099/jgv.0.001479.

Full text

Abstract:

The species Enterovirus A (EV-A) consists of two conventional clusters and one unconventional cluster. At present, sequence analysis shows no evidence of recombination between conventional and unconventional EV-A types. However, the factors underlying this genetic barrier are unclear. Here, we systematically dissected the genome components linked to these peculiar phenomena, using the viral reverse genetic tools. We reported that viral capsids of the unconventional EV-A types expressed poorly in human cells. The trans-encapsidation outputs across conventional and unconventional EV-A types were also with low efficiency. However, replicons of conventional types bearing exchanged 5′-untranslated region (UTR) or non-structural regions from the unconventional types were replication-competent. Furthermore, we created a viable recombinant EVA71 (conventional type) with its P3 region replaced by that from EVA89 (unconventional type). Thus, our data for the first time reveal the potential for fertile genetic exchanges between conventional and unconventional EV-A types. It also discloses that the mysterious recombination barriers may lie in uncoordinated capsid expression and particle assembly by different EV-A clusters.

APA, Harvard, Vancouver, ISO, and other styles

22

COPPO, MARIO, MARIANGIOLA DEZANI-CIANCAGLINI, INES MARGARIA, and MADDALENA ZACCHI. "Isomorphism of intersection and union types." Mathematical Structures in Computer Science 27, no. 5 (August 7, 2015): 603–25. http://dx.doi.org/10.1017/s0960129515000304.

Full text

Abstract:

This paper gives a complete characterisation of type isomorphism definable by terms of a λ-calculus with intersection and union types. Unfortunately, when union is considered the Subject Reduction property does not hold in general. However, it is well known that in the λ-calculus, independently of the considered type system, the isomorphism between two types can be realised only by invertible terms. Notably, all invertible terms are linear terms. In this paper, the isomorphism of intersection and union types is investigated using a relevant type system for linear terms enjoying the Subject Reduction property. To characterise type isomorphism, a similarity between types and a type reduction are introduced. Types have a unique normal form with respect to the reduction rules and two types are isomorphic if and only if their normal forms are similar.

APA, Harvard, Vancouver, ISO, and other styles

23

Urbano, David Fernando Daza, Carlos Andres Martos Ojeda, and Carlos Alberto Trujillo Solarte. "Almost Difference Sets From Singer Type Golomb Rulers." IEEE Access 10 (2022): 1132–37. http://dx.doi.org/10.1109/access.2021.3137996.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Zuenko, A. A. "Compact representation of constraints based on a new interpretation of the concept "tuple of a multi-place relation"." Ontology of designing 10, no. 4 (December 30, 2020): 503–15. http://dx.doi.org/10.18287/2223-9537-2020-10-4-503-515.

Full text

Abstract:

The article discusses various points of view on the concept of "tuple of a multi-place relation" used in mathematics and information technology. Special attention is paid to an evolution of the concept “tuple” within Constraint Programming technology where the emergence of new interpretations for the concept “tuple” is related with attempts to design more “compact” table representation of qualitative relations comparing with typical relational tables. This “compact” representation can serve as a basis for accelerating qualitative constraint satisfaction procedures. In studied prototype-works, such varieties of table constraints as compressed-tables and smart-tables were proposed. In so doing, the concept of compressed- and smart- tuple substantially differs from traditional concept of tuple of a multi-place relation. However, the known table constraints types are not well suited for modeling and processing all types of quality relations, for example, there are inconveniences when modeling production rules. The article proposes a new type of table constraints – smart-tables of D-type and equivalent transformations rules allowing the initial constraint satisfaction problem to be effectively reduced. The application of the smart-tables of D-type allows in some cases to substantially reduce computer memory consumption comparing with application of the known types of table constraints. In particular, smart-tables of D-types are well suited for modeling production rules, some types of logical expirations and some types of global constraints.

APA, Harvard, Vancouver, ISO, and other styles

25

KLEV, ANSTEN. "ETA-RULES IN MARTIN-LÖF TYPE THEORY." Bulletin of Symbolic Logic 25, no. 03 (July 22, 2019): 333–59. http://dx.doi.org/10.1017/bsl.2019.21.

Full text

Abstract:

AbstractThe eta rule for a set A says that an arbitrary element of A is judgementally identical to an element of constructor form. Eta rules are not part of what may be called canonical Martin-Löf type theory. They are, however, justified by the meaning explanations, and a higher order eta rule is part of that type theory. The main aim of this article is to clarify this somewhat puzzling situation. It will be argued that lower order eta rules do not, whereas the higher order eta rule does, accord with the understanding of judgemental identity as definitional identity. A subsidiary aim is to clarify precisely what an eta rule is. This will involve showing how such rules relate to various other notions of type theory, proof theory, and category theory.

APA, Harvard, Vancouver, ISO, and other styles

26

Browne, Sid, and Uri Yechiali. "Dynamic priority rules for cyclic-type queues." Advances in Applied Probability 21, no. 02 (June 1989): 432–50. http://dx.doi.org/10.1017/s0001867800018620.

Full text

Abstract:

A cyclic service system is composed of K channels (queues) and a single cyclically roving server who typically takes a positive amount of time to switch between channels. Research has previously focused on evaluating and computing performance measures (notably, waiting times) of fixed template routing schemes under three main service disciplines, the exhaustive, gated and limited service regimes. In this paper, probabilistic results are derived that allow control strategies and optimal policies to be considered for the first time. By concentrating on a new objective function, we are able to derive rules of index form amenable for direct implementation to dynamically control the system at suitably defined decision epochs. These rules utilize current system information, are of an adaptive nature, and are shown to emanate from a general physical principle.

APA, Harvard, Vancouver, ISO, and other styles

27

Bunder, Martin, and Wil Dekkers. "Pure type systems with more liberal rules." Journal of Symbolic Logic 66, no. 4 (December 2001): 1561–80. http://dx.doi.org/10.2307/2694962.

Full text

Abstract:

Abstract.Pure Type Systems. PTSs, introduced as a generalisation of the type systems of Barendregt's lambda-cube, provide a foundation for actual proof assistants, aiming at the mechanic verification of formal proofs. In this paper we consider simplifications of some of the rules of PTSs. This is of independent interest for PTSs as this produces more flexible PTS-like systems, but it will also help, in a later paper, to bridge the gap between PTSs and systems of Illative Combinatory Logic.First we consider a simplification of the start and weakening rules of PTSs. which allows contexts to be sets of statements, and a generalisation of the conversion rule. The resulting Set-modified PTSs or SPTSs, though essentially equivalent to PTSs, are closer to standard logical systems.A simplification of the abstraction rule results in Abstraction-modified PTSs or APTSs. These turn out to be equivalent to standard PTSs if and only if a condition (*) holds. Finally we consider SAPTSs which have both modifications.

APA, Harvard, Vancouver, ISO, and other styles

28

Xie, Weiwei, Lea Gustin, and Guang Bian. "111-Type Semiconductor ReGaSi Follows 14e– Rules." Inorganic Chemistry 56, no. 9 (April 11, 2017): 5165–72. http://dx.doi.org/10.1021/acs.inorgchem.7b00309.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Özkal-Sanver, İpek, and M. Remzi Sanver. "Implementing matching rules by type pretension mechanisms." Mathematical Social Sciences 50, no. 3 (November 2005): 304–17. http://dx.doi.org/10.1016/j.mathsocsci.2005.04.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Browne, Sid, and Uri Yechiali. "Dynamic priority rules for cyclic-type queues." Advances in Applied Probability 21, no. 2 (June 1989): 432–50. http://dx.doi.org/10.2307/1427168.

Full text

Abstract:

A cyclic service system is composed of K channels (queues) and a single cyclically roving server who typically takes a positive amount of time to switch between channels. Research has previously focused on evaluating and computing performance measures (notably, waiting times) of fixed template routing schemes under three main service disciplines, the exhaustive, gated and limited service regimes.In this paper, probabilistic results are derived that allow control strategies and optimal policies to be considered for the first time. By concentrating on a new objective function, we are able to derive rules of index form amenable for direct implementation to dynamically control the system at suitably defined decision epochs. These rules utilize current system information, are of an adaptive nature, and are shown to emanate from a general physical principle.

APA, Harvard, Vancouver, ISO, and other styles

31

Milovanovic, Gradimir V., and Aleksandar S. Cvetkovic. "Gaussian-type Quadrature Rules for Müntz Systems." SIAM Journal on Scientific Computing 27, no. 3 (January 2005): 893–913. http://dx.doi.org/10.1137/040621533.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Yager, Ronald R. "Firing Fuzzy Rules With Measure Type Inputs." IEEE Transactions on Fuzzy Systems 23, no. 4 (August 2015): 939–49. http://dx.doi.org/10.1109/tfuzz.2014.2336253.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Pinelis, Iosif. "L'Hospital-type rules for monotonicity: Discrete case." Mathematical Inequalities & Applications, no. 4 (2008): 647–53. http://dx.doi.org/10.7153/mia-11-54.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Herrmann, B., and W. Rautenberg. "Axiomatization of the De Morgan type rules." Studia Logica 49, no. 3 (September 1990): 333–43. http://dx.doi.org/10.1007/bf00370368.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Palmgren, Erik. "A construction of type: type in Martin-Löf's partial type theory with one universe." Journal of Symbolic Logic 56, no. 3 (September 1991): 1012–15. http://dx.doi.org/10.2307/2275068.

Full text

Abstract:

In this note we construct Martin-Löf's inconsistent type theory, Type: Type (Martin-Löf [1971]), inside partial type theory with one universe. Thus adding a fixed point operator to type theory with one predicative universe gives impredicativity.We may describe the theory Type:Type as follows. It contains the rules for the product construction (II) of Martin-Löf [1984] except the η-rule and it contains the usual rules for definitional equality (=). Moreover it contains the following strongly impredicative universeThis theory is inconsistent (i.e. every set is inhabited), and this is seen by proving a variant of the Burali—Forti paradox—Girard's paradox—cf. Troelstra and van Dalen [1988]. Coquand [199?] has shown that by adding the well-order type and the strong dependent sum to the universe, the fixed point operator becomes definable. It is an open problem whether it is definable without the well-order type. The present result could be seen as a converse, namely by adding the fixed point operator to type theory with one universe, Type:Type becomes definable and, as is already known, so does the well-order type.

APA, Harvard, Vancouver, ISO, and other styles

36

Logue, David M. "The Duet Code of the Female Black-Bellied Wren." Condor 108, no. 2 (May 1, 2006): 326–35. http://dx.doi.org/10.1093/condor/108.2.326.

Full text

Abstract:

Abstract In many duet-singing songbirds, paired birds combine their song types nonrandomly to form duet songs. Several different behavioral mechanisms could generate nonrandom song type associations in duets. I tested female Black-bellied Wrens (Thryothorus fasciatoventris) for one such mechanism: adherence to a set of rules linking female response songs to male stimulus songs. I call this set of rules a “duet code.” Duets of free-living Black-bellied Wrens were recorded in 2001 and 2002. In 2003 I returned to the same territories and played the male song types from the recorded duets. Females answered male song stimuli as if duetting with the playback speaker. Although the known repertoires of females averaged 8.4 song types, each female sang only a single song type in response to each male song type. Random answering could not account for this pattern, supporting the hypothesis that females abide by duet codes. Females that were still paired with their mates from 2001–2002 answered 100% of their mate's songs with the same song types they had used previously, demonstrating that codes are stable over time. In contrast, females that were new to a territory answered an average of only 18% of their mate's song types with the same song type as the previous female, indicating that duet codes are individually distinctive. Duet participation by female Black-bellied Wrens represents a special kind of animal communication, in which discrete vocal signals consistently elicit discrete vocal responses according to an individually distinctive set of rules.

APA, Harvard, Vancouver, ISO, and other styles

37

TSUKADA, YASUYUKI. "MARTIN-LÖF'S TYPE THEORY AS AN OPEN-ENDED FRAMEWORK." International Journal of Foundations of Computer Science 12, no. 01 (February 2001): 31–67. http://dx.doi.org/10.1142/s0129054101000400.

Full text

Abstract:

This paper treats Martin-Löf's type theory as an open-ended framework composed of (i) flexibly extensible languages into which various forms of objects and types can be incorporated, (ii) their uniform, effectively given semantics, and (iii) persistently valid inference rules. The class of expression systems is introduced here to define an open-ended body of languages underlying the theory. Each expression system consists of two parts: the computational part is a structured lazy evaluation system with a bisimulation-like program equivalence; the structural part is a system of strictly positive inductive definitions for type constructors in terms of partial equivalence relations. Types and their objects are uniformly and inductively constructed from a given expression system as a type system, which can provide a semantics of the theory. Building on these concepts, this paper presents two main results. First, all the inference rules of the theory are sound; that is, they remain valid in every type system built from an extension of an initial expression system. This result gives a characterization of the class of types that can be introduced into the theory. Second, each type system is complete with respect to the underlying bisimulation-like program equivalence. This result provides a useful form of type-free equational reasoning in the theory.

APA, Harvard, Vancouver, ISO, and other styles

38

Zabelina, E. P. "Municipal Procedural Rules and Their Types." Lex Russica, no. 3 (March 18, 2021): 62–70. http://dx.doi.org/10.17803/1729-5920.2021.172.3.062-070.

Full text

Abstract:

The paper analyzes the concept of municipal procedural norms. The author justifiably notes that the municipal procedural norm contains all the features of a legal norm and defines the procedure for ensuring the material powers of local self-government subjects. According to the author, municipal procedural norms are contained in the legislation at the federal and regional levels, as well as in municipal legal acts. The variety of identified municipal procedural norms allows us to distinguish three of their types. The first type of norms includes procedural norms that describe the sequential actions necessary to ensure that local self-government entities exercise their powers. The second type of municipal procedural norms is characterized by the presence of references to other normative legal acts. The third type is made up of municipal procedural norms, which only name specific actions necessary for the implementation of their powers by local self-government entities. Due to the large number of municipal legal acts containing procedural norms, it is proposed to codify them, as well as to introduce a new type of municipal legal acts into the system — the municipal procedural code. This codified act could structurally consist of two parts — general and special. In the general part of the municipal procedural code, it is advisable to include municipal procedural norms that establish general procedures for ensuring the implementation of all available material powers of local self-government bodies and other local self-government entities. In the special par, it would be necessary to fix the norms that ensure the specifics of the implementation of each material authority of the subject of local self-government to resolve issues of local significance. This approach to the systematization of procedural norms will significantly reduce the number of municipal procedural acts and duplication of procedural norms, thereby ensuring more effective law enforcement activities of local self-government bodies.

APA, Harvard, Vancouver, ISO, and other styles

39

Tutzauer, Patrick, Susanne Becker, and Norbert Haala. "Perceptual Rules for Building Enhancements in 3D Virtual Worlds." i-com 16, no. 3 (December 20, 2017): 205–13. http://dx.doi.org/10.1515/icom-2017-0022.

Full text

Abstract:

AbstractWhile the generation of geometric 3D virtual models has become feasible to a great extent, the enrichment of the resulting urban building models with semantics remains an open research question in the field of geoinformation and geovisualisation. This additional information is not only valuable for applications like Building Information Modeling (BIM) but also offers possibilities to enhance the visual insight for humans when interacting with that kind of data. Depending on the application, presenting users the highest level of detail of building models is often neither the most informative nor feasible way. For example when using mobile apps, resources and display sizes are quite limited. A concrete use case is the imparting of building use types in urban scenes to users. Within our preliminary work, user studies helped to identify important features for the human ability to associate a building with its correct usage type. In this work we now embed this knowledge into building category-specific grammars to automatically modify the geometry of a building to align its visual appearance to its underlying use type. If the building category for a model is not known beforehand, we investigate its feature space and try to derive its use type from there. Within the context of this work, we developed a Virtual Reality (VR) framework that gives the user the possibility to switch between different building representation types while moving in the VR world, thus enabling us in the future to evaluate the potential and effect of the grammar-enhanced building model in an immersive environment.

APA, Harvard, Vancouver, ISO, and other styles

40

Zaimbashi, Amir. "Two Types of Distributed CFAR Detection Based on Weighting Functions in Fusion Center for Weibull Clutter." Journal of Engineering 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/648190.

Full text

Abstract:

Two types of distributed constant false alarm rate (CFAR) detection using binary and fuzzy weighting functions in fusion center are developed. In the two types of distributed detectors, it was assumed that the clutter parameters at the local sensors are unknown and each local detector performs CFAR processing based on ML and OS CFAR processors before transmitting data to the fusion center. At the fusion center, received data is weighted either by a binary or a fuzzy weighting functions and combined according to deterministic rules, constructing global test statistics. Moreover, for the Weibull clutter, the expression of the weighting functions, based on ML and OS CFAR processors in local detectors, is obtained. In the binary type, we analyzed various distributed detection schemes based on maximum, minimum, and summation rules in fusion center. In the fuzzy type, we consider the various distributed detectors based on algebraic product, algebraic sum, probabilistic OR, and Lukasiewicz t-conorm fuzzy rules in fusion center. The performance of the two types of distributed detectors is analyzed and compared in the homogenous and nonhomogenous situations, multiple targets, or clutter edge. The simulation results indicate the superiority and robust performance of fuzzy type in homogenous and non homogenous situations.

APA, Harvard, Vancouver, ISO, and other styles

41

SERRANO, ALEJANDRO, and JURRIAAN HAGE. "Constraint handling rules with binders, patterns and generic quantification." Theory and Practice of Logic Programming 17, no. 5-6 (August 22, 2017): 992–1009. http://dx.doi.org/10.1017/s1471068417000230.

Full text

Abstract:

AbstractConstraint handling rules provide descriptions for constraint solvers. However, they fall short when those constraints specify some binding structure, like higher-rank types in a constraint-based type inference algorithm. In this paper, the term syntax of constraints is replaced by λ-tree syntax, in which binding is explicit, and a new ∇ generic quantifier is introduced, which is used to create new fresh constants.

APA, Harvard, Vancouver, ISO, and other styles

42

Kim, Nayung. "Trade Remedy Rules for Digital Services: Inapplicability of GATT-type Safeguard Rules." Journal of World Trade 54, Issue 5 (September 1, 2020): 813–29. http://dx.doi.org/10.54648/trad2020035.

Full text

Abstract:

Digitalization considerably complicates the application of previous trade remedy norms to the new and expanding digital services trade, and there is a need to reprioritize and restructure the existing framework to reflect this difference. Emergency safeguard is an essential element in the trade regime, but the classic concept of GATT-type safeguard measures that is based on a dichotomy of tariff and nontariff barriers and clear-cut rules between goods and services are not suitable for regulating the expanding digital services transactions where barriers tend to be much more diverse and less obvious. Hence, a new trade remedy framework must incorporate the elements of convergence, interconnectedness and externality, while taking a sectoral approach, as generic rules on trade remedies that cater to all possible scenarios and sectors are no longer suitable in these realms. It must prioritize rules-making on subsidies and domestic tax schemes, while also considering for issues specific to the digital features such as data flow restrictions and their implications. Digital trade, digital services, trade remedy rules, emergency safeguard, GATT

APA, Harvard, Vancouver, ISO, and other styles

43

Xie, Ningning, Matthew Pickering, Andres Löh, Nicolas Wu, Jeremy Yallop, and Meng Wang. "Staging with class: a specification for typed template Haskell." Proceedings of the ACM on Programming Languages 6, POPL (January 16, 2022): 1–30. http://dx.doi.org/10.1145/3498723.

Full text

Abstract:

Multi-stage programming using typed code quotation is an established technique for writing optimizing code generators with strong type-safety guarantees. Unfortunately, quotation in Haskell interacts poorly with type classes, making it difficult to write robust multi-stage programs. We study this unsound interaction and propose a resolution, staged type class constraints, which we formalize in a source calculus λ ⇒ that elaborates into an explicit core calculus F . We show type soundness of both calculi, establishing that well-typed, well-staged source programs always elaborate to well-typed, well-staged core programs, and prove beta and eta rules for code quotations. Our design allows programmers to incorporate type classes into multi-stage programs with confidence. Although motivated by Haskell, it is also suitable as a foundation for other languages that support both overloading and quotation.

APA, Harvard, Vancouver, ISO, and other styles

44

De Boeck, Paul, and Iven Van Mechelen. "Traits and taxonomies: A hierarchical classes approach." European Journal of Personality 4, no. 2 (June 1990): 147–56. http://dx.doi.org/10.1002/per.2410040207.

Full text

Abstract:

Three types of taxonomy involving traits are discerned. In the first type, traits are objects of trait categories based on trait attributes. In the second type, traits are attributes of persons, person types being categories. In the third type, traits are categories of acts grouped on the basis of act attributes. All three types are analysed and discussed from the perspective of the hierarchical classes model for object by attribute data. Categories are considered external variables that can be mapped onto the object by attribute structure by way of category rules. It is suggested that this conceptual analysis yields a framework for studying how trait terms are understood and used.

APA, Harvard, Vancouver, ISO, and other styles

45

Tokarski, Tomasz. "Monetary Policy Rules in Conditions of Long-term Domar-Solow Equilibrium." Gospodarka Narodowa 186, no. 9 (September 25, 2003): 1–21. http://dx.doi.org/10.33119/gn/113798.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Zhao, Qijian, Yanlong Cao, Ting Liu, Lifei Ren, and Jiangxin Yang. "Tolerance specification of the plane feature based on the axiomatic design." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 233, no. 5 (May 25, 2018): 1481–92. http://dx.doi.org/10.1177/0954406218772001.

Full text

Abstract:

Tolerance specification involves selecting tolerance types for functional or assembly features to control the variation of features. General methods tend to formulate a frame to specify all the features of part, while the specification methods or reasoning rules for specific feature (point, line, plane, cylinder, etc.) are less studied. This paper focuses on the tolerance-type selection of the plane feature. The theory of axiomatic design is introduced to select the tolerance type for the plane feature, and the problem is interpreted as a redundant decoupled design. To achieve the functional requirements, design parameters and constraints of physics domain are determined. The mapping rules, which are between design parameters and functional requirements, are generated based on the independent axiom. Considering the large number of solutions of the design, the constraints such as cost and inspection methods are introduced to reduce the number of solutions. The minimum information axiom is introduced for the optimum mapping rules and the tolerance types are selected by the optimum mapping rules for the plane feature. Finally, the specification process is concluded and demonstrated by means of an example.

APA, Harvard, Vancouver, ISO, and other styles

47

Xie, Fugui, Xin-Jun Liu, and Tiemin Li. "Type Synthesis and Typical Application of 1T2R-Type Parallel Robotic Mechanisms." Mathematical Problems in Engineering 2013 (2013): 1–12. http://dx.doi.org/10.1155/2013/206181.

Full text

Abstract:

This paper focuses on the 1T2R-type (T: translational DOF; R: rotational DOF) parallel robotic mechanisms (PKMs) and discusses their type synthesis and typical application in five-axis machine tools. Based on Grassmann line geometry and atlas method, a systematic method dealing with the type synthesis of lower mobility PKMs is introduced. The Blanding rules and generalized Blanding rules, which are the criterions in realizing the mutual conversion between the freedom-space atlas and the constraint-space atlas, are summarized and discussed in detail. Thereafter, the entire procedure of the type synthesis is presented, and the type synthesis of 1T2R PKMs is carried out. Based on the synthesis results, a five-axis hybrid mechanism is proposed and a machine tool is developed consequently. The type synthesis method presented in this paper is intuitive and concise and can be used in the type synthesis of other lower mobility PKMs.

APA, Harvard, Vancouver, ISO, and other styles

48

Veith, G. D., and S. J. Broderius. "Rules for distinguishing toxicants that cause type I and type II narcosis syndromes." Environmental Health Perspectives 87 (July 1990): 207–11. http://dx.doi.org/10.1289/ehp.9087207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Shahparast, Homeira, and Eghbal G. Mansoori. "Developing an online general type-2 fuzzy classifier using evolving type-1 rules." International Journal of Approximate Reasoning 113 (October 2019): 336–53. http://dx.doi.org/10.1016/j.ijar.2019.07.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Akrom, Muhamad, Triyanto Triyanto, and Farida Nurhasanah. "Students’ Mathematical Reasoning Ability Viewed from Personality Type Rational and Idealist." International Journal of Multicultural and Multireligious Understanding 7, no. 11 (December 2, 2020): 132. http://dx.doi.org/10.18415/ijmmu.v7i11.2149.

Full text

Abstract:

This finds out about pursuits to (1) describe the mathematical reasoning ability of high school students as viewed from the rational and idealist personality types; (2) knowing the causes of students' errors in answering questions. This type of research is qualitative research. The subjects of this research were eleventh-grade students of high school 1 Wanasaba East Lombok. Determination of the concern using purposive sampling. Data collection methods used personality tests and mathematical reasoning exams on trigonometric material. The outcomes of this study indicate that both rational and idealist personality types are capable of substantiating and equally incapable of making logical conclusions. Students with rational and idealist personality types do not meet the indicators of making logical conclusions because the subject is wrong in giving argument formulation because they do not master the concept of arbitrary cosine triangle rule. Students with the rational personality type can perform calculations based on certain rules or formulas, while students with the idealist personality type are unable. This is because the idealist personality kind students use the wrong formula in the problem-solving process. After all, the situation does not understand the concept of arbitrary sine and cosine triangle rules. The idealist personality type student can predict the answer and the solution process, while the rational personality type is unable. This is because students with the rational personality type answer not to the desired answer to the question. After all, they do not understand the query from the question.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Rulous type'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles