References of "Lecture Notes in Computer Science"      in Complete repository Arts & humanities   Archaeology   Art & art history   Classical & oriental studies   History   Languages & linguistics   Literature   Performing arts   Philosophy & ethics   Religion & theology   Multidisciplinary, general & others Business & economic sciences   Accounting & auditing   Production, distribution & supply chain management   Finance   General management & organizational theory   Human resources management   Management information systems   Marketing   Strategy & innovation   Quantitative methods in economics & management   General economics & history of economic thought   International economics   Macroeconomics & monetary economics   Microeconomics   Economic systems & public economics   Social economics   Special economic topics (health, labor, transportation…)   Multidisciplinary, general & others Engineering, computing & technology   Aerospace & aeronautics engineering   Architecture   Chemical engineering   Civil engineering   Computer science   Electrical & electronics engineering   Energy   Geological, petroleum & mining engineering   Materials science & engineering   Mechanical engineering   Multidisciplinary, general & others Human health sciences   Alternative medicine   Anesthesia & intensive care   Cardiovascular & respiratory systems   Dentistry & oral medicine   Dermatology   Endocrinology, metabolism & nutrition   Forensic medicine   Gastroenterology & hepatology   General & internal medicine   Geriatrics   Hematology   Immunology & infectious disease   Laboratory medicine & medical technology   Neurology   Oncology   Ophthalmology   Orthopedics, rehabilitation & sports medicine   Otolaryngology   Pediatrics   Pharmacy, pharmacology & toxicology   Psychiatry   Public health, health care sciences & services   Radiology, nuclear medicine & imaging   Reproductive medicine (gynecology, andrology, obstetrics)   Rheumatology   Surgery   Urology & nephrology   Multidisciplinary, general & others Law, criminology & political science   Civil law   Criminal law & procedure   Criminology   Economic & commercial law   European & international law   Judicial law   Metalaw, Roman law, history of law & comparative law   Political science, public administration & international relations   Public law   Social law   Tax law   Multidisciplinary, general & others Life sciences   Agriculture & agronomy   Anatomy (cytology, histology, embryology...) & physiology   Animal production & animal husbandry   Aquatic sciences & oceanology   Biochemistry, biophysics & molecular biology   Biotechnology   Entomology & pest control   Environmental sciences & ecology   Food science   Genetics & genetic processes   Microbiology   Phytobiology (plant sciences, forestry, mycology...)   Veterinary medicine & animal health   Zoology   Multidisciplinary, general & others Physical, chemical, mathematical & earth Sciences   Chemistry   Earth sciences & physical geography   Mathematics   Physics   Space science, astronomy & astrophysics   Multidisciplinary, general & others Social & behavioral sciences, psychology   Animal psychology, ethology & psychobiology   Anthropology   Communication & mass media   Education & instruction   Human geography & demography   Library & information sciences   Neurosciences & behavior   Regional & inter-regional studies   Social work & social policy   Sociology & social sciences   Social, industrial & organizational psychology   Theoretical & cognitive psychology   Treatment & clinical psychology   Multidisciplinary, general & others     Showing results 1 to 20 of 92 1 2 3 4 5     A Brief History of MPLS Usage in IPv6Vanaubel, Yves ; Mérindol, Pascal; Pansiot, Jean-Jacques et alin Lecture Notes in Computer Science (2016)Recent researches have stated the fast deployment of IPv6. It has been demonstrated that IPv6 grows much faster, being so more and more adopted by both Internet service providers but also by servers and ... [more ▼]Recent researches have stated the fast deployment of IPv6. It has been demonstrated that IPv6 grows much faster, being so more and more adopted by both Internet service providers but also by servers and end-hosts. In parallel, researches have been conducted to discover and assess the usage of MPLS tunnels. Indeed, recent developments in the ICMP protocol make certain categories of MPLS tunnels transparent to traceroute probing. However, these studies focus only on IPv4, where MPLS is strongly deployed. In this paper, we provide a first look at how MPLS is used under IPv6 networks using traceroute data collected by CAIDA. At first glance, we observe that the MPLS deployment and usage seem to greatly differ between IPv4 and IPv6, in particular in the way MPLS label stacks are used. While label stacks with at least two labels are marginal in IPv4 (and mostly correspond to a VPN usage), they are prevalent in IPv6. After a deeper analysis of the label stack typical content in IPv6, we show that such tunnels result from the use of 6PE. This is not really surprising since this mechanism was specifically designed to forward IPv6 traffic using MPLS tunnels through networks that are not fully IPv6 compliant. However, we show that it does not result from non dual-stack routers but rather from the absence of native IPv6 MPLS signaling protocols. Finally, we investigate a large Tier-1 network, Cogent, that stands out with an original set-up. [less ▲]Detailed reference viewed: 237 (22 ULg) Permutations and shiftsCharlier, Emilie in Lecture Notes in Computer Science (2016), 9840The entropy of a symbolic dynamical system is usually defined in terms of the growth rate of the number of distinct allowed factors of length $n$. Bandt, Keller and Pompe showed that, for piecewise ... [more ▼]The entropy of a symbolic dynamical system is usually defined in terms of the growth rate of the number of distinct allowed factors of length $n$. Bandt, Keller and Pompe showed that, for piecewise monotone interval maps, the entropy is also given by the number of permutations defined by consecutive elements in the trajectory of a point. This result is the starting point of several works of Elizalde where he investigates permutations in shift systems, notably in full shifts and in beta-shifts. The goal of this talk is to survey Elizalde's results. I will end by mentioning the case of negative beta-shifts, which has been simultaneously studied by Elizalde and Moore on the one hand, and by Steiner and myself on the other hand. [less ▲]Detailed reference viewed: 48 (10 ULg) An Econometric Analysis of Homeownership Determinants in BelgiumXhignesse, Guillaume ; Bianchet, Bruno ; Cools, Mario et alin Lecture Notes in Computer Science (2014, July), 8581In market economies, homeownership is associated with positive ex- ternalities. Increasing the levels of homeownership has been an objective of governments for the last decades. The analysis of the ... [more ▼]In market economies, homeownership is associated with positive ex- ternalities. Increasing the levels of homeownership has been an objective of governments for the last decades. The analysis of the determinants of tenure sta- tus provides information to this end. This paper proposes an econometric analysis of housing tenure in Belgium. We review the main variables that have been considered in the literature as influencing housing tenure, after what we estimate a logit model. We observe a strong influence of income and age on the probability of homeownership. Couple relationship and the presence of dependent children have a positive influence, but this influence is less significant. Urban location is associated with lower probability of homeownership, compared with other areas. Our observations follow the trends described for other countries in the literature. [less ▲]Detailed reference viewed: 119 (40 ULg) Spatial augmented reality in collaborative design training : articulation between I-space, We-space and Space-betweenBen Rajeb, Samia ; Leclercq, Pierre in Lecture Notes in Computer Science (2014), LNCS 8526 / vol 2(part 2), 343-353This paper analyses the use of augmented reality in advanced project-based training in design. Our study considers how augmented environments can contribute to this type of group training : what types of ... [more ▼]This paper analyses the use of augmented reality in advanced project-based training in design. Our study considers how augmented environments can contribute to this type of group training : what types of interaction spaces constitute these new learning environments and how are these spaces constructed so as to promote collective reflection ? [less ▲]Detailed reference viewed: 90 (13 ULg) Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s TheoremAliev, Iskander; De Loera, Jesus; Louveaux, Quentin in Lecture Notes in Computer Science (2014)In this paper we study a generalization of the classical fesibility problem in integer linear programming, where an ILP needs to have a prescribed number of solutions to be considered solved. We first ... [more ▼]In this paper we study a generalization of the classical fesibility problem in integer linear programming, where an ILP needs to have a prescribed number of solutions to be considered solved. We first provide a generalization of the famous Doignon-Bell-Scarf theorem: Given an integer k, we prove that there exists a constant c(k, n), depending only on the dimension n and k, such that if a polyhedron {x : Ax ≤ b} contains exactly k integer solutions, then there exists a subset of the rows of cardinality no more than c(k,n), defining a polyhedron that contains exactly the same k integer solutions. The second contribution of the article presents a structure theory that characterizes precisely the set Sg≥k (A) of all vectors b such that the problem Ax = b, x ≥ 0, x ∈ Zn , has at least k-solutions. We demonstrate that this set is finitely generated, a union of translated copies of a semigroup which can be computed explicitly via Hilbert bases computation. Similar results can be derived for those right-hand-side vectors that have exactly k solutions or fewer than k solutions. Finally we show that, when n, k are fixed natural numbers, one can compute in polynomial time an encoding of Sg≥k(A) as a generating function, using a short sum of rational functions. As a consequence, one can identify all right-hand-side vectors that have exactly k solutions (similarly for at least k or less than k solutions). Under the same assumptions we prove that the k-Frobenius number can be computed in polynomial time. [less ▲]Detailed reference viewed: 56 (1 ULg) The impact of expertise on the capture of sketched intentions: perspectives for remote cooperative designSutera, Jennifer; Yang, Maria C.; Elsen, Catherine in Lecture Notes in Computer Science (2014), 8683The paper describes the way expertise and field-knowledge can impact the transfer of graphical intentions during architectural cooperative design. The analysis of 28 controlled experiments reveals what ... [more ▼]The paper describes the way expertise and field-knowledge can impact the transfer of graphical intentions during architectural cooperative design. The analysis of 28 controlled experiments reveals what matters in transmitting architectural intents and more specifically underlines how novices’ intuitive, deductive processes based on previous and embodied experiences interestingly complement experts’ knowledge of the architectural field and its semantics. The results directly inform how we, as researchers, designers and engineers, should take advantage of both novices’ and experts’ strategies to develop tools, methods or interfaces to support next generation cooperative design. [less ▲]Detailed reference viewed: 52 (7 ULg) Acceleration of Affine Hybrid TransformationsBoigelot, Bernard ; Herbreteau, Frédéric; Mainz, Isabelle in Lecture Notes in Computer Science (2014), 8837This work addresses the computation of the set of reachable configurations of linear hybrid automata. The approach relies on symbolic state-space exploration, using acceleration in order to speed up the ... [more ▼]This work addresses the computation of the set of reachable configurations of linear hybrid automata. The approach relies on symbolic state-space exploration, using acceleration in order to speed up the computation and to make it terminate for a broad class of systems. Our contribution is an original method for accelerating the control cycles of linear hybrid automata, i.e., to compute their unbounded repeated effect. The idea consists in analyzing the data transformations that label these cycles, by reasoning about the geometrical features of the corresponding system of linear constraints. This approach is complete over Multiple Counters Systems (MCS), and is able to accelerate hybrid transformations that are out of scope of existing techniques. [less ▲]Detailed reference viewed: 89 (29 ULg) Self-shuffling wordsCharlier, Emilie ; Kamae, Teturo; Puzynina, Svetlana et alin Lecture Notes in Computer Science (2013), 7966In this paper we introduce and study a new property of infinite words which is invariant under the action of a morphism: We say an infinite word x, defined over a finite alphabet A, is self-shuffling if x ... [more ▼]In this paper we introduce and study a new property of infinite words which is invariant under the action of a morphism: We say an infinite word x, defined over a finite alphabet A, is self-shuffling if x admits factorizations: x=\prod_{i=1}^\infty U_iV_i=\prod_{i=1}^\infty U_i=\prod_{i=1}^\infty V_i with U_i,V_i \in \A^+. In other words, there exists a shuffle of x with itself which reproduces x. The morphic image of any self-shuffling word is again self-shuffling. We prove that many important and well studied words are self-shuffling: This includes the Thue-Morse word and all Sturmian words (except those of the form aC where a is a letter and C is a characteristic Sturmian word). We further establish a number of necessary conditions for a word to be self-shuffling, and show that certain other important words (including the paper-folding word and infinite Lyndon words) are not self-shuffling. In addition to its morphic invariance, which can be used to show that one word is not the morphic image of another, this new notion has other unexpected applications: For instance, as a consequence of our characterization of self-shuffling Sturmian words, we recover a number theoretic result, originally due to Yasutomi, which characterizes pure morphic Sturmian words in the orbit of the characteristic. [less ▲]Detailed reference viewed: 35 (10 ULg) Using spatial augmented reality in synchronous collaborative design : applications in architectural design trainingBen Rajeb, Samia ; Leclercq, Pierre in Lecture Notes in Computer Science (2013)Detailed reference viewed: 109 (13 ULg) On the Number of Abelian Bordered WordsRampersad, Narad; Rigo, Michel ; Salimov, Pavel in Lecture Notes in Computer Science (2013), 7907In the literature, many bijections between (labeled) Motzkin paths and various other combinatorial objects are studied. We consider abelian (un)bordered words and show the connection with irreducible ... [more ▼]In the literature, many bijections between (labeled) Motzkin paths and various other combinatorial objects are studied. We consider abelian (un)bordered words and show the connection with irreducible symmetric Motzkin paths and paths in Z not returning to the origin. This study can be extended to abelian unbordered words over an arbitrary alphabet and we derive expressions to compute the number of these words. In particular, over a 3-letter alphabet, the connection with paths in the triangular lattice is made. Finally, we study the lengths of the abelian unbordered factors occurring in the Thue--Morse word. [less ▲]Detailed reference viewed: 85 (14 ULg) Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite WordsRigo, Michel ; Salimov, Pavel in Lecture Notes in Computer Science (2013), 8079The binomial coefficient of two words u and v is the number of times v occurs as a subsequence of u. Based on this classical notion, we introduce the m-binomial equivalence of two words refining the ... [more ▼]The binomial coefficient of two words u and v is the number of times v occurs as a subsequence of u. Based on this classical notion, we introduce the m-binomial equivalence of two words refining the abelian equivalence. The m-binomial complexity of an infinite word x maps an integer n to the number of m-binomial equivalence classes of factors of length n occurring in x. We study the first properties of m-binomial equivalence. We compute the m-binomial complexity of the Sturmian words and of the Thue-Morse word. We also mention the possible avoidance of 2-binomial squares. [less ▲]Detailed reference viewed: 95 (24 ULg) Automata-Based Symbolic Representations of PolyhedraBoigelot, Bernard ; Brusten, Julien ; Degbomont, Jean-François in Lecture Notes in Computer Science (2012, March), 7183Detailed reference viewed: 89 (30 ULg) What do strokes teach us about collaborative design ?Elsen, Catherine ; Darses, Francoise; Leclercq, Pierre in Lecture Notes in Computer Science (2012), 7467Understanding collaborative design goes far beyond analyzing group dynamics, tasks allocations or negotiation during decision-making processes. In this paper, we focused on the collaborative sketching ... [more ▼]Understanding collaborative design goes far beyond analyzing group dynamics, tasks allocations or negotiation during decision-making processes. In this paper, we focused on the collaborative sketching process, during which the intentions of designers are supported by their sketches and by specific strokes.Twelve professional designers attended an experimental design session, where they were asked to express, share, capture or interpret sketches. A qualitative and quantitative fine-grained analysis of strokes teach us (i) how designers tend to deal with representations that are not theirs; (ii) what main graphical key-features constitute the inner nature of the shared information and (iii) how and when can this graphic essence be shared with collaborators. [less ▲]Detailed reference viewed: 58 (12 ULg) Finding Routing Shortcuts using an Internet Coordinate SystemCantin, François ; Leduc, Guy in Lecture Notes in Computer Science (2011, February 23), 6557Overlay routing is a promising way to improve the quality of service in the Internet but its main drawback is scalability: measuring the characteristics of the paths, exchanging the measurement results ... [more ▼]Overlay routing is a promising way to improve the quality of service in the Internet but its main drawback is scalability: measuring the characteristics of the paths, exchanging the measurement results between the nodes and computing the best routes in the full mesh overlay network generally imply a high consumption of resources. In this paper, we design the basis of a lightweight self-organising one-hop overlay routing mechanism improving the latencies: we define criteria that rely on the information provided by an Internet Coordinate System (ICS) in order to provide a small set of potential one-hop shortcuts for any given path in the network with a small measurement cost. Our best criterion does not guarantee to find the best shortcut for any given path in a network but, even in networks with hundreds or thousands of nodes, it will restrict the search for potential shortcuts to about one or two percent of the total number of nodes. [less ▲]Detailed reference viewed: 101 (16 ULg) Finite orbits of language operationsCharlier, Emilie ; Domaratzski, Michael; Harju, Tero et alin Lecture Notes in Computer Science (2011), 6638We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. This generalizes previous ... [more ▼]We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. This generalizes previous results about complement, Kleene closure, and positive closure. [less ▲]Detailed reference viewed: 29 (3 ULg) Enumeration and decidable properties of automatic sequencesCharlier, Emilie ; Rampersad, Narad; Shallit, Jeffreyin Lecture Notes in Computer Science (2011), 6795We show that various aspects of k-automatic sequences — such as having an unbordered factor of length n — are both decidable and effectively enumerable. As a consequence it follows that many related ... [more ▼]We show that various aspects of k-automatic sequences — such as having an unbordered factor of length n — are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or k-regular. These include many sequences previously studied in the literature, such as the recurrence function, the appearance function, and the repetitivity index. We also give a new characterization of the class of k-regular sequences. Many results extend to other sequences defined in terms of Pisot numeration systems. [less ▲]Detailed reference viewed: 24 (6 ULg) Syntactic complexity of ultimately periodic sets of integersRigo, Michel ; Vandomme, Elise in Lecture Notes in Computer Science (2011), 6638We compute the cardinality of the syntactic monoid of the language 0^∗rep_b(mN) made of base b expansions of the multiples of the integer m. We also give lower bounds for the syntactic complexity of any ... [more ▼]We compute the cardinality of the syntactic monoid of the language 0^∗rep_b(mN) made of base b expansions of the multiples of the integer m. We also give lower bounds for the syntactic complexity of any (ultimately) periodic set of integers written in base b. We apply our results to some well studied problem: decide whether or not a b-recognizable sets of integers is ultimately periodic. [less ▲]Detailed reference viewed: 110 (30 ULg) An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory ModelsLinden, Alexander ; Wolper, Pierre in Lecture Notes in Computer Science (2010, September)This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relaxation, which corresponds ... [more ▼]This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relaxation, which corresponds to the use of store buffers. The proposed approach proceeds by using finite automata to symbolically represent the possible contents of the store buffers. Store, load and commit operations then correspond to operations on these finite automata. The advantage of this approach is that it operates on (potentially infinite) sets of buffer contents, rather than on individual buffer configurations. This provides a way to tame the explosion of the number of possible buffer configurations, while preserving the full generality of the analysis. It is thus possible to check even designs that exploit the relaxed memory model in unusual ways. An experimental implementation has been used to validate the feasibility of the approach. [less ▲]Detailed reference viewed: 257 (82 ULg) Network Distance Prediction Based on Decentralized Matrix FactorizationLiao, Yongjun ; Geurts, Pierre ; Leduc, Guy in Lecture Notes in Computer Science (2010, May 11), 6091Network Coordinate Systems (NCS) are promising techniques to predict unknown network distances from a limited number of measurements. Most NCS algorithms are based on metric space embedding and suffer ... [more ▼]Network Coordinate Systems (NCS) are promising techniques to predict unknown network distances from a limited number of measurements. Most NCS algorithms are based on metric space embedding and suffer from the inability to represent distance asymmetries and Triangle Inequality Violations (TIVs). To overcome these drawbacks, we formulate the problem of network distance prediction as guessing the missing elements of a distance matrix and solve it by matrix factorization. A distinct feature of our approach, called Decentralized Matrix Factorization (DMF), is that it is fully decentralized. The factorization of the incomplete distance matrix is collaboratively and iteratively done at all nodes with each node retrieving only a small number of distance measurements. There are no special nodes such as landmarks nor a central node where the distance measurements are collected and stored. We compare DMF with two popular NCS algorithms: Vivaldi and IDES. The former is based on metric space embedding, while the latter is also based on matrix factorization but uses landmarks. Experimental results show thatDMF achieves competitive accuracy with the double advantage of having no landmarks and of being able to represent distance asymmetries and TIVs. [less ▲]Detailed reference viewed: 148 (20 ULg) Numeration Systems: a Link between Number Theory and Formal Language TheoryRigo, Michel in Lecture Notes in Computer Science (2010), 6224We survey facts mostly emerging from the seminal results of Alan Cobham obtained in the late sixties and early seventies. We do not attempt to be exhaustive but try instead to give some personal ... [more ▼]We survey facts mostly emerging from the seminal results of Alan Cobham obtained in the late sixties and early seventies. We do not attempt to be exhaustive but try instead to give some personal interpretations and some research directions. We discuss the notion of numeration systems, recognizable sets of integers and automatic sequences. We brie y sketch some results about transcendence related to the representation of real numbers. We conclude with some applications to combinatorial game theory and veri cation of in nite-state systems and present a list of open problems. [less ▲]Detailed reference viewed: 117 (14 ULg) 1 2 3 4 5