KR20060020569A - Business clique connecting service method and apparatus - Google Patents

Abstract

The present invention is a method and apparatus for providing business connections professional services, each member invites other members to form a network relationship between the invited member and the other invited members according to the acceptance of the invitation and then one member profile of another member If you request the other member by inputting the request information, you can determine the best route for delivering the request based on the network relationship and send it to the other member, and the requested other member will respond to the acceptance or cancellation of the request. This can be done by sending, which can activate sales activities for companies or individuals.

Invite, request, network search

Description

Business clique connecting service method and apparatus

Figure 1a shows a menu configuration provided in the server for providing a business network connection service according to the present invention.

1B is a diagram illustrating an overall flowchart of a service method according to the present invention.

1C shows a membership registration flow chart.

2 to 5 show a request flow chart.

6-9 are flowcharts for processing a received request.

10 to 11 are flowcharts for processing a delivery request.

12-16 are flowcharts regarding an invitation.

17 to 20 are flowcharts for the network searching process.

21 to 25 are flowcharts of processing mileage.

26-29 are process flowcharts regarding a group part.

30 is a diagram illustrating a system operating environment.

The present invention relates to a method and apparatus for providing a business network connection service, and a service method and apparatus for helping to activate activities such as sales activities for companies or individuals, sales network establishment, recruitment, job search, and start-up of small and medium enterprises. It is about.

Using the Internet, the range of searching for and using information necessary for the user is being greatly expanded. However, it is not easy to find someone directly related to you through internet searches.

The technical problem to be achieved by the present invention is to provide a service method and apparatus that helps to activate activities such as sales activities for companies or individuals, sales network construction of small and medium enterprises, job openings, job search, start-ups, and the like.

Networking service method according to the present invention for solving the above technical problem, the step of entering their profile while registering as a member; Inviting each member to form a network relationship between the invited member and the invited other member according to whether the other member accepts the invitation; Requesting, by one member, from another member by inputting a request by referring to another member's profile; Determining an optimal path for delivering the request from the requested member to the requested other member based on a network relationship formed between the members and sending the request to the requested other member; And sending, by the requested other member, an answer regarding the acceptance or cancellation of the request.

If the invited member accepts the invitation from the invited member, the invited member and the invited member form a mutual relationship with each other, and the member with the other member has a relationship with the invited member. It is preferable that a two-member relationship is formed, and a member having a two-member relationship with another invited member is formed with a three-member relationship with the invited member, and if the requested member and the requested other member have a one-member relationship Preferably, the request is sent directly from the requested member to the requested other member.

When the requesting member is able to directly connect with the requested other member, the request is sent to the requested other member, and the request from the requested member to the requested other member is transmitted through the third member. The request is sent to the forwarder, and if the forwarder accepts the request for delivery, an acknowledgment message is sent to the next forwarder. If the forwarder cancels the forwarding request, the request delivery process is preferably terminated.

It is preferable that the requested other member checks the profile and network status of the requested member, writes a response message regarding acceptance or cancellation of the request, and sends an email to the requested member.

Search for routes through which the request can be forwarded from the requested member to the requested other member based on priorities of the contacts between the members, and then add up the requested performance values of the members on the discovered routes; The priority of the channels is determined, and the performance of each member's request is the number of requests made by each member, the number of requests made by each member, and the number of requests delivered compared to the number of requests received by each member. Based on the above, it is preferable to calculate by giving weight to each said number.

In determining the priority of the searched routes, the fewer steps to deliver on each searched route, the higher the weight is applied to the sum of the results calculated for each searched route, or the search When the requested performance value of the member on the established paths is lower than the predetermined reference value, it is preferable to subtract a certain value from the performance value of the member and then add up the performance value.

And paying for the request, wherein the requesting member pays a predetermined fee when the request sent by the requesting member is accepted to the requested other member, and the requesting member pays the other member as the requested other member. If there is an intermediary delivery step in the request sent, an additional fee will be settled, and the intermediary forwarder may be required to pay some of the fee, and the requested member may either accept the request or intermediate the request to the requested member. When the forwarder accepts the request for delivery, the requested member and the forwarder may be given a predetermined bonus mileage, and the bonus mileage may be settled at a cost required when the request is made to another person later.

In addition, it is preferable that a plurality of members form a group, and a member can be searched and billed in group units.

Networking service method according to the present invention for solving the above technical problem, the step of entering their profile while registering as a member; Inviting each member to form a network relationship between the invited member and the invited other member according to whether the other member accepts the invitation; Requesting, by one member, from another member by inputting a request by referring to another member's profile; Search for routes through which the request can be forwarded from the requested member to the requested other member based on priorities of the contacts between the members, and then add up the requested performance values of the members on the discovered routes; Determining a priority for the paths; If the requested member can directly connect with the requested other member, directly sending the request of the requested other member; When the request from the requested member to the requested other member is transmitted through the third member, the request is transmitted to the intermediate forwarder, and if the intermediate forwarder accepts the forwarding request, an acceptance message is sent to the next forwarder. The request is sent to the other requested member when all of the intermediate forwarders accept the request; when the forwarder cancels the request for delivery, the request is terminated without being sent to the requested other member; Sending, by the requested other member, an answer regarding the acceptance or cancellation of the request; And the requesting member pays a predetermined fee when the request sent by the requesting member to the requested other member is accepted, and if there is an intermediate delivery step in the request sent by the requesting member to the requested other member, the delivery request fee is It includes the step of payment.

