WO2014166213A1 - Procédé et appareil de recherche d'un utilisateur prévu à l'aide d'un répertoire téléphonique - Google Patents

Procédé et appareil de recherche d'un utilisateur prévu à l'aide d'un répertoire téléphonique Download PDF

Info

Publication number
WO2014166213A1
WO2014166213A1 PCT/CN2013/084081 CN2013084081W WO2014166213A1 WO 2014166213 A1 WO2014166213 A1 WO 2014166213A1 CN 2013084081 W CN2013084081 W CN 2013084081W WO 2014166213 A1 WO2014166213 A1 WO 2014166213A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
address book
mobile phone
desired user
server
Prior art date
Application number
PCT/CN2013/084081
Other languages
English (en)
Chinese (zh)
Inventor
王娜
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2014166213A1 publication Critical patent/WO2014166213A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/42—Systems providing special services or facilities to subscribers
    • H04M3/487—Arrangements for providing information services, e.g. recorded voice services or time announcements
    • H04M3/493—Interactive information services, e.g. directory enquiries ; Arrangements therefor, e.g. interactive voice response [IVR] systems or voice portals
    • H04M3/4931—Directory assistance systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M2201/00—Electronic components, circuits, software, systems or apparatus used in telephone systems
    • H04M2201/18—Comparators
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M2203/00—Aspects of automatic or semi-automatic exchanges
    • H04M2203/55—Aspects of automatic or semi-automatic exchanges related to network data storage and management
    • H04M2203/553—Data upload

