FR2897500A1 - Splash screen providing method for e.g. mobile telephone, involves sorting names, associated to parameter, in directory according to detected pertinence, and displaying sorted names in directory head on splash screen by sorted order - Google Patents

Abstract

The method involves comparing a parameter associated to a name in a directory with a parameter measuring the occurrence of an event during detection of pertinence e.g. pertinence resulting from a difference between a date of a last outgoing call and a current date. The names associated to the parameter are sorted in the directory according to the detected pertinence. The sorted names in a directory head are displayed on a splash screen by the sorted order. Independent claims are also included for the following: (1) a telecommunication system comprising a terminal (2) a telecommunication terminal comprising a table (3) a program executable by a processor comprising instructions to perform a method of providing a splash screen.

Description

The field of the invention is that of man-machine interfaces for

  telecommunication apparatus 5. Communication terminals such as mobile phones but also landlines, are now generally equipped with a screen on which it is possible to display a list of names still called telephone directory. Among the most common display modes are the alphabetical display or the most recently called number display. Each name corresponds to a telephone number which constitutes a type of referent to call a person. Likewise, on a computer e-mail, each name corresponds to an e-mail address which constitutes another type of referent for communicating with a person. With such a directory list, the user of a communication terminal 15 can address the user of another communication terminal by looking for the name in his directory. This facility offered by the current technology to the human being should bring him into a state of increasing tranquility. In fact, the process of entering into communication with another terminal user essentially comprises a decision step, a step of searching for the coordinates and finally an actual addressing step to the other user. The decision to address another user is conditioned by a vigilance that opposes forgetting, forgetting the other user, forgetting an appointment or by knowing at any time the most important events. conducive to or that require communication. An overly busy mind, as well as a boredom resulting from an absence of need to communicate, is likely to generate anxiety. There are indeed automatic callback systems for example appointments. However, these are sometimes stressful. The invention relates to a method performed by digital processing to provide a home screen to a telecommunication terminal user. The method is notable in that it comprises a relevance detection step in which a parameter associated with a name in a directory is compared with a parameter measuring an occurrence. ~~ directory depending on the relevance that results from the detection step. A display step then makes it possible to present the names ranked at the top of the directory in order of ranking on the home screen. Thus, the home screen suggests dynamically and in a non-stress-free way, without imposing any constraints, user names with which it may be useful or pleasant to communicate. In the detection step, the relevance results from a difference between a date of last outgoing call and a current date greater than a threshold, a calendar date substantially equal to a current date, a location listed substantially. equal to a current location, from the membership of a current character to the name, and or from the membership of the name to a party name. The invention also relates to a telecommunication system comprising a terminal and an operator network to allow a user of the terminal to communicate with other users to each of whom is associated with a name. The system is notable in that it includes a table comprising a directory list dedicated to the names of other users and a set of parameters each associated with a name. First digital processing means are arranged to compare a parameter associated with a name with a parameter measuring an event occurrence in interaction with the user of the terminal and second digital processing means are arranged to classify in the directory list the name. with which the parameter is associated, based on a comparison result performed by the first means. Third digital processing means arranged to provide on a terminal display a home screen, to present in order of ranking to the user names ranked at the top of the directory.

  Advantageously, the operator network understands the table by sharing the directory list with the terminal. The first and second digital processing means being included in the network, means of the network are then arranged to reproduce the directory list as classified in the terminal. In this case, the terminal simply includes the third digital processing means.

  The invention also relates to a telecommunication terminal comprising telecommunication means with an operator network to allow a user of said terminal to communicate with other users. The ternit, narquable in that it coniprer lists directory dedicated to the names of other users and a set of parameters each associated with a name. In the terminal, first digital processing means are arranged to compare a parameter associated with a name with a parameter measuring an event occurrence in interaction with the user of the terminal and second digital processing means are arranged to classify in the directory list the name with which the parameter is associated, based on a comparison result made by the first means. Third digital processing means are arranged in the terminal to provide on a display of the terminal, a home screen in which the names at the top of the directory are presented in order of classification.

  Numerous advantages and features of the invention are now illustrated by an exemplary embodiment explained with reference to the accompanying drawings in which: - Figure 1 is a schematic system representation comprising an operator network and communication terminals; FIG. 2 shows an associative table of directory and parameters; FIG. 3 shows process steps according to the invention; FIG. 4 is a classification function flowchart; FIGS. 5 and 6 are flowcharts respectively of deletion and addition of name functions in a directory; - Figures 7, 8 and 9 show other process steps according to the invention; FIG. 10 is an aging function flow chart for increasing the dynamics of the process; - Figure 11 shows still other process steps according to the invention. With reference to FIG. 1, an operator network 10 allows several telecommunication devices 11, 12, 13, 14 to communicate with each other. Generally, such telecommunication devices each comprise one or more directories in which names are associated with referents such as, for example, telephone numbers or Internet e-mail addresses. The telecommunication apparatus may be a mobile telephone 11, 12, a landline telephone 13, a computer 14 or any other type of communicating object. The telecommunication apparatus comprises a screen 15 on which it is possible to display names extracted from the repertoire and a keyboard 16 on which it is possible to tap a phone or a telephone. With reference to FIG. 2, a table 20 makes it possible to materialize the directory in the telecommunication apparatus or in a shared manner in the telecommunication apparatus and in the operator network. A column 21 comprises the names 2 ~ oco_l, Name 2, ..., Name j, Name i 'Nocoudo directory to each of which is associated 5 in a known manner a not shown communication referent. It is possible to create at least one list ordered for example by means of a column 22 comprising for each name respectively a pointer Suco_l, ~ ucc_2, Suce i, Suce j, Succ_n to a next name of the ordered list. In the exemplary embodiment presented here, the scheduling of the list is done by means of values Weight 1, Weight 2, Weight i, Weight j, Weight_n, each associated in column 23 with a name of the column 21. D Other columns are each assigned to an associated value parameter in line i or j, i and j varying from 1 to 1, respectively to the name of the line i or j of column 21. In the embodiment shown in FIG. 2, a column 24 is assigned to a date of last incoming call DDAE, a column 25 is assigned to a date of last outgoing call DDAS, a column 26 is assigned to a date Dagen agenda, a column 27 is assigned to a localization Loc. These parameters are used in suggestion functions that will be explained later.

  The creation and update of the table 20 are carried out for example by means of a procedure such as that explained now with reference to FIG. 6. The procedure starts with a step 60 activated each time a new name is added. NNom in the directory. The directory uses a memory arranged according to table 20 where each free line points in column 22 on a next free line.

  The index TEL of the first free line of the memory or head of free space, is given in column 22 by the successor Suoo_feo last free line of index f whose value is given by a parameter FEL of end of free space . The directory is constructed and maintained in the form of a list where each line points in column 22 on a following line of the directory The index TLR of the first line of the directory or head of list of repertoire, is given in column 22 by the successor 8uoc_q last index line q whose value is given by a parameter () [R of queue dc directory list. Before the first one, let's say 60, the ones T, B {. and QLR are initialized at the index of the (In a step 61, a line of index n is created with n equal to the value TEL given by Suce_f.To maintain a circularity of the free space, a new value is assigned in column 22 of the last line of free space, value equal to the value of the index of the next free line given by Suce TEL which thus becomes new free space head. example presented to insert the new index line n at the end of the directory list To create or maintain a circularity of the directory list, the successor Succ_n of the new line takes the value of the successor Suce_q of the old line at the end of the list The new index line n then succeeds to the index line q to become the new list queue whose index given by the parameter QLR is set to N. In a step 63, the new name NNom is entered at line n of column 21 and a va their initial Valini of weight is entered in row n of column 23. The value Valini is a purely illustrative example, the value of the row in column 23 before which line n is inserted or the maximum of attributable values. in the case where one wishes to go up the newly created line at the top of the directory list by the ranking function, that is to say if one attributes a high relevance to the fact for a name to be entered recently in the directory but this is not obligatory. Figure 3 gives a first example of a suggestion function whose relevance is linked to a remembrance of a forgotten referent, that is to say to a referent that has not been called for a long time. This so-called recall function is activated in step 30 periodically at a relatively low frequency, for example one faith per week. It scans the list given by the table 20 starting in step 30 by the first index line j equal to the value of Suee_p, where p is the index of the line preceding the current line, p is initialized to the QLR value. directory list queue in case of circular list. A step 31 tests whether the difference between the current date Dcour and the date of the last outgoing call DDAS_j is greater than a forgetting value that can be parameterized for example at one or more months. A positive test response branches step 31 to a step 32 in which the weight Weight j is increased by a return value rapI in column 23 so as to give more relevance to the corresponding Name_j name. Step 32 activates on the other hand a function of 'It of the name None list which results increase of relevance before connecting to 3.

  Following the step 32 or directly of the step 31 in the event of a negative answer to the test, the step 33 tests if the line j is the last of the list. In the case of the list construction example presented in FIG. 6, the last line of the list is that of index j equal to QLR.

  A negative test response then branches step 33 to a step 34 in which line j is replaced by the next row Succ_j of the list before looping the function back to step 31 to scan the next line. A positive response branches step 33 to an end step 35 to complete the activation of the function. An example of a ranking function is now explained with reference to FIG. 4. An activation of said function for the name J_name, triggers a step 40 in which a previous line index k and a current line index i are respectively initialized to QLR and Succk to start at the top of the list. A step 41 is arranged to test whether the Weight_j in column 23 associated with Nom_j is greater than the Weight_i value of the current line scanned in the table 20. A negative test response branches the function to a step 43 and a positive response to the test branches the function on a step 45. The step 43 is arranged to test if the current line index i is the line where are stored J_name and its attributes. A negative test response branches the function to a step 44 and a positive test response branches the function to a step 46.

  Step 44 is provided for looping the function in step 41 with the current line of index i as a new preceding line of index k and the following line of index Succ_k as a new current line of index i. Step 45 is arranged to insert the row of index table j into the directory list following the preceding index line k before the current line of index i.

  Thus the line including Name_j and its attributes, is ranked before the first line of lower weight. Since the index line j is removed from its previous place following the index line p, the new successor of the index line p is the former successor of the index line j. Then the activation of the function ends with step 46 arranged to display the names listed in column 21 of the first m rows of the directory list on the screen 15 of the telecommunication apparatus, m being determined by the number of lines that the ranking unction has for my dept. of decreasing weight.It may be left to the user the possibility of displaying the following lines in order of decreasing weight beyond m for example by means of navigation arrows on the keyboard 16. Following step 46, the ranking function returns to the function that called it, thus each activation of the ranking function in step 32 of the memory function tends to gradually move the forgotten name from line j to the top of the list until, subject to names with higher priorities or weights, line j in the first m rows of the list to suggest N The user can then call back the person listed by Name _j if he wants to, or delete the line from the directory list so as to free up memory if in fact he does not sees no use in keeping the referents associated with this name. An example of a delete function is now explained with reference to FIG. 5. An activation of said function for the name Nomj triggers a step 50 in which a previous line index k and a current line index i are respectively initialized to the values. from QLR and Succ k to start at the top of the list. A step 51 is arranged to test whether the current line of index i is the index line j where are stored Name _j and its attributes. A negative test response branches the function to a step 52 and a positive test response branches the function to a step 53.

  Step 52 is provided for looping the function in step 51 with the current line of index i as the new preceding line of index k and the following line of index Succ k as a new current line of index i. Step 53 is arranged to indicate the row of the table 20 following the index line j in the directory list as being after the preceding line of index k.

  The current line of index j is then erased and inserted at the top of the free space so as to be available to possibly add another name. Then the activation of the function ends with the step 54 arranged to display the new first m rows of the directory list on the screen 15 of the telecommunication apparatus.

  Figure 7 gives a second example of a suggestion function whose relevance is linked to an agenda in view of which it may be appropriate to recall or adapt moderately to one. ipar I She scrutinizes the year r. the table 20 starting in step 30 by the first index line j equal to the value of Suce_p, where p is the index of the line preceding the current line, p is initialized to the QLR value of the directory list tail in circular list case. A step 71 tests whether the current date Dcour is equal to or in a time range preceding a date of appointment Dagen_j. In column 26 on the scanned line j, the date Dagen_j can be expressed in days or days, hours and minutes. It can also be a pointer to a list of dates covered in step 71. Among the interesting dates, we can mention for illustrative purposes, of course a date of appointment in the usual sense of the term but also an anniversary date, Valentine's Day etc.

  A positive test response branches step 71 to a step 72 in which weight Weight _j is increased by a reminder value 111 in column 23 so as to give more relevance to the corresponding Nom name. Step 72 also activates a function of classifying the name Nomj in the list resulting from its increase of relevance before connecting to a step 73.

  Following step 72 or directly from step 71 in the case of a negative answer to the test, step 73 tests whether line j is the last in the list. In the case of the list construction example presented in FIG. 6, the last line of the list is that of index j equal to QLR. A negative test response then branches step 73 to a step 74 in which line j is replaced by the next row Succ_j of the list before looping the function back to step 71 to scan the next line. A positive response branches step 73 to an end step 75 to complete the activation of the function. FIG. 8 gives a third example of a suggestion function whose relevance is linked to a referent neighborhood, that is to say to a referent associated with a name whose listed location is close to a current location of the user of the telecommunication apparatus. The listed location is for example a postal address, a location identified by the subscriber whose name is given in column 21 or a pointer to a list of relevant locations. This so-called neighborhood function is activated in step 80 periodically at a relatively high frequency, for example several times in the hour. It scrutinizes the list given by the table 20 by starting in step 30 by the first index line j equal to the value of Succ_p, p the index of the line preceding the current line, aligned with the QLR value of lista. ~~: to re in case of circular list.

  A step 81 tests whether the location Locj listed in column 27 is equal to a current location Lcour of the telecommunication apparatus. The current location is for example given by a GPS system or by cell triangulation in the network 10. To allow a margin of error, the equality test can be replaced by a test on a crossing below a threshold of difference between the current location Lour and Loc_j location associated with Nom_j. A positive test response branches step 81 to a step 82 in which the weight Weight_j is increased by a reminder value rapIIl in column 23 so as to give more relevance to the corresponding Name_j name. Step 82 also activates the function of classifying the name Nom_j in the list resulting from its increase of relevance before connecting to step 83. Following step 82 or directly from step In the case of a negative answer to the test, step 83 tests whether line j is the last in the list. In the case of the list construction example presented in FIG. 6, the last line of the list is that of index j equal to QLR. A negative test response then branches step 83 to a step 84 in which line j is replaced by the next line Suce_j of the list before looping the function back to step 81 to scan the next line. A positive response branches step 83 to an end step 85 to complete the activation of the function.

  FIG. 9 gives a fourth example of a suggestion function whose relevance is linked to a user's use of the keyboard 16, particularly when the user enters a name on the keyboard to find in the directory the referent making it possible to call this name. . This so-called lexical function is activated in step 90 by pressing a key on the keyboard by the user. It scans the list given by the table 20 starting in step 30 by the first index line j equal to the value of Succ_p, where p is the index of the line preceding the current line, p is initialized to the QLR value. directory list queue in case of circular list. A step 91 tests whether the struck key corresponds to a character contained in Name_j.

  A positive test response branches step 91 to a step 92 in which the weight Weight_j is increased by a return value raplV in column 23 so as to give more compensation to the function in the name. when first pressing the keyboard in a short period of time. Step 92 also activates the function of sorting the name Name _j in the list that results from its increase of relevance before connecting to step 93. Following step 92 or directly from the step 91 in the case of a negative answer to the test, step 93 tests whether the line j is the last of the list. In the case of the list construction example presented in FIG. 6, the last line of the list is that of index j equal to QLR. A negative test response then branches step 93 to a step 94 in which line j is replaced by the next line Sce _j of the list before looping the function back to step 91 to scan the next line. A positive response branches step 93 to an end step 95 to complete the activation of the function. We note the interest of displaying a name in order of relevance following a recent increase. Thus, for example, when the m highest relevance names are suggested by display in the order on the screen 15. Rather than moving in the list with a navigation arrow, the user simply has to press a key corresponding to a character contained in the name suggested and desired to trace the name at the top of the list. To prevent the values contained in column 23 from inadvertently increasing and to improve the dynamic effect of relative relevance between names, it is advantageous to provide an aging function which is now explained with reference to FIG. 10. The aging function is activated in step 100 periodically at a frequency for example one faith per day. It scans the list given by the table 20 starting in step 100 by the first index line j equal to the value of Suce QLR.

  In a step 101, the weight Weight _j is divided by a value coef, preferably identical for all the lines so as to reduce the weight without interfering with the display order. This compression of the weights makes it possible to highlight the increase of a weight to which a constant is added. Following step 101, a step 102 tests whether the line j is the last in the directory list. In the case of the list construction example shown in FIG. 6, the last line of the list is that of index j equal to the value of QLR. The positive response branches step 101 to an end step 104 to complete the activation of the function. In view of the above teaching, many variations of suggestion functions can be developed without difficulty.

  Figure 11 gives an example of a variant of a suggestion function whose relevance is linked to an ephemeris, in view of which it may be pleasant to call back or remember a referent to wish him a feast. This so-called ephemeris function is activated in step 110 periodically at a frequency for example one faith per day immediately after midnight. Each activation, a parameter named here Fiesta for illustrative purposes, takes as value the name of the saint of the day found for a current date Dour, for example from a list St (day) from 365 to 366 lines where a name of saint is associated with each possible date of the year. The ephemeris function scans the list given by the table 20 starting in step 30 by the first index line j equal to the value of Suce_p, where p is the index of the line preceding the current line, p is initialized to the QLR value of directory list queue in case of circular list. A step 111 tests whether the name Nomj of current index j, is equal to or contains all or part of the string of the parameter "party". Compared to the calendar function, the ephemeris function has the particularity of not requiring to enter a correspondence between a name and a date, this being done automatically.

  The user then has the pleasant surprise to learn that the present moment corresponds to the feast of one of his acquaintances. A negative test response then branches step 111 on a succession of steps 113 to 115 arranged to terminate the function when all the rows of the directory list have been scanned or to move to a next line of the directory list in the case opposite. A positive test response of step 111 activates a step 112 in which the Weight weight is increased by a rapV reminder value in column 23 so as to give more relevance to the corresponding Name _j name. Step 112 also activates the function of sorting the name Name _j in the list that results from its increase of relevance before connecting to step 113. Step 113 tests whether the line j that comes from to be scrutinized, is the last of the list oirc. In the case of construction of the e line of the list is c_; of index j equal to trameter .2 positive response branch step 113 on the end step 115 to complete the activation of the function. A negative test response of step 113 indicates that there is a different next line. Step 114 then points to the next line whose index j is given by the successor Succ_j of the line j previously considered then loops back the function on step 111. The weight allocation is advantageous because it allows weight the relevance by function by possibly modulating the added values rapt, rapII, rapIl, raplV, rapV but it is not essential. In steps 32, 72, 82, 92, 102, 112, it is sufficient to simply pass the relevant line at the top of the directory list. Whatever the mode of relevance chosen, we note that the algorithms are economical in terms of resource both computing power and memory. It is possible to implement the method previously taught, in various ways in the telecommunication system already explained with reference to FIG. 1. The operator network 10 allows a user of the terminal 11 to communicate with other terminal users. 12, 13, 14 by means of conventional telecommunication means with the operator network in the terminals. A name being associated with each other user, the table 20 of FIG. 2 comprises a directory list determined by the columns 21 and 22, dedicated to the names of the other users and a set of parameters or attributes each associated with a name in columns 23, 24, 25, 26, and or 27. In a first embodiment, the table 20 resides in a memory, not shown as conventional, of the terminal 11. The memory of the terminal 11 comprises a first set of program instructions of computer for comparing a parameter of one of the colonies 23 to 27 associated on a line with a name of the column 21 with a parameter that measures an event occurrence in interaction with the user of the terminal 1 1. The telininal memory I1 includes a second set of computer program instructions for classifying in the directory list the name with which the parameter is associated, based on a comparison result made by the first set of instructions. The memory of the terminal 11 includes a third set of computer program instructions for displaying on the display 15 of the terminal, a home screen of the silent names are presented by the classifier. The first, second, and third series of instructions are arranged to periodically or event-triggered, thereby realizing first, second, and third digital processing means respectively. In a second embodiment, the memory of the terminal 11 includes only the columns 21 and 22 of the table 20 so as to locally hold a directory list copy that the digital processing means of the terminal 11 can display on the screen. 15. The other columns of the table 20 and at least the column 21 are included in a memory of the operator network 10, dedicated to the user of the terminal 11. The network o operator knowing the incoming and outgoing calls of the terminal 11 can perfectly update the columns 24 and 25. The cellular location in the case of a mobile terminal, the location of the subscription in the case of a fixed terminal or the location of the access point (Ethernet jack or WIFI terminal) in the case of a computer, allow the operator network to maintain column 27. Other columns such as column 26 can be maintained by communication with the terminal 11. The operator network has naturally powerful digital processing means for executing the steps of the method and regularly exchanging information with the terminal 11 for updating the directory list. For example by duplicating the column 22 in the memory of the terminal 11 and in the memory of the operator network, the operator network holds the first two digital processing means and simply communicates to the terminal 11, only the modified values of the successors of the column 22 when these values are changed. For example still by duplicating column 23 in the memory of the terminal 11 and in the memory of the operator network, the operator network holds the first digital processing means and simply communicates to the terminal 11, only the modified values of the weights of the column 23 when these values are changed. The terminal 11 which in all cases of course contains the third digital processing means, contains in this second example also the second digital processing means. Particularly in the first example, the second embodiment is suitable for covering the process with any terminal that only needs to have an ordered directory list with possibility to the operator network to intervene on the directory list, which is common today. two modes e. ~ ;. many of them are.

  For example, some of the columns 23 to 27 may appear either in the terminal 11 or in the operator network 10. The digital processing means are distributed or duplicated accordingly. The distribution of relevance management locally in the terminal and remotely in the network, provides the process, power and flexibility of access to information provided by the network, access to databases such as the white pages or the yellow pages, possibilities offered to the user to complete for example his agenda on the Internet, or even add new criteria of relevance, that is to say new columns in the table 20 and program of new suggestion functions.

Claims (10)

claims   A method performed by digital processing to provide a home screen to a telecommunication terminal user, characterized in that it comprises: a relevance detection step (31, 71, 81, 91, 111) in which a parameter associated with a name in a directory, is compared with a parameter measuring an event occurrence in interaction with the user; a classification step (32, 72, 82, 92, 112) in which the name with which said parameter is associated is classified in the directory according to the relevance that results from the detection step; - a display step (46) in which the names ranked at the top of the directory are presented in order of ranking on the home screen.   2. Method according to claim 1, characterized in that in the detection step (31), the relevance results from a difference between a date of last outgoing call and a current date, greater than a threshold.   3. Method according to claim 1, characterized in that in the detection step (71), the relevance results from an agenda date substantially equal to a current date.   4. Method according to claim 1, characterized in that in the detection step (81), the relevance results from a listed location substantially equal to a current location. 25   5. Method according to claim 1, characterized in that in the detection step (91), the relevance results from the membership of a current character to said name.   6. Method according to claim 1, characterized in that in the detection step (111), the relevance results from the membership of said name to a party name.   7. Telecommunication system comprising a terminal (11) and an operating network 10) for a ~ n ~ r of said terminal of coi, -r with other 30 users each of which is associated with a name, characterized in that it comprises: - a table (20) comprising a directory list (21,22) dedicated to the names of said other users and a set (23,24,25,26,27) of parameters each associated with a name; first digital processing means arranged to compare a parameter associated with a name with a parameter measuring an event occurrence in interaction with the user of said terminal; second digital processing means arranged to classify in the directory list the name with which said parameter is associated, as a function of a comparison result performed by said first means; - Third digital processing means arranged to provide on a display (15) of said terminal, a home screen in which the names at the top of the directory are presented in order of classification.   8. Telecommunication system according to claim 7, characterized in that: - the operator network (10) comprises the table (20) whose directory list (21,22) is shared with the terminal (11), includes the first and second digital processing means and comprises means arranged to reproduce the directory list in the terminal (11); the terminal (11) comprises the third digital processing means.   9. Telecommunication terminal comprising telecommunication means with an operator network to enable a user of said terminal to communicate with other users to each of whom is associated with a name, characterized in that it comprises: a table (20); ) comprising a directory list (21,22) dedicated to the names of said other users and a set (23,24,25,26,27) of parameters each associated with a name; first digital processing means arranged to compare a parameter associated with a name with a parameter measuring an event occurrence in interaction with the user of said terminal; second digital processing means arranged to classify in the list the name of said parameter, in the form of a result of the first means, of the third digital processing means arranged to propose on a display (15); ) of said terminal, a home screen in which the names at the top of the directory are presented in order of classification.   10. Program executable by at least one processor to provide a home screen to a telecommunication terminal user, characterized in that it comprises: a first set of instructions arranged to detect a relevance by comparing a parameter associated with a name in a directory, with a parameter measuring an occurrence of an event interacting with the user; a second series of instructions arranged to classify the name with which said parameter is associated, in the directory according to the detected relevance; - A third series of instructions arranged to present the names ranked at the top of the directory in order of ranking on the home screen. 1.5