Networking service apparatus according to the present invention for solving the above technical problem, Member registration unit for receiving and registering the profile of the person who is registered as a member; A network forming unit for forming a network relationship between the invited member and the invited other member according to whether each member invites another member to accept the invitation; One member inputs a request with reference to another member's profile and requests the other member, and the optimal path for transferring the request from the requested member to the requested other member is based on a network formed between the members. And a request processing unit which transmits the request to another member who has been requested based on the determination, and sends an answer regarding the acceptance or cancellation of the request by the other member who has been requested.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

Figure 1a schematically shows a menu configuration provided on the server for providing a business network connection service according to the present invention. The order of using the Business Network Connection Service (hereinafter referred to as BizMac Service as necessary) according to the present invention is as follows: (1) Sign Up, (2) Profile Entry, (3) Address Book / Calendar, (4) Invitation , (5) search, (6) BizMac request, and (7) payment. Hereinafter, the function of each menu illustrated in FIG. 1A will be described in detail.

Looking at the member registration (11), you can register through a simple procedure so that anyone can easily sign up, and in order to save the hassle of entering personal information about unnecessary items when registering as a member It is desirable to process only the basic information corresponding to the required items to be subscribed. In addition, it is processed to log in after verifying BizMac network's authentication according to the privacy policy. Login from BizMac is handled by email address, and communication between members is handled by email.

Immediately after going through the authentication check, the user enters the profile input 12. The core profile of the BizMac network is the data that other members use as the basis for inviting me to their first village or making business requests. Profile input is one of the most important factors because it helps other members review your introduction, the profile that best describes you, and use it as a reference when attempting invitations or requests. The profile input 12 is divided into a profile 121 for inputting a profile for each item and an environment setting 122 for using BizMac.

Profile 121 is a career summary information that can inform the situation related to my current job in relation to the business and career history information with my history information accumulated during social activities, school information that can represent my education, personal me Includes personal information that you represent and photographic information that allows you to express yourself on the site. The profile consisting of several elements is divided into My Profile 1211, which can modify and delete its information, and a Public Profile 1212 that is open to other members. Because it is a BizMac that cares about personal information, as part of a privacy policy, it is desirable to organize my profile 1211 that manages my data and a public profile 1212 that is open to other members. In the public profile 1212 visible to outsiders, a button for making a BizMac request is inserted to process the request. The environment setting 122 refers to an environment setting that is set to obtain all desired items by setting conditions that I want when using the BizMac network.

The address book / calendar 13 corresponds to a personal diary, while all other items are necessary items for communication among members, while the address book / calendar is a personal data entry item that can manage its schedule. The address book / schedule (13) is an address book (131) for recording an address book that is personally known, a schedule (132) for inputting all schedules that occur in everyday life, and a member's data necessary for me among members of the BizMac network. It is divided into a library 133 that can be stored.

The address book 131 includes an address book for inputting personal information and an e-mail address of my friends and colleagues, and an address book retrieval for retrieving an address book stored in another computer or a medium and storing it in a BizMac network. The schedule 132 includes a schedule for inputting a daily schedule, a work schedule being processed in a company, and a note for a simple memo. My schedule is organized by day, week, month, and year to make it easy to enter and browse data, and it is a personalized item because it also has reminders to inform individuals according to the schedule. And the data room 133 is a data warehouse that stores the data I requested as needed for later retrieval.

The first village made through the invitation (14) serves as a forwarder to help connect with the final requestor when making a BizMac request to other members. The more villages connected with me, the wider the range of connections that can be requested and the greater the probability of success. In BizMac, Village 1 can be said to be the basis for success.

Invites (14) include the invites (141) for inviting friends and colleagues, the sent invites (142) that hold data about the invitations you sent, and the received invites that show the data that others invited you to ( 143). In the invitation (14), you can invite the friends or colleagues in the email address stored in the address book / calendar of the invitation, or invite by entering the e-mail address of known friends directly.

Invite (142) is the place where the invitation history that I invited others appears, where the list of invitations I sent is shown, the result of the invitation is shown as waiting for invitation, accepting invitation, cancellation of invitation. In the received invitation 143, a list of invitations that other members invited me is shown, and it is a place where the invitation can be accepted or canceled in response to the invitation. When the result of this invitation is shown as acceptance of the invitation, a relationship with the invited person is established. My network is formed through the invitation (14), you can see the status of the network by relationship. It also shows the status of the contacts I have in relation to my preferences.

The search 15 is performed to find the best expert member to make a request that meets the conditions I need. The search 15 is composed of a simple search 151 that can be easily found by anyone and a condition search 152 that can be searched by extracting only necessary conditions. Conditional search 152 is processed to find by the conditions such as name, status, company, industry, location.

All of the items provided by BizMac help to make BizMac requests, and all the additional items are preliminary preparations for BizMac requests. The BizMac request 16 can make a request by looking for the member I'm requesting in the search, looking at the member's public profile, and clicking the BizMac Request button in that public profile. The BizMac request 16 is divided into a request 161 that I request to other members, a request 162 received from other members, and a forwarded request 163 that forwards the request according to the members' requests.

In request 161, the requests that I have requested to other members are shown in a list, and the result of the request is in progress, pending, completed, or canceled. It also attempts to evaluate BizMac requests by processing requests only for successful requests. In the received request 162, requests received from other members are shown as a list, and the result of the request is shown as being in progress, pending, completed, or canceled. It also attempts to evaluate BizMac requests by processing requests only for successful requests. In response to the request, it helps to understand the communication between each other by leaving a message about the reason for acceptance and the reason for rejection. In the forwarded request 163, the BizMac request corresponds to a forwarding request that is forwarded from the requester to the final requestor. The requests I've forwarded to other members are listed, and the results of the request are in progress, pending, complete, or canceled. When conveying, they will help you understand the communication between them by leaving a message about why you accept it when you accept it.