Definitions

  • the present invention mainly relates to the field of mobile terminal technologies, and in particular, to a method and apparatus for searching for a desired user by using a mobile phone address book.
  • the embodiment of the invention provides a method and a device for searching for a desired user by using a mobile phone address book, which can solve the problem that the data provided by the user is not accurate and the search range is small.
  • a method of using a mobile phone address book to find a desired user including the following steps:
  • the server receives and saves the mobile phone address book respectively uploaded by each mobile terminal, and establishes an address book database
  • the server searches for the mobile phone address book of the querying user and the mobile phone address book of the desired user from the address book database according to the request of the user to search for the desired user via the mobile terminal; After finding the mobile phone address book of the desired user and the querying user, the server determines whether the expected user found by the server is the query user by determining the degree of relevance of the contacts in the two mobile phone address books. The desired user to find; and
  • the server transmits the determined desired user information to the querying user by communicating with the mobile terminal.
  • the method further comprises:
  • the establishing the address book database comprises:
  • Each user's address book uses the name + mobile phone number as the parent node, and the contact record database is created by the name and mobile phone number of all contacts as the child nodes are saved under the parent node.
  • the server finds the mobile phone address book of the desired user and the querying user, the server includes:
  • the server counts the number of common contacts in the two mobile phone address records of the child nodes stored in the parent node by searching for all the communication records with the desired user and the query user as the parent node.
  • the server further includes: after finding the mobile phone address book of the desired user and the querying user:
  • the server counts the number of all the parent nodes of the desired user and the query user in the child node by searching the address book of all the child nodes including the desired user and the query user.
  • the determining the degree of relevance of the contacts in the two mobile phone contacts, and determining whether the desired user found by the server is the desired user searched by the querying user includes:
  • the number of common contacts or the statistical child nodes collectively include all of the desired user and the query user.
  • the number of the parent nodes is not less than the threshold, it is determined that the desired user found by the server is the desired user that the query user looks for;
  • the number of common contacts or the statistical child nodes collectively includes all the parent nodes of the desired user and the query user.
  • the number is less than the threshold, it is determined that the desired user found by the server is not the desired user that is found by the querying user.
  • a device for finding a desired user by using a mobile phone address book including:
  • Establishing a database module which is configured to: establish an address book database by receiving and storing a mobile phone address record respectively uploaded by each mobile terminal;
  • a search module configured to: look up the mobile phone address book of the querying user and the mobile phone address book of the desired user from the address book database according to a request by the query user to find a desired user via the mobile terminal;
  • a judging module configured to: after finding the mobile phone address book of the desired user and the querying user, determining whether the expected user of the server is found by determining the degree of relevance of the contacts in the two mobile phone address books The desired user that is queried for the querying user;
  • a sending module configured to: send the determined desired user information to the querying user by communicating with the mobile terminal.
  • the device further includes:
  • An indirect search module configured to: when the mobile phone address book of the desired user is not found in the address book database, searching for the common information related to the query user and the desired user from the address book The contact user's mobile phone address book finds the desired desired user information in the mobile phone address book of the common contact user.
  • the establishing the database module comprises:
  • the establishment unit is configured to: each user's address book uses the name + mobile phone number as the parent node, and the address book database is established by storing the structure of the contact node under the parent node with the name + mobile phone number of all contacts.
  • the determining module includes:
  • a statistical unit configured to: the server finds all of the desired users and the Querying the address book of the parent node as a parent node, and counting the number of common contacts in the two mobile phone address books stored in the child nodes under the parent node or the server by searching all the child nodes to include the desired users and Querying the address book of the user, where the number of all the parent nodes of the desired user and the query user are jointly included in the statistical child node;
  • Setting a threshold unit which is set to: set a threshold for the common contact of the desired user and the querying user;
  • a judging unit configured to: when the statistics, the number of common contacts or the statistical sub-nodes in the two sub-nodes of the two mobile phone contacts stored in the parent node jointly include the desired user and the query When the number of all the parent nodes of the user is not less than the threshold, determining that the desired user found by the server is the desired user searched by the query user or when the statistics are saved in the two mobile phone contacts Determining that the server finds that the number of common contacts or the number of all parent nodes of the query user that are included in the child node under the parent node is less than the threshold value. The desired user is not the desired user that the querying user is looking for.
  • a logo such as contact + mobile phone number is unique. It is an ideal choice to use this logo as a query index in the present invention. By comparing the number of common contacts in the two users' contacts, to determine whether the two are likely to know, this method is also the most accurate and effective.
  • Real-time update The server will update the address book timing in the user's mobile phone to ensure the correctness of the database on the server.
  • FIG. 1 is a flowchart of a method for searching for a desired user by using a mobile phone address book according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of an apparatus for searching for a desired user by using a mobile phone address book according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of an overall module frame for searching for a desired user by using a mobile phone address book according to an embodiment of the present invention
  • FIG. 4 is a schematic flow chart of searching for a desired user by using a mobile phone address book according to an embodiment of the present invention
  • FIG. 5 is a flow chart of searching for a desired user by using a mobile phone address book according to an embodiment of the present invention. Preferred embodiment of the invention
  • FIG. 1 is a flowchart of a method for searching for a desired user by using a mobile phone address book according to an embodiment of the present invention. As shown in FIG. 1, the method includes the following steps:
  • Step S101 The server establishes an address book database by receiving and storing a mobile phone address record respectively uploaded by each mobile terminal;
  • Step S102 The server searches for the mobile phone address book of the querying user and the mobile phone address book of the desired user from the address book database according to the query of the user that is queried by the user via the mobile terminal;
  • Step S103 After finding the mobile phone address book of the desired user and the querying user, the server determines whether the contact degree of the two mobile phone contacts is related to the desired user;
  • Step S104 The server sends the determined expected user information to the querying user by communicating with the mobile terminal.
  • the method may further include: when the mobile phone address book of the desired user is not found in the address book database, searching for a common contact related to the query user and the desired user from the address book.
  • the user's mobile phone address book finds the desired desired user information in the mobile phone address book of the common contact user.
  • the establishing the address book database includes: each user's address book adopts a name + a mobile phone number as a parent node, and establishes a communication by using the name of each contact + the mobile phone number as a child node to save the structure under the parent node. Record the database.
  • the server After the server finds the mobile phone address book of the desired user and the querying user, the server includes: the server counts the two address books by using the address book of the desired user and the query user as a parent node, and statistics the two The number of common contacts in the mobile phone address book respectively saved in the child nodes under the parent node or the server finds that all the child nodes contain the address book of the desired user and the query user, and the statistical child nodes include The number of all the parent nodes of the desired user and the querying user.
  • Determining, by the embodiment of the present invention, the degree of relevance of the contacts in the two mobile phone contacts, and determining whether it is the desired user that is found includes: setting a threshold for the common contact of the desired user and the querying user When the statistics of the two mobile phone address records in the two mobile phone address books are respectively stored in the child node under the parent node, the number of common contacts or the statistical child nodes jointly include the desired user and all the parent nodes of the query user.
  • the number is not less than the threshold, it is determined to be the desired user that is found; when the statistics of the two mobile phone contacts are respectively saved in the child nodes under the parent node, the number of common contacts or statistics When the number of all the parent nodes in the node that jointly include the desired user and the query user is less than the threshold, it is determined that it is not the desired user that is found.
  • FIG. 2 is a schematic diagram of a device for searching for a desired user by using a mobile phone address book according to an embodiment of the present invention.
  • the method includes: establishing a database module 201, configured to receive and save a mobile phone respectively uploaded by each mobile terminal The address book, the address book database is established; the searching module 202 is configured to search the address book database for the mobile phone address book of the querying user and the desired user according to the request of the query user via the mobile terminal to find the desired user.
  • the mobile phone address book; the determining module 203 is configured to determine whether the contact degree of the contacts in the two mobile phone contacts is determined after finding the mobile phone address book of the desired user and the querying user Expecting a user; a sending module 204, configured to communicate the determined expectations by communicating with the mobile terminal User information is sent to the querying user.
  • the device may further include: an indirect search module, configured to: when the mobile phone address book of the desired user is not found in the address book database, search for the query user and the desired user from the address book The mobile phone address book of the related common contact user searches for the desired desired user information in the mobile phone address book of the common contact user.
  • an indirect search module configured to: when the mobile phone address book of the desired user is not found in the address book database, search for the query user and the desired user from the address book
  • the mobile phone address book of the related common contact user searches for the desired desired user information in the mobile phone address book of the common contact user.
  • the establishing database module 201 includes: an establishing unit, configured to store the address of each user as a parent node by using a name + a mobile phone number, and save the name and mobile phone number of all contacts as a child node under the parent node.
  • the structure to build the address book database is:
  • the judging module 203 includes: a statistic unit, configured to: the server searches for an address book in which the desired user and the query user are parent nodes, and the two mobile phone address records are saved in a parent. The number of common contacts in the child nodes under the node or the server finds the desired user and the query by including the desired user and the query user in all the child nodes.
  • a number of all parent nodes of the user a set threshold unit, configured to set a threshold for the common contact of the desired user and the querying user; a determining unit, configured to In the mobile phone address book, the number of common contacts in the child nodes under the parent node or the number of all the parent nodes in the statistical child node that collectively include the desired user and the query user are not less than the threshold value. Determining that it is the desired user that is found or that the two mobile phone contacts in the statistics are saved in the child nodes under the parent node. If the number or statistical number of child nodes included in common in the human system the desired user and the parent node queries all users is less than the width value, it is determined that it is not looking for a desired user.
  • FIG. 3 is a block diagram of an overall module for searching for a desired user by using a mobile phone address book according to an embodiment of the present invention.
  • the terminal side includes: an address book module 301, configured to save address book data of the terminal user;
  • the address book synchronization module 302 is configured to cooperate with the platform synchronization module 305 to perform data synchronization between the terminal and the platform address book.
  • the terminal address book module 301 needs to periodically synchronize with the platform data to ensure platform data. Updating; the terminal requesting module 303 is configured to send request data to the platform requesting module 309; the terminal receiving module 304 is configured to receive data fed back from the platform receiving module 308;
  • the platform side includes: a platform synchronization module 305, configured to cooperate with the address book synchronization module 302 to synchronize the address book data of the terminal and the platform; and the address book data module 306 is set to be saved according to the usage.
  • the user's address book generates index data of the name + mobile phone number;
  • the logic control module 307 is configured to perform a search for a contact, determine whether the two users are associated, and set a logic control function such as private data;
  • the platform receiving module 308 is configured to receive the slave terminal
  • the request data 2020 is used to send the result data to the terminal module.
  • the management configuration module 310 is configured to manage the entire system, including management functions such as business logic management, log record, and parameter configuration.
  • the address book data module 306 can set each user as a parent node, and each "contact + mobile phone number" in the other address book is suspended as a child node under the parent node of the current user, and each user There is a data structure of such a parent-child structure, which aggregates the data of all users to form an address book database;
  • the logic control module 307 determines whether the two users are associated with each other by counting the common contacts of the two users and setting a threshold. When the number of the common contacts of the two users passes the threshold, the two users are determined as two users. It may be related.
  • the method for searching for a contact may be: obtaining the information of the queryer and the queried person of the platform receiving module 308, and searching the address book data module 301 for all the address records of the queried person as the parent node, and the owner of the address book is composed.
  • the suspected associated person further determines whether the queryer and all the suspected associates are associated by using the method for determining whether the two users are associated with the above, and sends the qualified associated person result to the platform requesting module 309 to send to the receiving module 304 of the terminal, thereby Handed over to the user for processing.
  • Another method for searching for a contact may be to obtain information of the queryer and the queried person of the platform receiving module 308, and to the address book data module 306 to find all the address books of the queried person as child nodes, the owners of these address books. Forming the suspected associated person, further determining whether the queryer and all the suspected associates are associated by using the method for determining whether the two users are associated with the above, and sending the qualified associated person result to the platform requesting module 309 and sending the result to the terminal receiving module 304, thereby Handed over to the user for processing.
  • FIG. 4 is a schematic flowchart of a method for searching for a desired user by using a mobile phone address book according to an embodiment of the present invention. As shown in FIG. 4, the method includes the following steps:
  • Step 401 The user sends a query request to the platform side through the terminal side;
  • Step 402 The platform side receives a request sent by the user from the terminal, and saves;
  • Step 403 The platform side queries the address book database, finds the contact that the user wants to find, and saves it to the sending module.
  • Step 404 The platform side sending module sends the query result to the user mobile phone terminal, and the user processes the query result.
  • FIG. 5 is a flowchart of a method for searching for a desired user by using a mobile phone address book according to an embodiment of the present invention.
  • user A wants to find user B through an online address book, where both user A and user B are located. Uploaded your own address book to the server. It is assumed that when the number of common contacts of two users is greater than or equal to 3, it is considered that two users may know.
  • the specific steps are as follows: traversing the data of the platform address book data module terminal, searching whether the B user uploads the address book, and if the user B is found, comparing the address records of the user A and the user B, determining whether the A and the B have more than 3 common If the conditions are met, the contact person B may be the person who is looking for A. Record the contact information of B, and then continue to traverse. Send all the contact information of B that meets the conditions to A, and user A will handle it.
  • the contact B may be the contact that A wants to find. people.
  • the user can only disclose a part of the contacts in the address book, for example, only the contacts who are the classmates are disclosed, which is equivalent to narrowing down the scope of the search and the range of the search to the range of the classmates. Controlled the spread of mobile phone numbers.
  • the embodiment of the present invention can use the address book of the mobile phone to search for contacts related to the user, and the mobile phone user uploads the address book to the server, and the server uses the contact name + mobile phone number in the address book as the unique identifier of the user and The index determines whether there is a possibility of a relationship between two users by comparing the matching degree of the index in the user address book.
  • the user can actively search for contacts that he or she wants to find, and expand the user's address book.
  • the embodiment of the invention utilizes a carrier held by a public mobile phone, which expands the search range and search precision, and establishes a global search contact network, which is simple in operation and suitable for the mass population. It is also possible to develop value-added services for operators and increase the user experience of operators.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Telephonic Communication Services (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention se rapporte au domaine technique des terminaux téléphoniques, et concerne un procédé et un appareil destinés à rechercher un utilisateur prévu en utilisant un répertoire téléphonique. Le procédé comporte les étapes suivantes: un serveur reçoit et conserve un répertoire téléphonique téléchargé par chaque terminal mobile, et établit une base de données de répertoires téléphoniques; le serveur explore, en fonction d'une demande formulée par un utilisateur interrogateur à l'aide du terminal mobile et visant à rechercher un utilisateur prévu, la base de données de répertoires pour y trouver un répertoire téléphonique de l'utilisateur interrogateur et un répertoire téléphonique de l'utilisateur prévu; le serveur détermine, après avoir trouvé les répertoires téléphoniques de l'utilisateur interrogateur et de l'utilisateur prévu, un degré de corrélation des contacts figurant dans les deux répertoires téléphoniques, et détermine si l'utilisateur prévu trouvé par le serveur est l'utilisateur prévu recherché par l'utilisateur interrogateur; et le serveur communique avec le terminal mobile et envoie à l'utilisateur interrogateur des informations concernant l'utilisateur prévu déterminé.
PCT/CN2013/084081 2013-07-25 2013-09-24 Procédé et appareil de recherche d'un utilisateur prévu à l'aide d'un répertoire téléphonique WO2014166213A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310317880.0A CN104348941B (zh) 2013-07-25 2013-07-25 一种利用手机通讯录查找期望用户的方法及装置
CN201310317880.0 2013-07-25

Publications (1)

Publication Number Publication Date
WO2014166213A1 true WO2014166213A1 (fr) 2014-10-16

Family

ID=51688905

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/084081 WO2014166213A1 (fr) 2013-07-25 2013-09-24 Procédé et appareil de recherche d'un utilisateur prévu à l'aide d'un répertoire téléphonique

Country Status (2)

Country Link
CN (1) CN104348941B (fr)
WO (1) WO2014166213A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106302969A (zh) * 2015-06-03 2017-01-04 西安中兴新软件有限责任公司 一种恢复通讯录的方法及终端
WO2018023765A1 (fr) * 2016-08-05 2018-02-08 胡明祥 Procédé de régulation de technique d'interrogation en fonction d'une rétroaction du marché, et système d'interrogation
WO2018023768A1 (fr) * 2016-08-05 2018-02-08 胡明祥 Procédé d'adaptation de technologie de partage de carnet d'adresses en fonction d'autres utilisateurs, et système de partage
WO2018023769A1 (fr) * 2016-08-05 2018-02-08 胡明祥 Procédé d'ajustement de technologie de partage de carnet d'adresses, et système de partage
WO2018023770A1 (fr) * 2016-08-05 2018-02-08 胡明祥 Procédé de partage de carnet d'adresses de contacts de téléphone mobile, et système de partage

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109039856A (zh) * 2018-07-03 2018-12-18 广州法度信息科技有限公司 专业服务匹配系统、方法和服务器

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101527901A (zh) * 2008-03-03 2009-09-09 张岩 一种手机在线通讯录的方法
CN102480705A (zh) * 2010-11-26 2012-05-30 卓望数码技术（深圳）有限公司 一种根据号码关系图过滤垃圾短信的方法及系统
CN102510551A (zh) * 2011-09-30 2012-06-20 奇智软件（北京）有限公司 一种移动通讯工具中好友自动推荐的方法及装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101340460B (zh) * 2008-08-11 2012-07-18 深圳市戴文科技有限公司 一种信息共享及查询方法、系统及移动终端和服务器
CN104244223A (zh) * 2013-06-17 2014-12-24 中兴通讯股份有限公司 一种联系人查询方法及装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101527901A (zh) * 2008-03-03 2009-09-09 张岩 一种手机在线通讯录的方法
CN102480705A (zh) * 2010-11-26 2012-05-30 卓望数码技术（深圳）有限公司 一种根据号码关系图过滤垃圾短信的方法及系统
CN102510551A (zh) * 2011-09-30 2012-06-20 奇智软件（北京）有限公司 一种移动通讯工具中好友自动推荐的方法及装置

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106302969A (zh) * 2015-06-03 2017-01-04 西安中兴新软件有限责任公司 一种恢复通讯录的方法及终端
WO2018023765A1 (fr) * 2016-08-05 2018-02-08 胡明祥 Procédé de régulation de technique d'interrogation en fonction d'une rétroaction du marché, et système d'interrogation
WO2018023768A1 (fr) * 2016-08-05 2018-02-08 胡明祥 Procédé d'adaptation de technologie de partage de carnet d'adresses en fonction d'autres utilisateurs, et système de partage
WO2018023769A1 (fr) * 2016-08-05 2018-02-08 胡明祥 Procédé d'ajustement de technologie de partage de carnet d'adresses, et système de partage
WO2018023770A1 (fr) * 2016-08-05 2018-02-08 胡明祥 Procédé de partage de carnet d'adresses de contacts de téléphone mobile, et système de partage

Also Published As

Publication number Publication date
CN104348941B (zh) 2019-07-09
CN104348941A (zh) 2015-02-11

Similar Documents

Publication Publication Date Title
WO2014166213A1 (fr) Procédé et appareil de recherche d'un utilisateur prévu à l'aide d'un répertoire téléphonique
TWI791935B (zh) 服務發現的方法及設備
WO2014201800A1 (fr) Procédé et dispositif de requête de personnes de contact
Römer et al. Real-time search for real-world entities: A survey
US8392407B2 (en) Method, apparatus and system of searching and downloading mobile telephone file
WO2019200714A1 (fr) Procédé de connexion de serveur, support de stockage lisible par ordinateur, dispositif terminal et appareil
WO2017114205A1 (fr) Procédé de traitement de lien court, dispositif et serveur
CN106534392B (zh) 一种定位信息采集方法、定位方法及装置
RU2015116752A (ru) Способ и система обеспечения клиентскому устройству автоматического обновления ip-адреса, соответствующего доменному имени
AU2013397053B2 (en) Content sharing method and social synchronization apparatus
KR20160030468A (ko) 저장 기기에서의 파일 검색 방법, 장치, 라우터, 프로그램 및 기록매체
US9544944B2 (en) Adaptive, personal localized cache control server
WO2018227695A1 (fr) Procédé, dispositif et système d'envoi et de réception de données d'abonnement
WO2020024445A1 (fr) Procédé et appareil de stockage de données, dispositif informatique et support de stockage informatique
WO2013178101A1 (fr) Procédé et système pour opérer un tri dans le carnet d'adresses d'un terminal mobile
US20070168419A1 (en) System, method, and article of manufacture for a network media channel
WO2011017935A1 (fr) Procédé de recherche mobile et son système
WO2012155480A1 (fr) Procédé et dispositif permettant de rechercher des informations de contact
CN111814020A (zh) 一种数据的获取方法和装置
WO2017000540A1 (fr) Procédé et dispositif d'interrogation de données
CN114978897B (zh) 基于eBPF和应用识别技术的网络控制方法和系统
EP2232896A1 (fr) Procédé et appareil pour déterminer une liste de membres pour un service de communications à l'alternat
KR102251705B1 (ko) 시간의 경과에 따라 콘텐츠로의 접근을 제한하는 콘텐츠 제공 서버의 동작 방법과 이를 이용한 서비스 제공 방법
WO2013116991A1 (fr) Terminal mobile, serveur, procédé permettant de pousser un ordonnancement, et procédé d'acquisition d'ordonnancement
Silaghi et al. P2P petition drives and deliberation of shareholders

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13881762

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13881762

Country of ref document: EP

Kind code of ref document: A1