text:
FR2895614A1 - Network functional entity encoding method for telecommunication network, involves encoding paired regrouping of two network entities into single current functional entity based on regrouping relevance threshold and regrouping gain values - Google Patents
Network functional entity encoding method for telecommunication network, involves encoding paired regrouping of two network entities into single current functional entity based on regrouping relevance threshold and regrouping gain values Download PDF
FR2895614A1
FR2895614A1 FR0513162A FR0513162A FR2895614A1 FR 2895614 A1 FR2895614 A1 FR 2895614A1 FR 0513162 A FR0513162 A FR 0513162A FR 0513162 A FR0513162 A FR 0513162A FR 2895614 A1 FR2895614 A1 FR 2895614A1
functional entity
FR0513162A
Jacques Simonin
Mohamed Fouz Menai
Francis Alizon
France Telecom SA
2005-12-22 Application filed by France Telecom SA filed Critical France Telecom SA
2005-12-22 Priority to FR0513162A priority Critical patent/FR2895614A1/en
2007-06-29 Publication of FR2895614A1 publication Critical patent/FR2895614A1/en
238000004364 calculation methods Methods 0 abstract 1
238000004590 computer program Methods 0 abstract 1
239000002609 media Substances 0 abstract 1
238000003860 storage Methods 0 abstract 1
H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
H04L41/02—Arrangements for maintenance or administration or management of packet switching networks involving integration or standardization
H04L41/0233—Arrangements for maintenance or administration or management of packet switching networks involving integration or standardization using object oriented techniques, e.g. common object request broker architecture [CORBA] for representation of network management data
G06F8/00—Arrangements for software engineering
H04L41/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
H04L41/145—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning involving simulating, designing, planning or modelling of a network
The method involves representing signal exchanges in the form of a modeling sequence diagram, where the signal exchanges are made between network functions. Each function is encoded according to a unary functional network entity. A calculation is performed repeatedly based on a scenario of a business relevance indicator for regrouping the functional entities into a same functional network entity. Paired regrouping of two functional network entities into a single current functional entity is encoded according to a regrouping relevance threshold value and a regrouping gain value. The regrouping gain value is equal to a relation of a value of the business relevance indicator of the paired regrouping of the network entities and the regrouping relevance threshold value. Independent claims are also included for the following: (1) a tool for modeling a telecommunication network and comprising a functional entity encoding module permitting the implementation of a network functional entity encoding method (2) a computer program product stored in a storage medium and executable by a computer or by a telecommunication network modeling tool.
METHOD FOR ENCODING FUNCTIONAL ENTITIES NETWORK FROM FUNCTIONS
The invention relates to a method for defining and coding network functional entities from network functions of a telecommunications network and a corresponding modeling tool making it possible to optimize, in particular, the volume of the telecommunications network. data flows exchanged on this network necessary to optimize the performance of all the network functions and their maintenance. The network functions may for example represent a distribution service for audiovisual content on this network. The industrial implementation of telecommunications networks is of crucial importance because of the exponential increase in the exchange of data of all kinds on the latter. For the implementation of modern telecommunication networks, those of the present and those of the future, to ensure their maintenance, and, of course, their evolution in terms of capacity and / or new functionalities, it has appeared essential to ensure the definition. and coherently encoding the network functional entities, due to their involvement in the optimal implementation of the network functionalities and network services ensuring the operation of the telecommunications networks.
The architecture of the network functions of a telecommunications network can be modeled according to an oriented graph consisting of two types of nodes: the functions; reference points.
In the context of modeling from a commercially available modeling language, such as the UML (Unified Modeling Language), for a presentation of the UML language, reference may be made to the G. Booch, J. Rumbaugh and I. Jacobson entitled "The Unified Modeling Language User Guide", Addison-Wesley, 1999) in its UML 2.0 version, the aforementioned functions and reference points are respectively components and functions. connectors. In general terms, the functions constitute logical and / or arithmetic processing nodes capable of acting on the data, that is to say, producing, recording or using them. They thus have interfaces enabling the intrinsic processing procedures to be activated or to activate the procedures for processing other functions, thanks to the operations offered respectively to the operations required, in the sense of the aforementioned UML 2.0 language. Each instance of a function defines a link between the function and the reference points associated with it. The link between two or more instances of these functions is thus modeled by the abovementioned reference points. Thus, information produced or transformed by a function can be sent to another function under the control of a reference point in two ways: by the user side, to initiate or transfer a processing by the provider side function; by the provider side to respond to a request for processing initiated by the user side function. An information model is a set of concepts and associations that can be used to map information related to a given domain or profession in a consistent manner. The set of concepts can be represented by UML classes when the UML modeling language is used. The information model is obtained, in general, following a business analysis phase. However, the means necessary for grouping network functions into a network functional entity have never been published in the state of the art. In fact, only the knowledge of the business experts in telecommunications network is used in the definition of network functional entities or groupings of network functions in the prior art. The aforementioned prior art is an important part of know-how, if not empiricism, and can not therefore allow the study of all possible choices concerning the groupings of a large number of network functions. The present invention aims to overcome the disadvantages and limitations of the techniques of the prior art.
In particular, an object of the present invention is the implementation of a method for defining and coding network functional entities making it possible to simplify the industrial development of the latter and the network functionalities of telecommunications networks for their implementation. .
Another object of the present invention, in addition to the aforementioned simplification, is the implementation of a method for defining and coding network functional entities that, because of the reduction in the number and the volume of network control data manipulated and the number of reference points provided or used by the network functions of a telecommunications network and necessary for the manipulation of these network control data, an optimal modeling of this telecommunications network. Another object of the present invention is to provide the means necessary to achieve the objects just mentioned in a completely automated manner. The method of encoding network functional entities from network functions exchanging at least one signal via a reference point of a telecommunications network model, object of the invention, is remarkable in that it consists at least in establishing and representing the signal exchanges in the form of a modeling sequence diagram, highlighting, for at least one feature and / or network service scenario, the successive exchanges of signals between these network functions , and, each network function being encoded according to a unary network functional entity, iteratively executing steps for calculating, from at least one scenario, a business relevance indicator of grouping network functional entities into a single network functional entity in said functionality and / or said network service into at least one current network functional entity, according to a value a grouping relevance threshold and a grouping gain value, said grouping gain value being defined as the ratio of the value of the business relevance indicator of the two-by-two grouping of said network functional entities and the threshold value of relevance of said grouping. The method which is the subject of the invention is furthermore remarkable in that the modeling sequence is constituted either by the successive signal sequences exchanged by these network functions or by the network function sequences corresponding to these successive signal exchanges. . The method which is the subject of the invention is also remarkable in that, for any network functional entity, the business relevance indicator of grouping is taken equal to the ratio of the total number of groupings of the network function of a unary network functional entity and from another network functional entity to the total number of distinct network function sequences, regardless of the content of the signals. The method which is the subject of the invention is furthermore remarkable in that the network function sequences taken into account for calculating the business relevance indicator of grouping a network functional entity are the maximum internal network function sequences. to this network functional entity. The method which is the subject of the invention is finally remarkable in that for a first and a second network functional entity grouping together a first and a second number of network functions respectively, the threshold value of grouping the network functions belonging to the first and second entities functional network is taken equal to the ratio of the weighted total number of groupings of a network function belonging to the first respectively to the second network functional entity with the second respectively the first network functional entity to the total number of network function sequences distinct from the first and the second network functional entity. The invention also covers a tool for modeling a telecommunications network, in the form of network functions, network functional entities and network elements arranged according to an architecture of network functions exchanging the signals, which comprises, in addition to a central unit process and a modeling module, a module for encoding network functional entities from network functions exchanging at least one signal via a reference point of a model of this telecommunications network, this module of encoding for establishing and representing signal exchanges in the form of a modeling sequence diagram, showing, for at least one feature and / or network service scenario, the successive exchanges of signals between these network functions, and, each network function being coded according to a unary network functional entity, to iteratively execute steps allowing t calculating, from at least one scenario, a network functional entity grouping business relevance indicator in the same network functional entity in said functionality and / or said network service into at least one current network functional entity, in according to a grouping relevance threshold value and a grouping gain value, said grouping gain value being defined as the ratio of the business relevance indicator value of the two-to-two grouping of said functional entities network and the threshold value of relevance of said grouping. The method and the modeling tool, which are the subject of the invention, are applicable to the development and evolutionary maintenance of telecommunication networks of all types. The method and the modeling tool that are the subject of the invention will be better understood on reading the description and on observing the drawings below, in which: FIG. 1 represents the architecture of the network functions of an entity functional network designated Network Network Network Service Attachment My TV line, Figure 2 represents, for illustrative purposes, a flow chart of the essential steps of implementation of the method of encoding network functional entities object of the present invention; FIG. 3a represents, for purely illustrative purposes, a modeling sequence diagram representing the successive signal exchanges between network functions of a telecommunications network during the execution of a first scenario of execution of these network functions for execution. a determined network functionality; FIG. 3b represents, for purely illustrative purposes, a modeling sequence diagram representing the successive exchanges of signals between network functions during the execution of a second scenario of execution of these network functions for the execution of the same network functionality than that described with reference to FIG. 3a; FIG. 3c represents, for purely illustrative purposes, a preferred embodiment of the method that is the subject of the invention, making it possible to manage the grouping of network functional entities, for a plurality of distinct network functionalities, each network functionality being obtained thanks to at the execution of a determined number of successive iterations; and FIG. 4 represents, by way of nonlimiting example, a modeling tool, in accordance with the subject of the present invention, incorporating a functional entity coding module enabling the implementation of the method that is the subject of the invention. invention. A more detailed description of the network functional entity coding method from network function according to the subject of the present invention will be given below. This description presents, for illustrative purposes only, the network service Ma ligne TV, which is a television broadcasting service over an IP network or telephone line marketed by France Telecom. Appendix 1 provides a descriptive list of the functions and messages used to implement this "My TV Line" service.
Prior to the description of the coding method which is the subject of the invention, indications will be given in connection with FIG. 1 relative to various general definitions involved in the context of the implementation of the method which is the subject of the invention. Network Control Information: any information produced, transmitted or stored within a telecommunications network enabling the implementation of all the network functionalities of the latter; network functionality: set of network functions; a network service provided by a telecommunications network such as missed call management, consists of a set of network features; network control data: any digital data produced transmitted or stored within a telecommunications network, and serving as information carrier for the network control; network planning rule: a rule for the conditional establishment of the relative arrangement and interaction of network functions, network functional entities, grouping of network functions, and network devices allowing the legitimate implementation of network functions or entities network functionalities for performing network functionality. As part of the network function architecture of the Network Attachment feature shown in Figure 1, network functions, excluding support network functions, are: Access Management, Line Identification, - Line Authentication.
The support network function of the User Information Function type is the following: - User Profile Resource Control Database.
The reference points RPX, RP3, RP4, RP4bis, RP6, RP6b, s as shown in FIG. 1, are the reference points which connect the corresponding network functions. The network control signals exchanged between the network function are the following: S2 Network Address Request, S7 Line Identification Request, S8 Line Identification Information Request; - S9 Line Identification Information Response; - S10 Line Identification Response, - S11 Line Authentication Request, - S12 Line Authentication Information Request, - S13 Line Authentication Information Response, - S14 Line Authentication Response.
It is understood in particular that the aforementioned functions represented by ovals in FIG. 1 and the aforementioned signals S2 to S14 and the reference points connecting these functions correspond to elements known from the state of the art, because implemented in the Network Attachment feature of My TV Line Network Service. Accordingly, the designation of the above-mentioned network functions, network control signals is the original designation of the latter. It is understood, in particular, that the implementation of the method which is the subject of the invention is not limited to the example given with reference to FIG. 1, but on the contrary can perhaps be applied to any set of network functions {F ,,} v:, these functions being connected by reference points forming a set of reference points {RP ,. ,, = R, the set of signals exchanged by the aforementioned functions being noted with reference to FIG. 2, the method which is the subject of the invention includes a step A of establishing and representing the signal exchanges. in the form of a modeling sequence diagram, this diagram being denoted K., F ,, Si} ''.
Such a diagram makes it possible to highlight, for at least one scenario of functionality and / or network service, the successive exchanges of signals between the aforementioned network functions. In addition, step A consists in a remarkable way in coding each network function F a according to a unary network functional entity comprising, by definition, at the start and before the implementation of the coding method which is the subject of the invention itself, one and one only network function F. The coding operation according to a unary network functional entity is noted in step A of FIG. 2: {FI. } v = 1 ù + {EFV {v = / It is understood, for example, that the operation of coding according to a unary network functional entity consists in a practical way in declaring any network function Fä as a network functional entity EFä within the framework of the implementation of the method according to the invention by means of a modeling language, such as the UML modeling language for example. Step A corresponds substantially to an initialization step. The above-mentioned step A is followed by an iterative process comprising the step B of calculating, from at least one scenario, a business relevance indicator for grouping network functional entities into a single network functional entity. the functionality and / or network service considered. In general, in step B, the network functional entity grouping business relevance indicator is a function, for one or more telecommunications services existing or to be developed, of distinct sequences of signals transmitted to network functions capable of to be grouped into network functional entities. More specifically, it is indicated that the sequences are independent given the signals exchanged successively between the network functions that can be grouped together. According to a remarkable aspect of the network functional entity coding method from network functions that are the subject of the invention, for any existing or future EFä network functional entity, the indicator of the business relevance of grouping satisfies the relation: 2 * (+ t (i -1) * NS; (EF) 2 * C, +1 NS; (EF) I (EF) = (1) S (EFI U EFz). (2) In the previous relation and in the In the present description, the symbol U represents the grouping of two unary or non-unary functional entities.According to a remarkable aspect of the coding method that is the subject of the invention, the grouping gain value is defined as the ratio of the value of the indicator of the business relevance of the two-to-two grouping I (EF1U EF2) of the network functional entities EF1 and EF2 and of the relevance threshold value of the grouping S (EF1, EF2), It is understood, in particular, that the coding of the grouping two to two of the functional entities mentioned above, as represented n Figure 2, includes a step Co allowing the effective calculation of the grouping relevance threshold value which satisfies the relation: 2 • r, + 12 <+1 (3) 1 1 NSr (EFI) * NSi (EF2) 25 i = li = 1 Referring to the aforementioned relation (3) giving the threshold value Step B is then followed by a step C consisting in coding the two by two grouping of network functional entities in at least one entity functional current network function EFc according to a grouping relevance threshold value denoted S (EF1, EF2) and a group gain value noted according to the relation: F (EF, U EFz) = I (EF 'U EF2) 2 • C + 1 2 * c, + 1 1 1 (i + jù1) * (NSi (EF1) * NS5 (EF,)) S (EF1, EF2) = '_I' _ 'of grouping relevance, we It is understood that the method which is the subject of the invention consists in grouping together two iteratively the functional entities present during the implementation of the method. Thus, this grouping concerns not only the unary network functional entities defined in step A of FIG. 2, but also any current functional entity obtained by grouping previous functional entities and another existing functional entity. The aggregation threshold of two network functional entities is therefore proposed as a minimum to be achieved for the business relevance indicator of the result group business entity. The proposed choice is therefore to obtain at least one additional signal exchange in each sequence deduced from the combinations of the sequences extracted from the two functional entities to be grouped together.
For network functional entities EF1 and EF2 for example grouping respectively n and m network functions, then the threshold value S (EF1, EF2) beyond which the grouping of the network functions belonging to the network functional entities EF1 and EF2 is relevant, verifies the relation (2) previously mentioned in the description.
It is understood, in particular, that for any functional network entity the business relevance indicator for grouping functional entities I (EF) represented by the relation (1) in step B is taken equal to the ratio of the total number of groupings of a network function and a network functional entity, the total number given by the numerator of the relation (1) executed in the previous step B, to the total number of distinct network function sequences given by the denominator of the relation ( 1), regardless of the content of the signals. In particular, it is indicated that the maximum number of network functions in a sequence of n network functions is 2 * C, 2, +1. Indeed, by hypothesis, each pair of functions can involve at most an exchange of two signals between these functions. From the relevance threshold value S (EF1, EF2) as calculated according to the relation (3) in step Co for the grouping of the two functional network entities EF1 and EF2 mentioned above and in order to define the best possible groupings of entities, the estimation of the grouping gain of two network functional entities EF1 and EF2 is defined according to the relation (2) as described previously in the description. To ensure the iterative nature of the calculation steps B and C above, step C shown in FIG. 2 may advantageously comprise a step CI comparing the value of the gain by comparison of superiority or equality to the value 1.
On a positive response to the above-mentioned CI test, the functions EF1 and EF2 are grouped together in a step C3 to generate the current network functional entity EFc according to the relation: EF, U EF2 = EF ~ represented in FIG.
Step C3 can then be followed by a step C4 of deleting the functional entities EF1 and EF2, which have been grouped together in the previous step C3, and of introducing the current functional entity EF, in the set of functional entities, noted {EF} v = j,. Step C4 is then followed by a step back to step B of computation of the business relevance indicator of functional entity grouping, due to the introduction of the new current functional entity and the deletion of functional entities EFi and EF2 which have been grouped together. On the contrary, on a negative response to the IC test the grouping gain is not significant, the step CI is then followed by a step C2 in which the presumed grouping of the functional entities EF1 and EF2 is ignored. Step C2 is then followed by a return to step B to ensure the iterative process from the set of starting unary functional entities and / or the current functional entity EFc for example. An example of the implementation of the method of encoding network functional entities, object of the present invention, from network function will now be given in a concrete case in connection with Figures 3a and 3b.
Recall that FIG. 3a corresponds to a first scenario in which the Line Identification function is called after the Access Management function and where the Line Authentication function is called concomitantly with the call of the Line Identification function whereas in FIG. 3b the Line Authentication and Line Identification functions are switched as well as the signals exchanged by these functions with the Access Management function. In general, it is indicated that the modeling sequence established in step A of FIG. 2 consists either of the successive signal sequences exchanged by the network functions or of the network function sequences corresponding to these exchanges of signals. successive signals. It is understood, in particular, that the signals exchanged between network functions being oriented, there is a one-to-one correspondence between an oriented signal exchanged by two network functions and the corresponding network functions, by means of the reference point which makes it possible to connect the two network functions. In addition, with reference to FIGS. 3a and 3b above, and according to a remarkable aspect of the coding method of the present invention, the network function sequences taken into account in the computation of the business relevance indicator of functional entity grouping. Network I (EF) are the maximum length sequences internally to the functional entity under consideration.
The preceding rule constituting a network planning rule allowing the implementation of the method of encoding network functional entities from the network function object of the present invention, implies that if a functional entity EF is formed by 3 network functions is EF = {FI, F2, F3} and if there exists an ordered sequence of F1 F2 F3 signals then the ordered sequences FI -> F2 and F2 - + F3 are not to be taken into account for the calculation of the relevance indicator business of grouping of functional entities network I (EF).
The aforementioned ordered sequences are to be included in the computation of the network functional entity clustering (EF) business relevance indicator only when the aforementioned sequences exist as sequences of maximum length in a scenario. In such a case, there exists a sequence of signals F1 -3 F2 -3 F4 and a sequence F2 - F3 - * F5 such that F4 and F5 do not belong to the functional entity EF. With reference to FIGS. 3a and 3b, for a functional entity EF = {Access Management, Line Identification} then: the network function sequences are: Access Management Line Identification corresponding to the successive signals exchanged S7 or S'7; • Line Identification - Access management successive signals exchanged S10 or S'10; - Access management is the only element of the sequence when in the second scenario it receives the signal S'2 and sends the signal S'11. The number of sequences of i distinct network functions is then given by: NS2 (EF) = 2 and NS1 (EF) = 1 for two distinct network functions. The indicator of business relevance of the aforementioned functional entity EF for the two scenarios chosen and illustrated in FIGS. 3a and 3b is therefore such that:
(0 * 1) + (1 * 2) + (2 * 0) _2 1 + 2 + 0 3 Finally it is understood that for a first and a second network functional entity comprising a first and a second number of network functions, the S (EF1, EF2) of the network functions belonging to the first and I (EF) = 3 NS; (EF) second network functional entities mentioned above is taken as the ratio of the total weighted number of grouping of a network function belonging to the first and / or the second network functional entity, this weighted total number being represented by the numerator of the relation (3) previously given in the description, to the total number of distinct network function sequences and the first and the second network functional entity, the total number represented by the denominator of the aforementioned relation (3). In the previous relation, the weighting term is given by: (i + j-1), this term corresponding to the sum of the i-1 and j-1 links connecting the functional functions of the network functional entities EF1 and EF2 increased by the link which connects the entities EF1 and EF2 above. Finally, in the particular case of two network functional entities EF1 and EF2 each consisting of one and only one network function, then the number of sequences of i distinct network functions, is given by: NS1 (EF1) = 1 and NS1 (EF2) ) = 1 with n = m = 1. Under these conditions, the network function grouping relevance threshold value is: (i + j1) * (NSi (EFI) * NS; (EF2)) S (EF1, EF2) _ '' 1 * (1 * 1) NS = (EF1) * NS; (EF2) J = I i = 1 The relevance threshold of the grouping of two network functions of the same network functional entity is therefore equal to 1 which of course corresponds to the effective grouping of the aforementioned network functions in the corresponding network functional entity. For an EF = {Access Management, Line Identification} functional functional entity, the relevance indicator calculated for the two scenarios as represented in FIGS. 3a and 3b is such that: I (EF) = 2/3 <1.
Consequently, the grouping in the same network functional entity 1 * 1 of the Access Management and Line Identification network functions is therefore not relevant for the proposed scenarios as represented in FIGS. 3a and 3b. In the case where the functional entity considered is EF = {Line Identification, User Profile Resource Control Database} then: - the sequence of three network functions is given by: Line Identification -> User Profile Resource Control Database - + Line Identification by successive signals exchanged S8 and S9 or S'8 and S'9 as shown in Figure 3a respectively 3b.
The User Profile Resource Control Database function is the only element in the sequence when it receives the signal S12 and transmits the signal S13 or receives the signal S'12 and transmits S'13. This implies the value of the number of sequences of i distinct network functions according to: NS3 (EF) = 1 and NS1 (EF) = 1 for two distinct network functions. The business relevance indicator of grouping for the functional entity EF for the two scenarios chosen and represented in FIGS. 3a and 3b has the value: I (EF) _ (0 * 1) + (1 * 0) + (2 * 1) = 1? . 1 + 1 As a result, the bundling of the Line Identification and User Profile Resource Control Database network functions in a single network functional entity is therefore relevant for the service scenarios as shown in Figures 3a and 3b. The gain of this grouping is: F (EF) = A more detailed description of a preferred implementation of the coding method that is the subject of the present invention making it possible to define the network functional entities by grouping network and / or entity functions Network functionalities of a telecommunications service will now be given in connection with Figure 3c. The above implementation mode makes it possible, in particular, to consolidate the network functions and network functional entities exhaustively for any set of network functions. The exhaustive character of the grouping is understood to mean that for each network functional entity resulting from a grouping of network functions and in particular of unary network functional entities declared at initialization, that is to say at the stage In FIG. 2, the grouping gain of all the network functions of each network functional entity thus obtained by grouping is at least equal to 1. In these conditions, with reference to FIG. 3c, it is considered that step A of FIG. Figure 2 has been executed for example. The process described in connection with FIG. 3c therefore relates to a preferential embodiment of the iterative process of FIG. 2. Consequently, in addition to the set of network functions {EFF} v- ', all of the functions unary network functional entities {EF ,,} v-,, the number Nk_1 of unary or non-unary network functional entities as a function of the rank k-1 of the iteration and the number No = V number of network functions and unary network functional entities initialized, following the implementation of step A of Figure 2. With reference to Figure 3c above, to define the network functional entities by grouping the network functions and / or network functional entities, the process object of the The invention comprises a step of initializing the iteration variables denoted by BC0 in FIG. 3c. The aforementioned step consists, for each clustering iteration of rank k determined for any pair of network functions of rank i and j = "; - 'and for the corresponding unary functional entities to initialize the clustering gain values of a matrix grouping gains of functional entities of rank (k-1) i and (k-1) j The above-mentioned gain matrix is noted: GM {r (kI) i, (kI) j Lk-1 The step d initialization of the iteration variables also consists in initializing to 1 a grouping authorization variable of any network functional entity of rank (k-1) i with another network functional entity, the aggregation authorization variables being thus constituted in a set of values noted: GA A ~ k_I ~ i k-1 In the aforementioned step BC0, one thus considers any pair of functional entities of rank i and j.The step BC0 is followed by a step BC1 consisting of for any pair of functional entities mentioned above, to verify proud that the value of the business relevance indicator is greater than or equal to the value of the relevance of the grouping. This operation in step BC1 is performed by a test verifying the relation: (k-I) i, (k-I) j i by comparison of superiority or equality at the value 1, F (k_I) i. (k_I) j designating the value of the gain for each pair of functional entities EF (k-1) i, EF (k-1) i. On a negative response to the aforementioned BC1 test, a step BC2 is called, which consists of passing to the following index values i and j for another pair of functional entities considered in the same value of iteration rank k. Step BC2 is followed by a return to the previous step BC0. The return is made as long as the test executed in step BC1 provides a negative response.
On the contrary, on a positive response to the test of the aforementioned step BC1, the method which is the subject of the invention, the implementation of which is represented in FIG. 3c, consists of a step BC3 to update the value of the grouping gain of the functional entities of rank (k-1) i and (k-1) j. During the same step BC3, the value of the grouping gain updated, that is to say the matrix of the corresponding gain values GM (F (k,), (k _,) i) is then traversed in descending order of grouping gain values. As long as the grouping gain value is not 0 and if the grouping permission values of the (k-1) i and (k-1) i functional entities allow groupings, a corresponding test on the values of grouping authorization being carried out in step BC4 according to the relation: A (k_1) i = 1 AND A (k_1) j = 1 on positive response to the aforementioned BC4 test, grouping of the current functional entities of rank (k -1) i and (k-1) j in step BC5 according to the relation: EF (k_1) i U EF (k-1) j - * EFkc. The step BC5 may be followed by a step BC6 of deleting the functional entities EF (k_1) i, EF (k_1) j from the set of unary functions {FE}: v and setting to zero of A (k_1) i and A (k_1) j, and step BC6 is itself followed by a step BC7 in which the current functional entity EFkc is included in the set of functional entities that are iterated and noted {ET ',} ::, v. Step BC7 is itself followed by a return to step BC0. On the contrary, in a negative response to the BC4 test, that is, if the grouping authorization values of the functional entities of rank (k-1) i and (k-1) j no longer allow grouping, then the grouping assumed in step BC8 of the functional entities EF (k_1) i, EF (k_1) j is ignored. For i and for any functional entity of rank i whose grouping authorization variable is equal to 1, this condition being executed by checking in step BC9 by the relation: A (k-1) i = 1 or A (k_1) j = 1, in a step BC10, a recovery of the non-grouped network functional entities, that is to say the functional entities EF (k_1) i or EF (k_1) j, is carried out and the entities are reassigned. non-grouped network functionalities as unary functional entities. This operation is performed in step BC10 according to the relation EF (k_1); OR EF (k_1) i E {EFv} =; . Step BC10 is then followed by a step BC11 making it possible to call the next iteration as long as there exists a value A (k_1); = 1 or A (k_1) i = 1 verified in step BC9. The return to the next iteration in the step BC11 is carried out until the end of the iterative process which is interrupted when for example there exists no aggregation authorization value A (k_1); = 1 or A (k_1 ) 1 = 1 verified in step BC9. Note that it can occur at the (k-1) th iteration that an entity EF (k-1) i is grouped with another entity EF (k-1) j; this implies that, following the aforementioned BC4 test, it is necessary to provide a test on the existence of a gain greater than or equal to 1, to be implemented during the (k-1) th iteration; if the result of this test is positive, return to step BC0; if the result of this test is negative, it is necessary to replace the step BC8 by a step of insertion of the non-grouped entities, and the BC9 step by a test on the elements A (k-1) i equal to 1; if the response to this test is positive, step BC10 must be replaced by the operation EF (k-1) i -> EFkx. To simplify FIG. 3c, the steps described in this paragraph have not been represented. The pseudo-code allowing the implementation of the method which is the subject of the invention, as represented in FIG. 3c, is given in a specific coding mode given purely by way of illustration in Appendix 2 of the present description. A detailed description of the embodiment of the method according to the invention in accordance with the algorithmic process of FIG. 3c, when this process is applied to the telecommunication service Ma 2 5 line TV is now given by way of illustration hereinafter. This illustration highlights the advantages of simplifying the development of this telecommunications service, both in terms of the number of network data handled and the reference points, provided or used, necessary for the scenarios envisaged for the service. The definition of functional entities from the grouping of network functions is carried out from the extract of the functional architecture of the network functions designed for the Network Attachment part of the My TV Line service with reference to FIGS. 1, 2 and 3a. , 3b. Initialization of network functional entities: EFo1 = {Access Management}; EF02 = {Line Identification}; EF03 = {Line Authentication}; EF04 = {User Profile Resource Control Database}; Thus, No = 4. Iteration of grouping of the network functional entities, with k = 1: The calculation of the indicators of the business relevance of the functional entities thus initialized is the following I (EFo1 U EF02) = 3 and I (EFoi U EF03) = 2 3 since the model does not change if the Line Identification and Line Authentication network functions are exchanged; • I (EF02U EF04) = 1, and • I (EF03U EF04) = 1, since the model does not change if the Line Identification and Line Authentication network functions are exchanged; • I (EFo1 U EFo4) = I (EFo2U EFo3) = 0, since the network functions of these network functional entities do not appear in any sequence induced by the two scenarios of the My TV Line service shown in Figure 3a and 3b.
The threshold of relevance of the grouping of two network functions in the same network functional entity being equal to 1, we obtain M (2, 4) = M (3, 4) = 1, where the notation M (i, j) to represent the quantity GM (ki, kj). The first grouping is therefore EF11 = EF02U EF04 = {Line Identification, User Profile Resource Control Database} The second
EF03U EF04 grouping is impossible since EF04 is already grouped with EF02 in this first iteration.
The reassigned network functional entities are:
EF12 = EF01 = {Access Management} - EF13 = EF03 = {Line Authentication}
Thus, N1 = 3.
Iteration of grouping of the network functional entities, with k = 2: The calculation of the business relevance indicators of the functional entities defined in the second iteration is as follows: for EF11 U EF12: • the sequence of five network functions is:
- Access Management ù> Line Identification -> User Profile Resource Control Database Line Identification -> Access Management (successive signals exchanged: S7, S8, Sg and S10, or, S'7, S'8, S'9 and S'1o )
• Access Management is the only element of the sequence when in the second scenario it receives the signal S'2 and sends the signal S'11,
• User Profile Resource Control Database is the only element in the sequence when it receives the signal S'12 and sends the signal S'13.
Then NS5 (EF11 U EF12) = 1 and NS1 (EF11 U EF12) = 2 for three distinct network functions.
• the indicator I of the business relevance of EF11 U EF12 for the two chosen scenarios and the grouping threshold of EF11 and EF12 are thus such that: I (EF11 U EF12) _ (0 * 2) 3 (4 1) = 3 and
1 * (1 * 1) + 3 * (1 * 1 S (EF11, EF12) = 2 for EF11 U EF13: • the sequences of three network functions are: - Line Identification -3 User Profile Resource Control Database Line Identification (signals successive exchanges exchanged: S8 and S9, or, S'8 and S'9), - Authentication Line> User Profile Resource Control Database Line Authentication (successive signals exchanged: S12 and S13, or, S'12 and S'13), • Then NS3 (EF11 U EF13) = 2 for three network functions The indicator I of the business relevance of EF11 U EF13 for the two chosen scenarios and the grouping threshold of EF11 and EF13 are thus such that: (2 * 2 ) = 2 and I (EF11 U EF13) = 2 S (EF11, 1 * (1 * 1) + 3 * (1 * 1) = 2 EF13) = 2 I (EF12U EF13) = 3 and S (EF12, EF13) ) = 1. Only the grouping of network functional entities EF11 and EF13 in the same network functional entity is possible since I (EF11 U EF13) '- S (EF11, EF13) implies that M (1, 3) = 1 and EF21 = EF11 U EF13 = {Line Identification, Line Auth entication, User Profile Resource Control Database}. The only reallocated functional entity is therefore: EF22 = EF12 = {Access Management} ie N2 = 2. Iteration of grouping of network functional entities, with k = 3: The calculation of the business relevance indicator of the only functional entity that can be defined in the third iteration is as follows: for EF21 U EF22: • the sequences of nine network functions are: - Access Management - + Line Identification User Profile Resource Control Database - + Line Identification -> Access Management ù> Line Authentication -3 User Profile Resource Control Database -3 Line Authentication - Access Management (successive signals exchanged: S7, S8, Sg, S10, S11, S12, S13, S14), - Access Management Line Authentication User Profile Resource Control Database ù> Line Authentication - Access Management ù > Line Identification User Profile Resource Control Database -3 Line Identification 3 Access Management (successive signals exchanged: S'11, S'12, S'13, S'14, S'7, S'8, S'g and S'10). Thus NS9 (EF21 U EF22) = 2 for four distinct network functions. The indicator I of the business relevance of EF21 U EF22 for the two chosen scenarios and the grouping threshold of EF21 and EF22 are therefore such that: (8 * 2) 3 * (2 * 1) = 3. I (EF21 U EF22) = 2 = 8 and S (EF21, EF22) = 2
The grouping of the network functional entities EF21 and EF22 in the same network functional entity is therefore possible since I (EF21 U EF22) 'û S (EF21, EF22). Therefore, M (1, 2) = 3 and EF31 = EF21 U EF22 = {Access Management, Line Identification, Line 2 0 Authentication, User Profile Resource Control Database}. Thus, N3 = 1, and the grouping of network functional entities is complete. Finally, the invention furthermore covers a modeling tool for a telecommunications network in the form of network functions and network functional entities and network elements arranged according to an architecture of network functions exchanging signals. As represented in FIG. 4, such a tool conventionally comprises a central processing unit CPU, a working memory RAM and a program memory, for example PM. It further comprises a modeling module MM which can be constituted by a modeling module using the UML language normally available on the market. In addition, and without limitation, the modeling module MM may advantageously consist of the essential elements of the modeling tool described and claimed by the French patent application number FR 05 02022 filed February 28, 2005 in the name of the applicant. In any case, whatever the implementation of the memory module MM, the modeling tool object of the invention comprises a coding module CM, this coding module of course allowing the implementation of steps A, B , C represented in FIG. 2 respectively of the coding steps BC0 to BC9 represented in FIG. 3c. It is understood, in particular, that the CM coding module may be constituted by a program module executable by a computer and in particular by the CPU of the modeling tool object of the present intervention. Of course, the coding module CM allows the implementation and execution of the coding method which is the subject of the invention as described above in the description in conjunction with FIGS. 2 and 3a to 3c.
Definition of Access Relay Functions: This function introduces local configuration information received from the user. It converts the request into another understandable by the functions of the Access Management functional entity: This function allows to organize and organize the actions and the procedures necessary for the attachment. Network Access Admission Control: It allows to proceed to the control of admission to a network (or a part of the network) well defined. In this case it is the part of the network dedicated to MLTV Line Identification service: It allows to identify the access line of the user. Line Authentication: It allows to authenticate the access line of the user. - Localization Access Admission control: It allows to proceed to the geographical control of admission to a network (or a part of the network) well defined. In this case it is the part of the network dedicated to the MLTV service. Address Allocation: This is used to allocate the IP address of the user.
The information bearer functions provide a functional representation of the location of the information needed for the other functions (above) for the processing of the network attachment: Network Access Control Database: It contains the information to identify the terminals users who have subscribed to the MLTV service. User Profile Control Database: Contains the credentials and authentication credentials of users' connectivity lines. Localization Database: Contains the geographic location information of the connectivity lines. This information may affect the network configuration process of the user's terminal. Network Address Database: It contains the necessary configuration information as a result of the implementation of the services including IP addresses, DNS servers and service access node addresses. Definition of SI, S2 Network Address Request messages: The message represents the request from the user terminal to attach to the network. It contains its MAC (Layer 2) S3 Network Access Authorization Request: The message represents the request from the Access Management function to verify the existence of the MAC address of the user's terminal. S4 Network Access Information Request: The message represents the request from the Access Management function to poll the database for the MAC address of the user's terminal. S5 Network Access Information Response: The response containing or not information on the MAC address of the user's terminal. S6 Network Access Authorization Response: The response containing verification information for the MAC address of the S7 user terminal. Line Identification Request: The message represents the request from the Access Management function to check for the existence of the line. access used by the user terminal to access the MLTV service.
S8 Line Identification Information Request: The message represents the request from the Line Identification function to poll the database for the access line used by the user terminal to access the MLTV service. S9 Line Identification Information Response: The response containing or not information on the access line used by the user terminal to access the MLTV service. S10 Line Identification Response: The response containing verification information of the access line used by the user terminal to access the MLTV service. S11 Line Authentication Request: The message represents the request from the Access Management function to authenticate the existence of the access line used by the user terminal to access the MLTV service. - S12 Line Authentication Information Request: The message represents the request from the Line Authentication function to poll the database with respect to the access line used by the user terminal to access the MLTV service. S13 Line Authentication Information Response: The response containing or not information on the access line used by the user terminal to access the MLTV service. - S14 Line Authentication Response: 25 The response containing authentication information of the access line used by the user terminal to access the MLTV service. S15 Address Allocation Request: The message represents the request from the Access Management function to request an IP address for the user terminal. 30 S16 Address Allocation Localization Admission Request: The message represents the request from the Address Allocation function to request verification of non-nomadism the terminal of the user wishing to access the service of My TV Line. The message represents the request from the Location Access Admission Control function to poll the database with respect to the geographic location of access line used by the user terminal to access the MLTV service.
S18 Address Location Localization Admission Information Response: The response containing information on the geographic location of the access line used by the user terminal to access the MLTV service.
S19 Address Localization Allocation Admission Response: The response containing information on the nomadism or non-nomadism of the access line used by the user terminal to access the MLTV service. S20 Address Info Request: The message represents the request from the Address Allocation function to request the assignment of an IP address to the user terminal. S21 Address Info Response: The response containing information about assigning an IP address to the user terminal. S22 Address Allocation Response: The response containing the IP address of the user terminal - S23 Network Address Response: The response containing the IP address of the user terminal as well as other information about the service access portal address (Service Access).
START NO = N; For i from 1 to No {EFo; = {F;}; / * Initialization of network functional entities reduced to a network function each * /} k = 0; Make / * k iteration of the grouping of functional entities network * / {n = 0; k ++; For i from 1 to Nk_1 {For j of i + 1 to Nk_1 {M (i, j) = 0; / * Initialization of the elements of the gain matrix of the grouping of EF (k_1); and EF (k_l) * /} AR (i) = 1; / * Initialization of the authorization of the grouping of EF (k_1); with another network functional entity * /} For i from 1 to Nk_1 {For j from i + 1 to Nk_i {If I (EF (k_1); U EF (k_10? S (EF (k_1) j, EF (k_1) 1) / * Verification that the relevance indicator is greater than or equal to the regrouping threshold * / Then M (i, j) = F (EF (k_1) j, EF (k_q); / * updating the gain 20 From the grouping of EF (k_1) and EF (k_I) i * / Finsi}} Proceed in descending order of the values of M (i, j), as long as M (i, j) # 0 {Si (( AR (i) = 1) and (AR (j) = 1)) / * EF (k_1) i and EF (k_1) i can be grouped * / Then {n ++; EFkn = EF (k_1) iU EF (k_1) grouping the network functional entities EF (k_1); and EF (k_1) i in the functional entity EFkä * / AR (i) = 0; AR (j) = 0; / * EF (k_1); and EF (k_1) i can no longer be grouped with other functional entities during k iteration * /} 20 Finsi} Complete For i from 1 to Nk_1 {Si (AR (i) = 1) / * Functional entity retrieval network not regrouped * / Then {n ++; EFkä = EFk;; / * Réaf assignment of ungrouped network functional entities for the entities of the iteration 15 25 30 * /} Finsi} Nk = n; } Up to ((Nk = Nk_1) or (Nk = 1)) Purpose FIN10
A method of encoding network functional entities from network functions exchanging at least one signal via a reference point of a telecommunications network model, characterized in that said method consists of at least: establishing and representing signal exchanges in the form of a modeling sequence diagram, highlighting, for at least one feature and / or network service scenario, said successive exchanges of signals between said network functions; and, each network function being coded according to a unary network functional entity, iteratively executing steps for calculating, from at least one scenario, a business relevance indicator of grouping network functional entities into a single network functional entity in said functionality and / or said network service; encoding the two-to-two grouping of network functional entities into at least one current network functional entity, based on a grouping relevance threshold value and a grouping gain value, said grouping gain value being defined as the ratio of the value of the business relevance indicator of the two-to-two grouping of said network functional entities and the relevance threshold value of said grouping.
2. Method according to claim 1, characterized in that said modeling sequence is constituted either by the successive signal sequences, exchanged by said network functions, or by the network function sequences, corresponding to these successive signal exchanges.
3. Method according to one of claims 1 or 2, characterized in that for any network functional entity said business relevance indicator of grouping is taken equal to the ratio of the total number of groupings of a network function and a network functional entity the total number of distinct network function sequences, independent of the content of the signals.
4. Method according to one of claims 2 or 3, characterized in that the network function sequences taken into account for calculating the business relevance indicator of grouping a network functional entity are the network function sequences of maximum length internal to said network functional entity.
5. Method according to one of claims 1 to 4, characterized in that for a first and a second network functional entity grouping a first respectively a second number of network functions, said threshold value of relevance grouping network functions belonging to said first and second network functional entity is taken equal to the ratio of the weighted total number of groupings of a network function belonging to the first and / or the second network functional entity with the second respectively the first network functional entity to the total number of network sequences. distinct network functions of the first and second network functional entities.
6. Method according to one of claims 1 to 5, characterized in that for a given number of network functions and an initialization of unary network functional entities reduced to only one of these network functions, said method consists, for defining the entities network functionalities by grouping said network functions and / or network functional entities, for: for each clustering iteration of rank k determined: • for any pair of functions of rank i =; , - 'and j - initializing the grouping gain values of a matrix of the grouping gains of the functional entities of rank (k-1)' and (k-1) i; v initialize a grouping authorization variable of any network functional entity of rank (k-1); with another network functional entity; and, • for any functional entity pair of rank i and j - verify that the value of the business relevance indicator is greater than or equal to the relevance threshold value of the grouping; updating the value of the gain of the grouping of the functional entities of rank (k-1 and (k-1) i; and, on the following path in descending order of the grouping gain values of the grouping gain matrix, as long as the grouping gain value is non-zero and if the grouping entitlement values of the (k-1) and (k-1) i functional entities allow grouping, - group the current functional entities of rank (k-1) and (k-1) i in a common functional entity, otherwise, • if the aggregation authorization values of the functional entities of rank (k-1) and (k-1) i n do not allow grouping, ignore the grouping of the current functional units of rank (k-1 and (k-1) i, and for i =; F and for any functional entity of rank i whose aggregation authorization variable is equal to 1, • retrieve ungrouped network functional entities, and, • reassign non-grouped network functional entities as a unary functional entity; and, return to the next iteration until the end of the iterative process.
7. Modeling tool for a telecommunications network, in the form of network functions, network functional entities and network members arranged according to an architecture of network functions exchanging signals, said tool comprising a central processing unit and a module modeling system, characterized in that it furthermore comprises a module for encoding network functional entities from network functions exchanging at least one signal via a reference point of a model of this telecommunications network, said coding module for implementing the coding method according to one of claims 1 to 6.
A computer program product stored on a storage medium and executable by a computer or modeling tool according to claim 7.
9. Computer program product according to claim 8, characterized in that the executable program of this program product is implemented in the coding module of said modeling tool.
FR0513162A 2005-12-22 2005-12-22 Network functional entity encoding method for telecommunication network, involves encoding paired regrouping of two network entities into single current functional entity based on regrouping relevance threshold and regrouping gain values Withdrawn FR2895614A1 (en)
FR0513162A FR2895614A1 (en) 2005-12-22 2005-12-22 Network functional entity encoding method for telecommunication network, involves encoding paired regrouping of two network entities into single current functional entity based on regrouping relevance threshold and regrouping gain values
PCT/FR2006/002794 WO2007077321A1 (en) 2005-12-22 2006-12-19 Method for encoding functional network entities on the basis of network functions of a telecommunications network
FR2895614A1 true FR2895614A1 (en) 2007-06-29
FR0513162A Withdrawn FR2895614A1 (en) 2005-12-22 2005-12-22 Network functional entity encoding method for telecommunication network, involves encoding paired regrouping of two network entities into single current functional entity based on regrouping relevance threshold and regrouping gain values
FR (1) FR2895614A1 (en)
FR2818401A1 (en) * 2000-12-15 2002-06-21 Thomson Csf Automatic generation of embedded distributed control applications in a network of automata, based on modeling of the network, uses UML modeling of functions and data communication to drive automatic code generator
FR2835988A1 (en) * 2002-02-14 2003-08-15 France Telecom Method and system for adjusting values of control parameters of a network optimally
EP1361761A1 (en) * 2002-05-10 2003-11-12 Compaq Information Technologies Group, L.P. Telecommunications network management system and method for service monitoring
2005-12-22 FR FR0513162A patent/FR2895614A1/en not_active Withdrawn
2006-12-19 WO PCT/FR2006/002794 patent/WO2007077321A1/en active Application Filing
CN100483337C (en) 2009-04-29 Difference extraction between two versions of data-tables containing intra-reference
US8959000B2 (en) 2015-02-17 Integrated testing systems and methods
US20090125459A1 (en) 2009-05-14 Method and system for rule-based content filtering
US6353896B1 (en) 2002-03-05 Method and apparatus for testing event driven software
Felty et al. 2003 Feature specification and automated conflict detection
US8869110B2 (en) 2014-10-21 Method and arrangement for test case creation
EP1461903B1 (en) 2007-07-18 Technique of determining connectivity solutions for network elements
US7688960B1 (en) 2010-03-30 Method and system for separating business and device logic in a computing network system
US20160062746A1 (en) 2016-03-03 Software Defined Network Controller
ES2237709T3 (en) 2005-08-01 Miganism of migration support in open service and open mobile architecture.
CN103430150B (en) 2017-05-17 Technique for resource creation in a cloud computing system
EP1249966A2 (en) 2002-10-16 Apparatus, program and method for network administration and computer network system
US9654648B2 (en) 2017-05-16 Native mobile device identification for toll-free service usage
US20100293205A1 (en) 2010-11-18 Resource name reconciliation in a configuration database
KR100448262B1 (en) 2004-09-10 Network Security Simulation system
WO2004021207A1 (en) 2004-03-11 Systems and methods for improving service delivery
US8453014B2 (en) 2013-05-28 Method and computer for designing fault cause analysis rules in accordance with acquirable machine information
US20160112269A1 (en) 2016-04-21 Identifying configuration inconsistency in edge-based software defined networks (sdn)
EP0744113B1 (en) 1998-07-29 Method of detecting service interactions in intelligent networks
US20140165043A1 (en) 2014-06-12 System and method for functional test case generation of end-to-end business process models
US8121042B2 (en) 2012-02-21 Reliability estimation methods for large networked systems
JP2008060692A (en) 2008-03-13 Management computer, computer system, and switch
CN102597993B (en) 2014-03-12 Managing application state information by means of uniform resource identifier (URI)
Margaria et al. 2005 Service-oriented design: the roots
CA2634365C (en) 2017-01-24 Method for systematic modeling and evaluation of application flows
2007-10-05 ST Notification of lapse


text:
són els videojocs de Pokémon que iniciaran la V Generació. Els jocs van ser llançats el setembre del 2010 al Japó i la primavera del 2011 a Occident. Els Pokémon adquireixen una visió 3D bastant interessant.

Com a noves referències, a part dels nous Pokémon, hi ha nous atacs i la possibilitat de fer combats de 3 Pokémon contra 3. Els llegendaris característics són Reshiram (Black) i Zekrom (White), també són destacables els llegendaris Victini, en Kyurem, i dos trios de llegendaris, el de bèsties i el dels núvols.

Referències

Videojocs del 2010

redpajama_set_name: RedPajamaWikipedia


text:
LEVERET
ANDY CUTTING • SAM SWEENEY • ROB HARBRON
Leveret features three of England's finest musicians in an exciting new collaboration. Andy Cutting, Sam Sweeney and Rob Harbron are each regarded as masters of their instrument and are involved in numerous collaborations with a huge range of artists. Together their performances combine consummate musicianship, compelling delivery and captivating spontaneity.
Andy Cutting is a unique player of the melodeon, known for his work with Martin Simpson, Blowzabella, Chris Wood, June Tabor, Kate Rusby, and many more. Sam Sweeney, the fiddle player in Bellowhead, is also in demand as a multi-instrumentalist, working with Jon Boden and the Remnant Kings, The Full English, Fay Hield and the Hurricane Party, and his own project Made in the Great War. Rob Harbron has reinvented the English concertina and is known for his work with The Full English, Jon Boden and the Remnant Kings, Fay Hield, Emma Reid and the English Acoustic Collective.
Leveret's music is firmly rooted in the English tradition but is fresh and new, with original settings of ancient tunes sitting alongside new compositions by some of today's finest tunesmiths. Sophisticated and honest, considered and spontaneous, there is nothing else that sounds quite like this trio.
'Sublime, exquisite music ' don't miss them'
Tickets £11

redpajama_set_name: RedPajamaCommonCrawl


text:
Lorena Alfaro, from Sant Cugat station after the collapse: "They didn't inform us of anything"
December 3, 2021 by thecanadian
Lorraine Alfaro, 20, was in the Railway station of the Generalitat de Catalunya (FGC) of Sant Cugat to go towards Barcelona when the collapse occurred in Terrassa. As she explains, while she (and many more people) went to look for the train, a large number of workers have forced them to change course, since they told them that all trains heading to Sabadell and Barcelona would run on the same track and those who went to Terrassa were taken elsewhere. "They told us that we could not access, but they did not explain why" he declares, "in addition, at the beginning when we were on the road there was no one, nor security," he adds.
Reference-www.elperiodico.com
Manitoba Health Says Mother and 3-Year-Old Boy Got COVID-19 Vaccine by Mistake – Winnipeg | The Canadian News
Bobcaygeon Swing Bridge Reopening Delayed to Spring 2022: Parks Canada – Peterborough | The Canadian News


FCC approves Sprint & Clearwire merger. WiMAX Is GO!
Despite AT&T attempts to slow or halt this merger by requesting FCC to elevate scrutiny on this deal, last night the deal was approved with 5-0 vote.
According to Clearwire & Sprint such merger is only way to make WiMax spread across planed 140 million Americans. Largely the deal, heavy supported by Intel, Google, Cisco and lots of other IT and Telecommunications heavy lifters presents loud and clear danger for Qualcomm.
Since the dawn of human kind... errr. dawn of Cellphone industry Qualcomm has been using all methods available to it's disposal to achieve basically 100% monopoly in cellphone devices chipsets. Ether legal or patent battle - Qualcomm didn't spared anything and on the road got a few major players very upset. Remember recent refusal of Nokia to pay Qualcomm royalties and after long legal battles setting down for undisclosed amount. Nokia which is by far number one manufacturer of cellphones have a pretty good reason to be upset - as Qualcomm charged 5% fee based on final device cost !!
Meaning, for example, From $600 N95, Qualcomm gets $30 from each device sold. Rather hefty price, especially in light of current tight margins due to slowing economy.
Lets hope WiMax will able to bring wireless computing to new levels , and fix some of 3G issues like disconnects in fast moving vehicles like cars and trains, faster speeds and generally more reliable connection.
Thou its still not clear about WiMax future , but one thing I can tell you - inside sources tell me, what next Intel Centrino Platform aka Centrino 3 will REQUIRE to include WiMax adapter, just like first generation required to include Wi-Fi to be certified and Intel will be throwing another HUGE marketing campaign, rival or equal of original $300 Million one.
Verizon: Less Features+More Ads = "Best Possible online experience" ??
Verizon/Yahoo! webmail and portal users begun receiving emails saying that they'll soon be seeing advertisements in their webmail as well as the elimination of some features.
"The new advertisements will be carefully integrated, with the goal of being useful to you." - Thanks ?
But the service itself is actually becoming less useful, with some of the premium services associated with Verizon/Yahoo! webmail being either changed or eliminated altogether.
Verizon website also ads, that the company is eliminating the Verizon's LAUNCHcast Plus streaming music radio service, the "Online Protection all in one security suite" and downgrading your free Flickr Pro account to a standard Flickr account.
But don't feel bad, the email to customers informs them they're losing features in order to....gain features? huh?
After somewhat silly named Badaboom Media converter software, which we had a chance to test earlier this year, yet another company decided to jump on GPU processing wagon.
Pegasys - maker of TMPGEnc one of original tools to convert video to mpeg 1/2 introduced new version - TMPGEnc Xpress 4.0 with Beta support for Nvidia CUDA GPU processing.
(The 8800GT/GTX cards not yet supported).
But, on the other hard , Test using simple de-interlacing and resizing was twice faster on quad core Intel processor.


The HTC 6800 currently has an Informr score of 6.5 out of 10. This score is based on our evaluation of 81 sources including reviews from users and the web's most trusted critics.
The HTC 6800 is the same phone as the P4000 Mogul (also known as the Titan) available with Telus, Verizon and Sprint. The main difference between the phones is color. Bell's 6800 is blue. For more information on this phone, visit the HTC P4000 Mogul information page.
HTC released the 6800 on March 26, 2007.
Where can I download the 6800 manual?
We've got you covered! Download a free PDF copy of the HTC 6800 user manual here.
HTC backs up the 6800 with a 1 Year parts & labour warranty.
I have 6800 problems. Where can should I go for support, replacement or repairs?
If your 6800 has problems and is still within its warranty period, you could contact HTC support or the retailer you purchased the phone from. You'll find HTC's contact information here. If your phone is off warranty and needs repair for a physical problem such as a broken screen or bad battery, you should visit an authorized service centre or a local phone repair shop. You can also connect with others in The Informr Community Forum to find and share answers to questions.
The HTC 6800's screen size is 2.8 inches with 240 x 320 pixels resolution.
Internal memory is 96 MB. An external, MicroSD expansion slot is available for increased storage capacity.
The phone is powered by a Lithium-Ion (Li-Ion), 1500 mAh battery. HTC's performance ratings are 6.5 days standby time.
An operating system upgrade is now available. More on the XV6800 Windows Mobile 6.1 update here.


Hurst is a very enterprising city located in Tarrant County, Texas. It is one of the few Mid-Cities that are located between Dallas and Fort Worth. Hurst is classified as a suburb in Fort Worth and was founded by William Letchworth. As of 2010, its population stood at 37,337.
Jet Locksmith is highly regarded as one of the leading locksmith Hurst brands in the entire Fort Worth area. We have specialized personnel and equipment that enable us to deliver excellent service on residential, commercial and auto lock systems and other security areas.
We have a highly specialized and trained workforce that is insured. Our recruitment process is structured in such a way that only the best are picked from the pool of applicants for locksmith Hurst positions. We also do a background check on all our employees before hiring them. This enables us to be confident in service delivery knowing that our workforce cannot let us down.
At Jet Locksmith, we offer quick lock-out services. This means that in the event you misplace your keys or they get damaged, we will respond quickly to resolve your problems before they escalate into a security threats. We make new keys in addition to re-keying your locks. Upon request, we also setup our clients with a foolproof master key system. Other residential locksmith services that we offer include peepholes, Deadbolt installation and other access control systems.
Being a commercial city, Hurst has various commercial locksmith needs that require our attention. Our specialists are experienced in fixing cabinet locks, security door installations, repair of damaged locks and panic hardware. Our professionals will get the job done no matter its scale and magnitude. We are at the frontline in delivering digital and electronic lock solutions and access control systems.
Our locksmith Hurst automotive solutions cater for door opening, auto lock-out needs, ignition switch repairs and maintenance. Our experts also use some of the latest equipments to remove broken car keys out of ignitions and doors.
At Jet Locksmith, we provide a one stop solution for all your Locksmith Hurst needs. Our services are affordable, fast and reputable making us the most reliable locksmith within Hurst city and beyond. Call us right away for any locksmith issue and we shall respond in a record time.


News Archives - Page 2 of 83 - Official Page of Mohammed Al Habtoor, Vice Chairman & CEO Al Habtoor Group & Patron of Habtoor Polo.
WAM – 20th Feb, 2019) The Emirates and Desert Palm teams won their opening matches at the first day of the Julius Baer Gold Cup 2019, which began yesterday.
The first match was between Desert Palm and Mahra Polo teams with the teams at a tie by the end of the second chukker.
By the end of the third, Desert Palm had created a 2 goal advantage and further took control of the game until the buzzer of the fifth chukker closing it at 14 goals to 4.
The Gold Cup (Dubai Open) now in its tenth year, is one of the five mid to high-goal tournaments that fall under the umbrella of the DPGC Series. It has grown in parallel with the city of Dubai and is the only tournament in the United Arab Emirates (along with the Dubai Challenge Cup and the Dubai Silver Cup, also part of the DPGC Series) to be certified by the World Polo Tour (WPT) since 2012. The Gold Cup is part of the WPT Championship Cup which is considered as the highest competition in terms of points and awards 80 points to its winners, 40 points to the finalists, 25 points to the semi-finalists and 10 points to all other participating players. Only four other tournaments in the world are competed in this category under the WPT.
The Dubai Open is played under the banner of the Hurlingham Polo Association (HPA) with tournaments being played under strict international supervision according to the HPA rules and provision of its umpires.
The tournament has received tremendous support from its title sponsor since 2014 – Julius Baer, a leading Swiss private banking group with presence in all major financial centres including Dubai, Frankfurt, Geneva, Hong Kong, London, Luxembourg, Milan, Monaco, Montevideo, Moscow, Mumbai, Singapore and Tokyo.
The Julius Baer Gold Cup 2019 will officially kick off on Monday 18 February 2019 with eight teams competing until Friday 8 March for the prestigious title and trophy. Mohammed K. Al Habtoor, Vice Chairman & CEO of Al Habtoor Group, Founder of the DPGC Series and Patron of Habtoor Polo team was joined for the live draw by Régis Burger, Head Middle East, Julius Baer (Middle East) Ltd., Trevor Weller, Prestige Director, Al Habtoor Motors (Bentley Emirates), and Santiago Torreguitar, Tournament Director of the Emirates Polo Association.
Habtoor Polo: Tommy Beresford 6, Facundo Sola 9, Hugo Lewis 3, Mohammed Al Habtoor 0. Total: 18.
Mahra Polo: Diogo Gallego 5, Pelayo Berazadi 5, Jaime Garcia Huidobro 7, Rashid Al Habtoor 0. Total: 17.
Dubai Wolves: Marcos Araya 7, Manuel Crespo 7, Habtoor Al Habtoor 1, Justo Cuitiño 3. Total: 18.
Abu Dhabi Polo: Alfredo Cappella 9, Santiago Gomez Romero 4, Faris Al Yabhouni 0, Guy Gibrat 5. Total: 18.
Desert Palm: Camilo Castagnola 5, Bartolito Castagnola 6, Martín Valent 5, Rashid Al Bawardi 2. Total: 18.
Zedan Polo: Santiago Laborde 6, Amr Zedan 0, Martin Gandara 5, Rauli Laplacette 7. Total: 18.
Ghantoot: Yousef Bin Dismal 0, César Crespo 4, Juan Gris Zavaleta 8, Martín Donovan 6. Total: 18.
UAE Polo: HH Sheikha Maitha 0, Vizcacha Benoit 6, Tomás Panelo 4, Alejandro Muzzio 8. Total: 18.
THE DUBAI GOLD CUP SERIES IS STREAMED LIVE ON POLOLINE TV HERE.
-Silver Cup (18-goal): January 25 – February 8.
-Polo Masters Cup (10-goal): February 10-15.
-Julius Baer Gold Cup (18-goal): February 18 – March 8.
-Dubai Challenge Cup (18-goal): March 15-30.
-Dubai Cup (8-goal): April 2-12.
DUBAI: The Julius Baer Gold Cup, the region's largest polo tournament, returns for another year under the Patronage of Sheikh Maktoum Bin Mohammed bin Rashid Al Maktoum, Deputy Ruler of Dubai.
The draw for the Julius Baer Gold Cup 2019 fixture was held on Sunday at the Al Habtoor Polo Resort and Club, the home ground of the Dubai Polo Gold Cup (DPGC) Series.
The Gold Cup (Dubai Open) now in its tenth year, is one of the five mid to high-goal tournaments that fall under the umbrella of the DPGC Series. It has grown in parallel with the city of Dubai and is the only tournament in the UAE (along with the Dubai Challenge Cup and the Dubai Silver Cup, also part of the DPGC Series) to be certified by the World Polo Tour (WPT) since 2012.
The Gold Cup is part of the WPT Championship Cup which is considered as the highest competition in terms of points and awards 80 points to its winners, 40 points to the finalists, 25 points to the semi-finalists and 10 points to all other participating players.
Only four other tournaments in the world are competed in this category under the WPT.
The Julius Baer Gold Cup 2019 will officially kick off on Monday, Feb.18 with eight teams competing until Friday, March 8 for the prestigious title and trophy.
Mohammed K. Al Habtoor, Vice Chairman & CEO of Al Habtoor Group, Founder of the DPGC Series and patron of Habtoor Polo team was joined during the draw by Regis Burger, Head Middle East, Julius Baer (Middle East) Ltd., Trevor Weller, Prestige Director, Al Habtoor Motors (Bentley Emirates), and Santiago Torreguitar, Tournament Director of the Emirates Polo Association.


I just got back from a major jaw surgery this week, resulting in my lower jaw being almost completely disabled. This of course hands me a number of problems while eating. For instance, I can't eat any solid food, or they'll have to be in tiny pieces, because I can't open my mouth enough to put food in.
Also, my lower jaw is completely numb so I can't really use my bottom lips.
I'm currently disgusted by all the baby food and the puddings, so I decided to ask Food52.
Do you have any ideas for liquid food / food to be sliced in super tiny pieces that I can use? I'll have someone else cook it up, and try to enjoy my next 5 weeks of liquid food.
Such great answers! Matsy, best wishes. Sweet potatoes are wonderful! My mother was born prematurely at home in 1912, in a small town in GA. She couldn't nurse but my grandfather said no child of his would starve to death. He mashed up sweet potato (a staple in a Southern household) with buttermilk (another staple) and fed her. She lived to be almost 80 and was very feisty. I hope sweet potato will do the same for you!
Wow, I didn't expect this to get so many answers! Thanks a bunch, everything looks so exciting. I spent my day looking for European alternatives for most of these answers, and I found some really exciting things.
But, in the past few days, my situation has changed. One should know that I am not wired shut, because the one who was doing the surgery invented this new method, so I can open my mouth enough to put things in.
I am going to try the pastina today, I did find it in here after a few hours of researching, and it looks really delicious! I can't wait to have some real tomato sauce in my stomach.
I'm going to see how the sweet potato works out. I've never had that in my life! I'll be trying it by Monday (I'm happy that on Sunday, I'm going to be living on desserts, looking forward to it).
I also found these kind of breakfast shakes in the stores. It's some kind of yogurt drink, and it gives you all the elements of a healthy breakfast. And it tastes great!
I'll also be eating some salmon tonight. I believe salmon can be sliced in tiny pieces, and it will still be awesome.
Thanks for all the advice! I'll be looking at soups next week, to see if they can aid me.
Pastina (teensy bits of pasta - widely available at supermarkets, at least where I am) - cooked in chicken broth (I like it fairly soupy,) sprinkled with fresh grated parmesan cheese.
Cooked Cream of Wheat cereal, with milk, brown sugar and cinnamon on top (much finer/smoother texture than oatmeal; kind of nursery food, but I love the stuff. Nutritious too.
And finally, something I often make a dinner of, when I'm home alone: a big sweet potato, baked until very soft, with a generous dollop of butter, a little salt and LOTS of fresh ground black pepper on top. Requires no chewing (if you don't eat the skin) and it's a great combo of sweet and peppery and salty and buttery and all kinds of good.
As a former health food store owner, I found that people in your situation did well with the meal replacement/protein shake products. There are many now that taste good and have the full component of nutrients and fiber. You can blend them with any of the typical smoothie ingredients, like yogurt and fruit, or go the green smoothie direction adding greens and other veggies. You do want to come through this with your nutrition and weight and elimination unharmed, and not be grossed out by your meals!
You might want to try some wonderful soups like all the variations of butternut squash soup, lentil soup that you can mash with your tongue, tomato soup, soft scrambled eggs, mashed potatoes, vegetarian chopped liver pate without crackers, etc. Hope this helps some. Feel better soon!
I was completely wired shut for 7 weeks. I was prescibed liquid multivitamin and liquid fiber. Based on that, I figured I could eat anything that I liked as it was only for 7 weeks.
They gave me diluted malt-o-meal in the hospital as my first meal and it completely plugged everything up in the first sip. This was in a jaw surgury ward but most patents were not wired shut.
Other than avoiding things that would stain your teeth, Eat what ever you can get down easily. Get a waterpik or similar with adjustable pressure for your teeth.
Tiny food processors are really nice. So are little pocket strainers. but you might not need them like I did. I was going out to eat and to the county fair before I was unhooked.
One thing to avoid: Oatmeal! Unless you can blend it very finely, it will get in your teeth and be quite hard to get out.
*Experience: In the late 80's, my hubby had jaw surgery that required him to be wired shut for 6 weeks. If I can get him to join here, he will add more ideas.


Clickbank University Review: Is Clickbank Actually Stealing From Its Merchants?!
Before I even begin to give you some insights into what I think about Clickbank University, I need to quickly mention that when I first start marketing online, the place that I choose to become an affiliate for was Clickbank. This was back in 2012 and even back then they did not offer any kind of quality or reputable service that they have apparently offered as far back as early 2000. Now Clickbank is only known as a place that harbors a variety of scams, many low grade products and has become the one place where anybody making garbage can grab affiliates to make sales for them.
It wasn't until later 2013 that Clickbank officially rolled out Clickbank University as a way to gain even more money from their affiliates and merchants by getting people to promote more of their products and service. The main problem with this is that the same merchants who are utilizing this website are fueling their competitors by utilizing Clickbank University.
So, without further ado, let's get right into my honest Clickbank University Review.
Now don't get me wrong, there is nothing wrong with a person or company wanting to earn more money than they are currently making, but I do believe that the line of ethics is crossed by Clickbank University. What this University does is use the list of affiliates and merchants that they have had over the past couple of years and use this list to promote a competing product.
If you are a Clickbank affiliate like I am, you have probably received some of these ridiculous promotions from Clickbank University itself. In all honesty I think this is a desperate move on Clickbank's part as they are trying to get you to join a program that you are forced to pay for.
The truth of the matter is that if you are a marketer currently promoting a few of the products and services currently on Clickbank today, you may well be experiencing some kind of revenue and traffic leak.
I know that this can be somewhat confusing so I will put it into perspective for you. This would be similar to an affiliate network using YOUR data and YOUR affiliate to create a service or product that will compete against your own. It makes absolutely no sense for you to send affiliates for your company to Clickbank to promote your product when you are just going to have to compete with a service or product that Clickbank is going to end up creating to compete against you.
At the time that I am writing this review, there are currently over 1229 different products and service listed on Clickbank, well, at least within the eBusiness category that is. What does mean? It means that Clickbank has given itself an advantage by competing with the same people that are fueling their business in the first place. Just check out the picture below.
This means by its very nature that Clickbank is stealing affiliates from their very own customers, making a ton of money off of them and are using these affiliates to promote not only Clickbank University, but to promote other products and services within their network as well.
Is Clickbank An Actual Reputable Company?
To give you an idea of what kind of program Clickbank University is, you need to understand who the owners of this company really are.
Now, this guy is not really involved with the products and services that are placed onto his company's website. However, what we do know is that he is behind many of the major decision that goes on within Clickbank itself.
I was not able to find much information on this guy online. However, I did find that he created a product a few years ago named Rapid Income Flow which is unsurprisingly, not available anymore.
From what I found on three of these owners, they tend to have a repetitive pattern of churning out a bunch of products, only to destroy them when they become saturated. This is a pattern often associated with many online gurus today and is the indicator of many scams that are only today. This is also the kind of products that Clickbank allows to be promoted within their own network.
Who Is Clickbank University For?
Clickbank University is targeted to be for experienced marketers and vendors who want their products and services promoted.
The kind of support that is given through Clickbank University is via a variety of different ways. They offer a general ticketing system, live question and answer weekly session and access to a community forum. On top of that you can leave comments under training videos to get in touch with other community members.
As an online marketer, if you do not make any money, the money that you currently have will quickly vanish. With Clickbank it just gets even worse than that. With Clickbank if you do not make money in at least 4 different countries, you will not get paid. If you get a certain % of refunds, you can get kicked out of their network and they will keep whatever money you have earned. If you do not make a certain amount of money every month, they will charge you a monthly fee, just adding to your financial burden.
I don't know why many people choose to become an affiliate for Clickbank when all they do is just take all of your hard earned affiliate commission before you even have the chance to cash it out. This is one factor that is heavily discussed online and is probably one of the most frustrating circumstance for any Clickbank affiliate today.
At first you can have access to Clickbank University for $1 for a 7 day trial. After that you will be billed $97 every month.
Clickbank wasn't always a website filled with scams. Back in the day Clickbank used to be a good portal for affiliate marketers to use. Now however, with stakeholders controlling the wheel, Clickbank is forced to grow their website and this growth is affecting the merchants that helped the website to grow in the first place.
This is very indicative of many online companies today that want to grow and end up making sacrifices just for the sake of making money. This is exactly what has happened with Clickbank and now it is affecting their merchants and affiliates alike. The best advice that I can give you here is to avoid using this "paid training" at all costs. You will only get burned in the end.
Have you had experience with Clickbank University? Regardless if it is positive or negative? If so, I would love to hear from you. Just leave your comments or questions below. I would love to get your feedback!
Lines-News.com Review: Don't Expect To Get Paid With This Opportunity!
Video Titan 3.0 Review-Is Video Titan 3.0 Actually Worth $6,000 A Month?
Survey Major.com Review: Will You Make $$$ By Taking Surveys?
Very informative, I did not know such university existed, and I loved the review it showed me advantages and disadvantages, I will keep trace and bookmark your web, wish you all the best and I agree WA teaches very well.
I agree that Clickbank University is a scam. All their training videos are 5 to 10 minutes long, and they spread them over an 8 week period when there is only 1.5 hours of not so good content. The longest videos are their interviews with other marketers who are "successful". Totally not worth the price or time.


text:
HealthBayer AG
Why This German Company Is Rejecting an EPA Request
Advertising for the Cropstar insecticide from Bayer cropscience .Photograph by Ullstein Bild via Getty Images
The agricultural unit of German chemicals company Bayer AG said on Friday it will fight a U.S. Environmental Protection Agency (EPA) request to pull one of its insecticides from the marketplace amid concerns that it could harm organisms in streams and ponds.
Bayer CropScience will instead ask for an administrative law hearing from the EPA's Office of General Counsel to review the registration of flubendiamide, the active ingredient in Bayer's Belt pesticide.
The pesticide, launched in 2008, is used to control yield-damaging moths and worms in more than 200 crops including almonds, oranges and soybeans.
Bayer's own tests have found that the pesticide is toxic in high doses to invertebrates in river and pond sediment. The organisms can be an important food source for fish.
However, the company's field studies showed that doses in waters near agricultural fields never reached high enough levels to be toxic.
But the EPA's risk assessment disagreed so the agency sent Bayer the request on Jan. 29.
"We are disappointed the EPA places so much trust on computer modeling and predictive capabilities when real-world monitoring shows no evidence of concern after seven years of safe use," said Peter Coody, Bayer vice president of environmental safety.
After rejecting the EPA's request, Bayer now expects the agency to issue a formal request to cancel its registration of the pesticide. After a comment period mandated by U.S. pesticide regulation law, Bayer will ask for a formal hearing to determine the pesticide's fate.
Belt will remain on the market throughout the process.
Bayer reported 471 million euros ($527.5 million) in insecticide sales globally in its most recent quarter. The company declined to provide sales details of Belt.
The EPA's move follows the agency's unsuccessful attempt to withdraw its registration for Dow Chemical Co's Enlist Duo weed killer.


text:
Q: When is a closed immersion an isomorphism? Today I learned that if $f:X \to Y$ is a closed immersion of schemes, then the sheaf map $f^\#: O_Y \to f_* O_X$ is surjective, which is equivalent to $f^\#_x: O_{Y,f(x)} \to O_{X,x}$ being surjective for all $x \in X$. So the only thing that remains for $f$ to be an isomorphism is the injectivity of $f^\#_x$ for all $x \in X$. I wonder if there are any natural conditions that give this injectivity (and hence make a closed immersion into an isomrphism).

A: Just to get this off of the answered list, let me just elaborate on what I said in the above comment.
Namely, let us say that $f\colon X\to Y$ is a clopen embedding if $f(X)\subseteq Y$ is a clopen(=closed and open) subset, and $f:X\to f(X)$ is an isomorphism, where $f(X)$ is given the open subscheme structure. Evidently a clopen embedding is an isomorphism if and only if it is surjective.

Observation: Let $f\colon X\to Y$ be a closed embedding of schemes. Then, $f$ is a clopen embedding if and only if $f$ is locally
of finite presentation and flat.

Proof: If $f$ is a clopen embedding then it is flat and locally of finite presentation (in fact see here for a much more interesting result). For the converse result, if $f$ is locally of finite presentation and flat then it is an open embedding by this (or the previously linked result!). Indeed, the only thing to observe is that being locally of finite presentation implies finite presentation since $f$ is automatically quasi-compact, being a closed embedding. The claim then follows, as $f$ being an open embedding implies that $f\colon X\to f(X)$ is an isomorphism, and $f(X)$ is clopen since $f$ is both an open and closed embedding. $\blacksquare$
Let me just note that both conditions are necessary:

*

*if $Y$ is locally Noetherian, then any closed embedding is (locally) of finite presentation, so it's easy to give counterexamples to the claim if we remove the flat hypothesis (e.g. $\mathrm{Spec}(k[x]/(x))\to \mathrm{Spec}(k[x])$,

*more surprisingly you cannot remove the locally of finite presentation property, and in fact the closed embedding $\mathrm{Spec}(R/I)\to\mathrm{Spec}(R)$ is flat precisely when $I$ is pure (see here), and the existence of closed but not clopen embeddings into connected schemes is quite difficult (c.f. [Proposition 5.4 + Proposition 7.2, Lazard]).

redpajama_set_name: RedPajamaStackExchange


"Mad Men" star Jon Hamm recently completed treatment for alcohol addiction, his spokeswoman said. Hamm had the support of his longtime partner, actress-filmmaker Jennifer Westfeldt, in his struggle, publicist Annett Wolf said in a statement Tuesday. Read the full article.


Customers trust Mark to maximize efficiency and productivity on their project. With nearly three decades of construction experience and an engineer's mind for problem solving, Mark approaches project planning, scheduling, and coordination to leverage human and capital resources for successful, profitable outcomes. As a project executive, he focuses on providing exemplary customer experiences for specific clients in central Virginia.
Mark joined W. M. Jordan Company in 2004 as a Project Manager. He has managed a number of military projects including the Asymmetric Warfare Group (AWG) Training Complex at Fort AP Hill. He is certified in Contractor's Quality Control and Advanced Management. His award-winning projects include a conversion of the historic Central National Bank Building in Richmond to a mixed-use housing project and the expanded Cabell Library at Virginia Commonwealth University.
Mark is a member of the Greater Richmond Association for Commercial Real Estate (GRACRE). He serves on the Richmond District Executive Committee of the Associated General Contractors (AGC) of Virginia. In his spare time, he coaches a high school girls' lacrosse team.