Looking at the settlement (17), the BizMac pays with a coin called BizMac Coin once used when requesting a BizMac. BizMac Coin refers to the name of the fee charged when a BizMac request is made to the cyber money used and distributed within the BizMac network. BizMac coins are classified into bonus coins and mileage coins. Bonus coins are coins provided by BizMac, and mileage coins are coins purchased and paid by individual members. If BizMac Coin is settled at 1,000 won, BizMacCoin will earn 10 coins.

In the case of using BizMac Coin, if BizMac request is made once, BizMacCoin is settled 10 coins, and when BizMac request is made, 5 coins are settled for BizMac Coin of intermediate delivery request cost. All payments charged by the BizMac requester are paid. In other words, the requester pays both the fee of the request result and the fee of the delivery request, and 3 coins, which are 60% of the delivery request amount, are paid to the intermediate forwarder, and 2 coins are paid as a fee of the BizMac operating company.

If the BizMac request fails, no coins will be paid. There is no charge for BizMac requests that are attempted to the 1st, 2nd, and 3rd attempts after the first failed request.However, if re-requests continue from the 4th BizMac request, the charges are based on the number of requests. May be imposed. That is, BizMac coins of 10 coins are charged for each request, regardless of the success or failure of the request. And if the request is made directly to the requesting member, BizMac Coin 30 coins will be paid. Mileage coins will be settled when the bonus coins provided in BizMac are exhausted.

The payment amount of BizMac coin is 1,000 won (10 coins), 3,000 won (30 coins), 5,000 won (50 coins), 10,000 won (100 coins), 30,000 won (300 coins), 50,000 won (500 coins), 100,000 You can select and pay from one thousand (1000 coins), and the mileage history used by the individual is displayed.

Next, referring to the group management 18, the BizMac group refers to a business group targeting members belonging to companies. Among individual members, members of the same company can be combined into a BizMac group created under the company name. Help members in the group build deeper bonds with each other and give members of the group more accurate and systematic interests. It is a system to strengthen and strengthen the power of the powerful network called group.

BizMac encourages group members to provide mutual deep impressions of images, special findings, and useful and explicit requests for their groups, and to ensure that members have a high quality and effectiveness that is not linked by professionals in any other way. Provides a network that can be controlled. Groups only serve to group individual members together, and they all use the same system. The only difference is that payments that are charged at the time of BizMac are charged in the group's mileage, not in the individual's mileage.

In the group, there is a separate operator of the group who applied for the group, and the use of the group is managed by the operator. In other words, there is a manager's admin page where all the situations between group members are checked and managed. To use the group, you have to pay a group usage fee.

And Group BizMac Coin is operated with the same system as personal mileage. The BizMac Group pays with a coin called BizMac Coin for one-time use when requesting BizMac. The BizMac Group Coin is a cyber money used and distributed in the BizMac network, and refers to the name of a fee charged when a BizMac request is made. BizMac group coins are classified into bonus coins and mileage coins. Bonus coins are coins provided by BizMac group, and mileage coins are coins purchased and paid by the group. BizMac Group Coin will earn 10 coins if the payment amount is 1,000 won.

In the method of using BizMac Group Coin, once a BizMac request is made, BizMac Group Coin is settled 10 coins, and when a BizMac request is made, 5 Coins are settled for BizMac Group Coin of intermediate delivery request cost. All payments made by Mac requests are paid by BizMac requestors. In other words, it is preferable that the requester pays both the fee of the request result and the fee of the delivery request. In addition, three coins, which are 60% of the delivery request amount, are paid to the requester for delivery, and two coins are paid as a fee of the BizMac operating company.

If the BizMac request fails, no coins will be paid. You will not be charged for BizMac requests that you have attempted to the 1st, 2nd, and 3rd attempts after the first failed attempt.However, if the 4th BizMac request continues to be re-requested, it will be charged according to the number of requests. May be imposed. That is, BizMac coins of 10 coins are charged for each request, regardless of the success or failure of the request. If the request is made directly to the requesting member, the BizMac Group Coin 30 coin will be settled. The group mileage coin will be settled when all the bonus coins provided in BizMac are used up. The payment amount of BizMac Group Coin is 30,000 won (300 coin), 50,000 won (5000 coin), 100,000 won (1000 coin), 150,000 won (1500 coin), 300,000 won (3000 coin), 500,000 won (5000 coin), You can choose and pay from 100,000 won (10000 coin), and the mileage history used by the group members is shown.

The server has a member table database in which personal information of members is stored. Member's personal information includes membership number (num), member's use (used), withdrawal date (out_date), name (email), e-amil (email), password (passwd), social security number (jumin), profile Title, spec, status, 1. employer, 2. employer, 3. consultant, 4. job seeker, 5. freelancer and contractor, 6. student. In addition, the server may be provided with a database for storing the following information.

Interest table: stores the user's interests.

Job summary table (job_role): stores the user's job.

History table; Save the user's career.

School of origin (school): stores the school the user graduated from.

Profile memo table (profile_memo): stores the user's profile.

1 village table (friend_0 ~ friend_9, friend_a ~ friend_z): Stores 1 village by ID.

Profile picture table (profile_photo): Create a profile and save the picture.

Profile album table (profile_album): Upload multiple photos and have an album.

Request table: stores the path of a BizMac request.

Temporary Request Table (tmp_path): Creates and stores the path of BizMac requests.

Manager board table: information provided to the administrator board is stored.

Affiliate Ad Text Table (ad_board): Stores affiliate / ad inquiries.

BizMac Group Table (biz_group): Stores user-created groups.

Group Member Table (group_member): Stores group members.

Group Fee Table (group_fee): Stores group fees.

