Topic
IP set
About: IP set is a research topic. Over the lifetime, 28 publications have been published within this topic receiving 178 citations.
Papers
TL;DR: An Eulerian framework for modelling fluid–structure interaction (FSI) of incompressible fluids and elastic structures by tracking the movement of the initial positions of all ‘material’ points is proposed.
Abstract: We propose an Eulerian framework for modelling fluid-structure interaction (FSI) of incompressible fluids and elastic structures. The model is based on an Eulerian approach for describing structural dynamics. This is achieved by tracking the movement of the initial positions of all 'material' points. In this approach the displacement appears as a primary variable in an Eulerian framework. Our approach uses a technique which is similar to the level set method in so far that it also tracks initial data, in our case the set of initial positions (IP), and from this determines to which 'phase' a point belongs. To avoid the occasional reinitialization of the initial position set we employ the harmonic continuation of the structure velocity field into the fluid domain. By using the IP set for tracking the structure displacement, we can ensure that corners and edges of the fluid-structure interface are preserved well. Based on this monolythic model of the FSI we apply the Dual Weighted Residual (DWR) method for goal-oriented a posteriori error estimation to stationary FSI problems. Examples are presented based on the model and for the goal-oriented local mesh adaptation.
163 citations
Patent•
21 Mar 2007
TL;DR: In this article, a method for dynamically distributing IP address on set-top box includes connecting client end module to IPTV set top box of Internet and using service end modules to distribute and manage DHCP server of IP, utilizing settop box at client end to monitor UDP port 67 and to send IP address leasing request as well as to configure TCP / IP.
Abstract: A method for dynamically distributing IP address on set-top box includes connecting client end module to IPTV set top box of Internet and using service end module to distribute and manage DHCP server of IP, utilizing set-top box at client end to monitor UDP port 67 and to send IP address leasing request as well as to configure TCP / IP, using server at service end to receive IP address leasing request of set -top box and to return confirmed IP address back as well as to change IP address mapping table on server.
16 citations
TL;DR: In this article, it was shown that a polynomial function cannot be generated by finite automata, except for the trivial case when they are ultimately periodic, and that any hypothetical counterexample is periodic away from a very sparse and structured set.
Abstract: We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic.Using methods from ergodic theory, we are able to partially resolve this conjecture, proving that any hypothetical counterexample is periodic away from a very sparse and structured set. In particular, we show that for a polynomial is not given by a generalised polynomial.
12 citations
TL;DR: In this paper, generalised polynomials (i.e. polynomial-like expressions involving the use of the floor function) are investigated and the main result is that the set of integers where a sparse generalised polynomial takes non-zero value cannot contain a translate of an IP set.
Abstract: We investigate generalised polynomials (i.e. polynomial-like expressions involving the use of the floor function) which take the value $0$ on all integers except for a set of density $0$.
Our main result is that the set of integers where a sparse generalised polynomial takes non-zero value cannot contain a translate of an IP set. We also study some explicit constructions, and show that the characteristic functions of the Fibonacci and Tribonacci numbers are given by generalised polynomails. Finally, we show that any sufficiently sparse $\{0,1\}$-valued sequence is given by a generalised polynomial.
(This paper is essentially the first half of our earlier submission arXiv:1610.03900 [math.NT]. Because the material in arXiv:1610.03900 [math.NT] touches upon many different subjects, we believe it is preferable to split it into two independent papers.)
11 citations
Patent•
8 Dec 2010
TL;DR: In this paper, a peer in the network uses a detecting tool to acquire the IP address information of a router and a time lag value corresponding to the router so as to generate a router IP set of the peer.
Abstract: The invention discloses a method for realizing the establishment of a peer clustering, which is applied to a P2P network and includes the steps that: a peer in the network uses a detecting tool to acquire the IP address information of a router and a time lag value corresponding to the router so as to generate a router IP set of the peer; dimidiate clustering is carried out to the router IP set toobtain a far set and a near set of the peer; all the peers in the network form the peer clustering by taking the router IP address in the near set as a keyword. The invention also discloses a peer communication method, the peer sending a communication request selects the IP address of the router from the near set of the peer as the keyword and initiates an inquiry to the network to match out the corresponding peer clustering, and the peers in the same peer clustering are taken as the close distance peers to realize communication. The application of the method of the invention can successfullyacquire the peers with close physical distance for communication.
9 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 2020 | 1 |
| 2019 | 7 |
| 2018 | 1 |
| 2017 | 4 |
| 2016 | 2 |