Search results for "code"

La «science des lois» et ses formes encyclopédiques

2012

International audience; The paper analyses issues of legal classification during the Age of the Enlightenment by examining links between general structures and declared intentions in three major works of philosophic and legal lexicography: Diderot and d’Alembert’s Encyclopédie , De Felice’s Code de l’Humanité, and the Dictionnaire de Jurisprudence in the Encyclopédie méthodique. What consideration is given to natural law in encyclopaedic compilations? Do dictionaries and encyclopaedias play a part in the modern codification process?

Propriété industrielle. Codification

1992

International audience; (Loi n° 92-597 du 1er juillet 1992)

How does the brain encode epistemic reliability? Perceptual presence, phenomenal transparency, and counterfactual richness

2014

AbstractSeth develops a convincing and detailed internalist alternative to the sensorimotor-contingency theory of perceptual phenomenology. However, there are remaining conceptual problems due to a semantic ambiguity in the notion of “presence” and the idea of “subjective veridicality.” The current model should be integrated with the earlier idea that experiential “realness” and “mind-independence” are determined by the unavailability of earlier processing stages to attention. Counterfactual richness and attentional unavailability may both be indicators of the overall processing level currently achieved, a functional property that normally correlates with epistemic reliability. Perceptual p…

Scientific and Design Stances

2010

Human technology interaction is a strange field of expertise, because both academics and industry are interested in it. And yet, every now and then, it becomes apparent that academics and industry do not always see eye to eye (Carroll, 1997). They seem to think in different manner. While scientists look for how things are, industry mostly seeks out how things should be. Indeed, sometimes two very different stances behind the basic thinking of the two important human–technology interaction (HTI) communities surface. Scientists primarily are interested in general laws and principles, even eternal truths with no exceptions. They want to identify general laws and use them to explain individual …

A simple algorithm to evaluate the local symmetry at each point of a closed contour

1995

In this work, contour symmetry is evaluated as a numeric feature for each point of the shape outline, using only the positions of a local vicinity of points. A measure is defined, named Local Symmetric Deficiency (LSD), so that the lower this quantity is, the higher the symmetry will be in the local region considered. This approach is simpler than related previous ones both from a conceptual point of view and for its implementation, since it is reduced just to a suitable manipulation of the Freeman chain code of the curve studied. Its computational cost is very low and it has the advantages of a parallel algorithm, since values for LSD can be computed for each point independently.

ℓ-distant Hamiltonian walks in Cartesian product graphs

2009

Abstract We introduce and study a generalisation of Hamiltonian cycles: an l-distant Hamiltonian walk in a graph G of order n is a cyclic ordering of its vertices in which consecutive vertices are at distance l. Conditions for a Cartesian product graph to possess such an l-distant Hamiltonian walk are given and more specific results are presented concerning toroidal grids.

A Loopless Generation of Bitstrings without p Consecutive Ones

2001

Let F n (p) be the set of all n-length bitstrings such that there are no p consecutive ls. F n (p) is counted with the pth order Fibonacci numbers and it may be regarded as the subsets of {1, 2,…, n} without p consecutive elements and bitstrings in F n (p) code a particular class of trees or compositions of an integer. In this paper we give a Gray code for F n (p) which can be implemented in a recursive generating algorithm, and finally in a loopless generating algorithm.

A generalization of Sardinas and Patterson's algorithm to z-codes

1993

Abstract This paper concerns the framework of z-codes theory. The main contribution consists in an extension of the algorithm of Sardinas and Patterson for deciding whether a finite set of words X is a z-code. To improve the efficiency of this test we have found a tight upper bound on the length of the shortest words that might have a double z-factorization over X. Some remarks on the complexity of the algorithm are also given. Moreover, a slight modification of this algorithm allows us to compute the z-deciphering delay of X.

Commento agli artt. 316, 316 bis, 316 ter, 317, 317 bis CP

2012

Commento agli artt. 316, 316 bis, 316 ter, 317, 317 bis CP

Franchising in Russia

2006