Group Fee Payment Details (group_fee_list): Stores the details of payments made in the group.

Group mileage usage table (group_mile): Stores group mileage usage status.

Group Mileage Payment Table (group_mile_list): Stores mileage payment history in a group.

Affiliate advertisement table (concert): stores affiliate advertisements.

World Name Table (world): Stores the names of the world regions. (For joining foreigners)

Unsubscribed member table (member_del): Stores unsubscribed members.

Industry Sector Table (industry_search): Stores the industry sector selected by the user.

Group Email Table (group_email): Stores emails sent from groups.

The following describes in detail the processor processed in the server according to the present invention.

1. Management of villagers: Members who accept my invitation become a village relationship. If a member of my relationship with one's village has a village relationship with another person, I and the other person become a village relationship. In the same way, if two villages have one village relationship with others, the other becomes a uncle relationship with me. Above 4 villages means all members who do not belong to 1 ~ 3 villages. If you make a friend through the invitation function with a person (A) who was in a relationship with my two cousins, you are upgraded to a first cousin relationship with me. At this time, A's 1-year-old friends become me and 2 from their existing uncle relationship. At this time, the network relationship is upgraded to the nearest village (count 1) between the existing village and the new village. When I leave the network, my relationship with my village disappears, and the relationship with the people through which the network progresses is also affected. Those who have a connected relationship between me can continue that relationship.

2. My network request: When I make a request, I can find out what kind of village I am in and my real name is revealed to those who are in my village. If an intermediate person refuses to forward a request at the time of the request, the request ends in failure. There is also a status window that allows you to immediately see the status of whether the process is going well, is delayed, or stopped in the middle. Requests are divided into three categories: what I ask for, what I receive for the final request, and what is in between. If I request it, I can understand the situation by making it possible, proceeding, canceling and completing it. If I act as a forwarder in the middle of the request, I can see the process for it. If the person receiving the request (end-object) can contact him without a referral, the request is considered to be immediately available, otherwise it is only possible if there is a network in between.

3. Network Search: You can search various networks with the items (eg industry, sector, job, position, etc.) in various cells of the profile. In other words, it is possible to perform various search by simple search and detailed search, and the search results are shown in order of 1 village, 2 village, 3 village, 4 village. You can also search by specific name, company name, job title, and so on.

4. Personal Information Protection: I have protection of my personal information, so my information cannot be seen by others without my permission. The only exceptions are basic information such as my industry field, role, and profile title. My e-mail address is always hidden, and I can only see one village, and only one village can see various profiles such as photos. If I use the referral feature, I can always receive BizMac requests through my first village. If you do not use this feature, you can receive requests directly from other members without an intermediate forwarder. Others can't access the addresses in my address book, and their contents are unknown. For my first village, others cannot know who I am without my permission, but I know how many people there are. The same applies to the second and third villagers.

5. Mileage: Mileage coins are added or subtracted according to the number of requests and transfers.

6. My ID / Profile: Within the site, my email address will be my ID, and this ID is only revealed to my village. My profile is the basic data for all searches.

7. Address Book / Calendar: My address book can be imported from Outlook / Outlook Express, and this address book is also stored in DB. You can select and send the invite function from the DB of the address book. I can update my address book automatically, and my calendar / calendar is managed.

1B is a diagram illustrating an overall flowchart of a service method according to the present invention. The user accesses the server using a personal computer or other communication terminal and enters his / her profile while registering as a member (111). A member who joins as a member forms a connection relationship between the invited member and another invited member according to whether or not the other member accepts the invitation (112).

As such, when one member enters a request by referring to another member's profile and makes a request to another member (113), the request is transferred from the requested member to the other member. The optimal route is determined based on the networking relationship formed between the members, and the request is sent to the other members who are requested (114). The other member requested sends a response regarding the acceptance or cancellation of the request (115).

1C shows a membership registration flow chart. When entering personal information such as a name and social security number to register as a member (1111), a confirmation email for authenticating the member's ID is sent (1113). After the user checks the mail sent from the BizMac, the user is registered as a final BizMac member (1115) and can use the service provided by the BizMac (1117).

2 shows a request flow diagram. After confirming the public profile of the member to be requested through social networking (21), the user moves to the request page and then inputs a request (for example, request type, location, title, and request content) (22). Then, an optimal route is generated 23 using the success rate, the number of contacts, and the like and the e-mail is sent. If there is a forwarder, a mail is sent to the forwarder, and if a direct connection is possible, a direct mail is sent (24). The sent request can be checked on the request page for progress (eg progress, delay, completion, cancellation) (25). The request process as described above will be described in more detail.

Referring to Figure 3, after confirming the public profile of the member to request a BizMac request is made by clicking the BizMac request button. When requesting a BizMac, the ID of the member receiving the request is encrypted (using base64_encode) and moved. The member's data shown in the public profile can be selectively viewed according to whether the member is public or private. Public profile information includes career summary (name, profile title, main industry field, professional role), career (career company name, industry field, working period, career position, position role), school of origin (school, major, period) ), Etc.

Referring to FIG. 4, a request form is created to make a BizMac request. (1) of the figure outputs a form that can be requested to the requestee (eg, it is possible to propose a job). This can be set in the member's preferences. The set value is encrypted and stored in the database. (2), (3), (4) of the drawings are required to enter all the required items to make a request is possible. [2: Location (e.g. via e-mail and e-mail by specifying a specific area), 3: Title (e.g., please do the project with our company), 4: Request details] (1) ~ ( 4) If you enter all the values up to, you can request BizMac. The request path is set as the optimal path in consideration of the network relationship, the request method, the contact number of the forwarder, and the probability of success upon request [mathematical calculation: (number of successes / requests) * 100].

Hereinafter, in order to set the request path, a method of using the request result value for each member according to the results requested or requested by each member so far will be described. If the requested results are high, it is likely that BizMac has been active. An example of parameters and weight calculation methods used to calculate the request results is as follows.

(1) The number of requests I made: The number of times I requested BizMac to others to get the information I needed.

If I request more than 20 times, 100, 10 ~ 20 times, 80, 6 ~ 10 times, 60, 1 ~ 6 times, 40, 0, 20, respectively, and the weight for the number of requests I request is [ (Value / 100) * 30].

(2) Number of requests I received: The number of times someone asked me for BizMac.

The weight for the number of requests I calculate is [(number of requests / 100) * 30].

(3) Request delivery rate: The number of cases I delivered compared to the number of requests I received (the number of times I was selected as the intermediate forwarder to go to the last requester) (the number of requests I delivered if I was selected as the intermediate forwarder).

The weight for the percentage of requests I've delivered is calculated as [(number of delivered / total number of delivered requests) * 40].

Therefore, my requested performance value is calculated as [requested weight + requested weight + delivery weight].

When a member requests, requests or delivers, the request results are recalculated in real time and stored in the database. When searching a path for a BizMac request, when one member requests another member, the request results of the members on the request delivery path are summed and the delivery path is extracted according to the higher rank.

On the other hand, it is desirable to further reflect not only the requested performance value of each member, but also the village relationship. For example, if the path of the BizMac request is 2 steps, the addition point is 50, and if the 3rd step is 30, the addition point is 30, and if the 4 step is 10, the addition point is 10, and the village relationship is applied to the priority of the BizMac request path.

In addition, there is a case in which the difference in scores of the request performance value is severe for each member in the request condensation. If the request performance value of one member is less than 20, 10 points per person are deducted from the total score of the request path and reflected in the priority. As a result, it is possible to eliminate an error caused by summing up individual performance values. That is, since the path is long (step 4), the sum of the performance values of the members on the path is increased, and as a result, the priority can be prevented from being increased and a path having a higher success rate can be searched for.

The calculation method of the request performance value as described above describes an example, and a value or a reference value used for parameter selection and weight calculation for each parameter may be changed according to an application.

Referring to FIG. 5, the BizMac request is output as a list (received member name, request subject, date, request result, evaluation process). (1) The request result of the figure indicates the current status of the forwarded request, and is divided into four types: in progress, delay, completion, and cancellation. (2) The evaluation process of the figure evaluates the completed result among those requested. The evaluation process is to evaluate the request received by the requesting member. The evaluation process is classified into five types: very satisfied, satisfied, moderate, dissatisfied, and very dissatisfied. The results and evaluation process are encrypted and stored in the database, so no one but you can see them.

6 is a flowchart of processing a received request. In the received request page, the request can be confirmed (61). In other words, by clicking on the name, the requester's public profile can be checked, and by clicking on the title, the requester's request can be checked. After confirming the request, the user may choose to accept or cancel the request (62). A response to the acceptance or cancellation is written and an email is sent to the requester (63), and the requestor can then check the sent reply mail (64). The current status of the request can be found on the request page. The requestor can re-request via a different path on the request page when canceling the request. In the following, it will be described in more detail.

7 is a list of requests sent by the user (received member name, request subject, date. Request results, evaluation processing) is displayed. (1) If you click on the name of the recipient member in the drawing, you will be redirected to the recipient's public profile. (2) Request topic in the figure is a title written by the requestor, and when clicked, the detailed page of the request content is moved.

8 is a detailed page of the request received, BizMac request details (requested person, requested person, request date, request status), request title, request details, requestor's profile (eg company name, industry sector, specialty) Items) are displayed. (1) If you click on the name of recipient, you can check the public profile of the member. (2) and (3) in the figure are buttons for accepting (accepting to connect) and canceling (canceling to connect), respectively, and when the button is clicked, the corresponding page is moved. In addition to the details of the request, the received request detail page shows basic information about the requestor and the status of the network so that it can be used to help accept the request.

9 is a page that is moved when the acceptance or rejection of the request received, (1) of the drawing is a part to write the contents of the response when the acceptance or rejection. (2) in the drawing is a final confirmation button upon acceptance or rejection. By clicking this, success or failure of the BizMac request is determined. BizMac request is made through the steps (1) and (2) of the drawing, and upon acceptance or rejection, an e-mail regarding acceptance or rejection is sent to the requestor. If the request is canceled, the requestor can retry the request in a different way. The path is output in the order of the highest probability considering the network relationship, the request method, the number of forwarders, and the probability of success upon request [mathematical calculation: (number of successes / requests) * 100].

10 is a flowchart of processing a delivery request. The request is made by the requestee and the request is impossible. The request is delivered to the last requestee by delivery and can be checked on the forwarded request page. If you click on the name, you can check the public profile of the requester, and if you click the title, you can check the request details of the requester (101). It may then choose to accept or cancel the request (102). Upon request delivery acceptance (103), write a response to the acceptance (104) and then send mail to the next forwarder (105), and the next forwarder can check the sent mail, and the current status of the request is See page 106. In case of cancellation (rejection) of the delivery (103), write a reply to the cancellation (107), and then send a cancellation reply to the requester by mail (108), and the requester can check the sent mail, The current status of the request can be seen on the request page (109). When canceling a request, the requestor can re-request through a different path on the request page.

Referring to Figure 11, the forwarded request is operated in the same form as the received request. The difference is that if there is no direct connection between the requestor and the requesting member, the request sent by the requester is forwarded to the next forwarder and forwarded to the member receiving the final request. Is that. If there is a forwarder in the position of (1) of the figure, the name is disclosed if the forwarder is in a relationship with me. However, if more than two villages, the name is public or private depending on the forwarder's preference. The forwarder's role is important because the forwarded request is determined by the forwarder.

12 is a flow chart of an invitation. Invite others to expand my network, but both BizMac members and non-members can invite me. Fill out the invitation form for the invitation and send the mail (125). The current status can be checked in the invitation sent. If the invited person is a member, after confirming the received mail, the user selects to accept or cancel the invitation (126). Upon acceptance or cancellation, an e-mail is sent to the invitee, and the current state can be confirmed in the received invitation (127). Upon acceptance of the invitation, there is a village relationship between the invited and the invited, and if there is a network of acceptors, the invitee will have as many contacts as the acceptor (128). The number of villagers consists of 1, 2, 3, 4 villages based on the invitees. If the invitee is a non-member, if he / she confirms the e-mail received from the invitee and accepts the invitation, he / she will be deemed to have accepted the invitation (one village relationship). The current status can be checked on the invitation received.

Referring to FIGS. 13 and 14, an invitation is used to expand my network, and an invitation is possible for both BizMac members and non-members. In addition, the e-mail address of the member to invite can be entered using the address book or directly. 13 (1) is a button which is clicked when using an address book, and when clicked, an address book list can be brought as shown in FIG. 14 (2). After adding the email address, fill out the form by entering the subject and content, and click the invite button. However, in the case of members and non-members, the type of mail sent is different. That is, in the case of a member, an e-mail of acceptance of an invitation is sent, and in the case of a non-member, an e-mail inducing BizMac membership is sent. However, if you are a village or already a network, you will not receive an email with an incorrect email address.

Referring to FIG. 15, the result of the BizMac invitation is output in a list form as shown in the figure, and the current state can be checked, and the current state is divided into two types: waiting for invitation and completion of invitation (accept / cancel). .

Referring to Figure 16, the received invitation can be confirmed in the received invitation of the BizMac, the date and the current status of the invitation is displayed. (1) of the figure is the name and ID information of the member who sent the invitation, when clicking it, you can check the public profile information of the member who sent the invitation. If you click on the title shown in (2) of the figure, you can see the details of the invitation, which is the same as the contents of the e-mail sent by the inviter. (3) and (4) in the drawing are the accept / cancel button for the invitation, and the invitation is accepted or rejected by clicking on it. When you click the Accept / Cancel button, the corresponding mail will be sent.

At first invitation, a village relationship is established and mortgaged in the database. In the storage form, the ID is stored in the first village table of the invitee and the invitee according to the first letter (0 ~ 9, a ~ z) of the invitee and the invitee. If a non-member joins a BizMac member after receiving the e-mail, the acceptance of the invitation is considered, and the database is stored in the same form as the member. If an approved member has existing contacts, he or she will be formed with a village or village relationship. In addition, members of the network also create a village relationship based on themselves.

17 is a flowchart for social networking processing. There are two types of searches, either simple search or condition search, based on the name, job title, company, industry, location, etc. (172). Then, the members who meet the search conditions may be extracted, information about the social relationship is provided (173), and the public profile for the searched member may be checked (174). In other words, a member who is in a network with me or who does not have a network with me, but who can request directly, is derived. Once a member's name, industry sector or professional role is derived, it is either private or public, depending on each member's preferences.

Referring to FIG. 18, the network search can be performed by two kinds of simple search and condition search. As a condition, it is possible to search by the condition of name, position, company, industry field, location, and company and position can be searched by current position and company currently in the condition search. (1) in the figure shows simple search, and (2) shows conditional search.

Then, as shown in FIG. 19, a member meeting the condition is derived. A member is identified who is in a network with you or who does not have a network with you but who can make a direct request. You can see the information of those who correspond to 1, 2, 3, and 4 villages by separating your network with tabs.

Referring to FIG. 20, information derived when searching for a network is derived from information about members whose search conditions match the conditions of the drawings. If the direct request is set as impossible in the environment setting, if there is a network connection with me among the people who meet the search condition, the BizMac request is made through the forwarder's path, otherwise it is not derived privately. If it is set as directly requestable in the environment setting, it is derived regardless of the network relationship with me, but if there is a village relationship in the BizMac request method, the request can be made through the forwarder.

21 is a flowchart of processing a cost according to a BizMac request. If a BizMac request is made once, 10 coins will be settled and 5 coins will be settled in the middle delivery request. The cost charged by the BizMac request is paid by the BizMac Requestor (the rate of the result of the request + the rate of the delivery request) .The requester is paid 3 coins, which is 60% of the delivery request amount, and 2 coins are BizMac. It is paid at the operator's fee. However, it is advisable to apply free BizMac requests between villages.

If the BizMac request fails, no coins will be paid. In other words, there is no charge for BizMac requests that attempted the first, second and third attempts after the first failed request. However, if the re-request continues from the 4th BizMac request, it will be charged according to the number of requests. That is, 10 coins will be charged for each request made, regardless of the success or failure of the request. If the request is made directly from the requesting member to the requested member, 30 coins will be settled. Payment will be made in the individual mileage coin after the payment by the bonus coin provided by BizMac is exhausted.

As an example, consider an example of mileage redemption in Member A's BizMac network. In order to use BizMac, A made a payment of 10,000 won through Bizmac's payment system, and if 10,000 won is the amount of payment, coins used in Bizmac will earn 100 coins. A attempted a BizMac request to ask E for sales-related data, and there was an intermediary requestor of B, C, and D between A and E.

Referring to FIG. 22A, when a BizMac request of A succeeds, a total of 25 coins will be spent. Looking at the usage history, since all 10 coins paid when the BizMac request is successful and a delivery request are made, A total of 25 coins were spent due to the spending of 15 coins. Meanwhile, B, C, and D accept the request for delivery, so they earn BizMac coins by 3 coins, a success bonus for it.

Referring to FIG. 22B, the BizMac request of A is delivered only to C and when the request is canceled, a total of 10 coins will be spent. Looking at the usage history, although the BizMac request failed, the intermediate forwarder B and C had to pay 10 coins by 5 coins because they completed the transfer request. On the other hand, since B and C have accepted the request for delivery, they earn BizMac coins by 3 coins, a success bonus for it.

Referring to FIG. 23, when A succeeds in requesting BizMac directly to E without passing through B, C, and D, a total of 30 coins will be spent. If you set No to BizMac Requests for Delivery Requests only in the profile's configuration, you can make BizMac requests directly without going through intermediate forwarders B, C, and D.

Referring to FIG. 24, when the mileage request is insufficient, the BizMac may be charged. If you have less than 25 coins and your mileage is less than 25 coins, when you try to request BizMac, it will show you how much coins are left as shown in (1) and induce a coin charge (e.g. You must have a BizMac Coin, go to Recharging BizMac Coin right now, please highlight BizMac Coin and try to request BizMac.), And click [Charge] indicated by (3) in the drawing. Click to go to the charging page. (2) in the drawing shows that if you set the BizMac request directly in the environment setting, if the coin remains below 30 coins, the message of (2) appears when you try to request the BizMac and click (3). Go to the following page.

Referring to FIG. 25, in order to increase a request success rate when requesting a BizMac, mileage may be paid to a forwarder and a member receiving a request. In this case, insufficient mileage may be charged. (1) of the figure provides a success bonus coin, which is a BizMac coin that the requester is willing to pay to the forwarder or the final requester when the BizMac request is successful. Success bonus coins can be used by the requestor to write down the amount of coins. (2) of the figure is a message that is output when there is a lack of success bonus coins, and when the charge button is clicked, it moves to a mileage charge page.

Fig. 26 is a process flow diagram relating to a group portion. You must be registered as a BizMac member to form a group. If you are not a BizMac member, join BizMac. Fill out the group creation form with the company name, representative, business field, and business registration number (262). By clicking the OK button, the group creation form is delivered to the administrator, and the group is finally created only after the BizMac administrator's authentication process (263). The administrator reviews the received group creation data and sends the mail after sending the approval. In the case of the approved group, the group manager may form a group page (264) and perform a function and activity as a group (265).

Referring to FIG. 27, when creating a group, the group logo and the manager group name are output on the home page of the administrator and the group member as shown in (1) and (2) of the figure. Clicking on the group name will take you to a page where you can view the group members. In addition, information on the BizMac request status, schedule management, today's schedule, work schedule, preferences, and mileage is displayed.

28 is a page that is moved when a group manager, a member clicks on a group logo, corporate advertising, you can check the entire list of members. (1) of the figure shows a corporate advertisement. When an administrator inquires about advertisements on BizMac, corporate advertisements are output in (1) of the drawing. (2) of the figure shows the members belonging to the group as a list. You can see them separately by count, and you can also see a list of all the members.

Referring to FIG. 29, when a user is registered as a group member, a search option within a group may be used when searching for a social network. When searching after checking [Search in group] indicated by (1) in the drawing, the member who meets the condition is drawn in the group. You can also see the group's logo on the list of derived members.

30 is a diagram illustrating a system environment for a network forming service. The server 31 providing the BizMac service is connected to a user terminal including a personal computer 38 or a mobile phone 29 through a wired or wireless network 37. The data used in the server 32 is stored in a database, and the profile picture or profile album is stored in the file server. The OS uses Linux (which can be changed based on Windows if necessary), the database uses MySQL (which can be changed to another database if necessary), and the web server uses Apache, SSL, PHP, C for Language. .

The server 31 receives a profile of a member who registers as a member and registers the member 33 in the database 32, and invites the member according to whether each member invites another member to accept the invitation. Networking unit (34) to form a network of relationships between other invited members, one member inputs the request with reference to the other member's profile to request the other member, and forwards the request from the requested member to the other member The request processing unit 36 determines the optimal path to perform based on the network relationship formed between the members and sends the request to the requested other member, and sends the response regarding the acceptance or cancellation of the request by the other requested member. ). Then, the search unit 36 searches for the corresponding information in the database 32 according to the search condition.

The invention can also be embodied as computer readable code on a computer readable recording medium. The computer-readable recording medium includes all kinds of recording devices in which data that can be read by a computer system is stored. Examples of computer-readable recording media include ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage, and the like, which are also implemented in the form of a carrier wave (for example, transmission over the Internet). It also includes. The computer readable recording medium can also be distributed over network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.

The best embodiments have been disclosed in the drawings and specification above. Although specific terms have been used herein, they are used only for the purpose of describing the present invention and are not used to limit the scope of the present invention as defined in the meaning or claims. Therefore, those skilled in the art will understand that various modifications and equivalent other embodiments are possible from this. Therefore, the true technical protection scope of the present invention will be defined by the technical spirit of the appended claims.

 According to the present invention, members who join and work individually through a server introduce friends or colleagues who were known online or offline to each other so that members can interact. It also helps me engage in active business activities by connecting with the professional staff I need for the business I didn't know.

In other words, through the server according to the present invention allows me to introduce people of whom I knew, as well as the range of contacts I knew. They can help you identify areas of your business that you haven't seen before and can help you improve and expand your business.

In order to achieve the above-mentioned activities, services must be provided based on trust between members, which enables partnerships and sales related to business, understanding of specific industries, and job search. In addition to individual career paths, the more you work in the business world, the more you gain efficiency and effectiveness, while also helping you increase your profile.

In addition, by setting up and managing individual personal information protection policies very strictly, network-based services are provided through trust between members and members, and as one of these efforts, various systems for various personal information protection policies are provided. . One of them is VeriSign International Certification Service, which is the basis of trust.It is a certificate provided by VeriSign, a trusted international certification authority, which encrypts and transfers a lot of data transferred between user and server in 128 bits. You can keep your information safe.

Claims (18)

Entering his profile while signing up as a member; Inviting each member to form a network relationship between the invited member and the invited other member according to whether the other member accepts the invitation; Requesting, by one member, from another member by inputting a request by referring to another member's profile; Determining an optimal path for delivering the request from the requested member to the requested other member based on a network relationship formed between the members and sending the request to the requested other member; And And the other requesting member sends an answer regarding the acceptance or cancellation of the request. The member of claim 1, wherein when the invited member accepts the invitation from the invited member, the invited member and the invited member form a mutual relationship with each other, and the member has a relationship with the other member. The network forming service method, characterized in that the inviting member and the two villages relationship is formed. The network forming service method of claim 2, wherein the member who is in a second village relationship with another invited member is formed with the first member. The method of claim 2, wherein the request is sent directly from the requested member to the requested other member when the requested member and the requested other member are in a village relationship. The method of claim 1, If the requested member is able to directly connect with the requested other member, the request is sent to the requested other member, When a request from the requested member to another requested member is transmitted through a third member, the request is sent to the forwarder. If the forwarder accepts the delivery request, an acceptance message is sent to the next forwarder, Networking service method characterized in that the request delivery process is terminated when the forwarder cancels the delivery request. The network of claim 1, wherein the requested other member checks the profile and network status of the requested member, writes an answer message regarding the acceptance or cancellation of the request, and sends an email to the requested member. Shaping service method. The method according to claim 1, wherein the request performance values of the members on the searched paths are searched after searching the paths through which the request can be transferred from the requested member to the requested other member based on the priority of the relationship between members. Networking service method, characterized in that to determine the priority for the searched paths by summing. The method according to claim 1, wherein the request result of each member is based on the number of requests made by each member, the number of requests made by each member, and the number of requests delivered by the members, based on the number of requests received by each member, Networking service method, characterized in that calculated by giving a weight to each of the cases. The method of claim 1, wherein in determining the priority of the searched paths, the smaller the number of delivering on each searched path, the higher the weighted value and the sum of the results calculated for each searched path. Networking service method, characterized in that reflected in. The method of claim 1, wherein in determining the priority of the searched paths, if the requested performance value of the member on the searched paths is lower than a predetermined reference value, the predetermined value is subtracted from the performance value of the corresponding member. Networking service method characterized in that the sum. The method of claim 1, further comprising paying for the request: If the requested member accepts the request sent to the requested other member, the requested member pays the predetermined fee, and if the requested member has an intermediate delivery step in the request sent to the requested other member, the additional fee is paid. And the intermediary forwarder is paid part of the fee. The method of claim 1, wherein the requested member and the forwarder are given a certain bonus mileage when the requesting member accepts the request or the forwarder who intermittently forwards the request to the requested member accepts the forwarding request. The bonus mileage can be settled at a cost required when the future request to others, the network forming service characterized in that. The method of claim 1, wherein a plurality of members form a group, and a search and payment of the member are performed on a group basis. Entering his profile while signing up as a member; Inviting each member to form a network relationship between the invited member and the invited other member according to whether the other member accepts the invitation; Requesting, by one member, from another member by inputting a request by referring to another member's profile; Search for routes through which the request can be forwarded from the requested member to the requested other member based on priorities of the contacts between the members, and then add up the requested performance values of the members on the discovered routes; Determining a priority for the paths; If the requested member can directly connect with the requested other member, directly sending the request of the requested other member; When the request from the requested member to the requested other member is transmitted through the third member, the request is transmitted to the intermediate forwarder, and if the intermediate forwarder accepts the forwarding request, an acceptance message is sent to the next forwarder. The request is sent to the other requested member when all of the intermediate forwarders accept the request; when the forwarder cancels the request for delivery, the request is terminated without being sent to the requested other member; Sending, by the requested other member, an answer regarding the acceptance or cancellation of the request; And The requesting member pays a predetermined fee if the request sent by the requesting member is accepted to the other requested member, and the delivery request fee is settled if there is an intermediate delivery step in the request sent by the requesting member to the requested other member. Network forming service method comprising the step of becoming. The method according to claim 14, wherein the request result of each member is based on the number of requests made by each member, the number of requests made by each member, and the number of requests delivered by the members, based on the number of requests made by each member. Networking service method, characterized in that calculated by giving a weight to each of the cases. Member registration unit for receiving and registering the profile of the person who is registered as a member; A network forming unit for forming a network relationship between the invited member and the invited other member according to whether each member invites another member to accept the invitation; One member inputs a request with reference to another member's profile and requests the other member, and the optimal path for transferring the request from the requested member to the requested other member is based on a network formed between the members. And a request processing unit for determining based on the request and sending the request to the requested other member, and sending a response regarding the acceptance or cancellation of the request by the requested other member. . 17. The member of claim 16, wherein when the other member invites the invited member from the invited member, the invited member and the other invited member form a mutual relationship with each other, and the member is in a village relationship with the other member. The network forming service device, characterized in that the inviting member and two villages relationship is formed. A computer-readable recording medium having recorded thereon a program for executing the method of claim 1 on a computer.

Images