# Applications of Small and Medium Enterprise Management System Using Edge Algorithm

Authors: Limei Huang
Journal: Mobile Information Systems
 (2021)

---

## Abstract

The traditional small and medium enterprise management system has a low efficiency of operation and management. A small and medium enterprise management system based on an edge algorithm is designed in this paper to address this problem. In the proposed algorithm, the management system is used for efficient information transmission and sharing. The system consists of a collaborative function layer, data service layer, basic environment layer, and application layer. The application layer realizes the storage and integration of enterprise information data through the regulation of the collaborative management center and realizes the privacy encryption protection of information based on the protection mechanism of edge computing. The information is transmitted to the data layer for classified storage through the network communication of the basic environment layer. The collaborative function layer takes the process management control engine combined with each service interface to complete the information retrieval of the data layer. It uses the algorithm based on the number of fusion common scoring users and information interest relationship to query and push information. The test results show that the system has good information query performance, pushing query information in one minute. The running function can meet the user needs and effectively achieve information privacy protection.


---

## Body

## 1. Introduction

A small- and medium-sized enterprise refers to an enterprise with a relatively small scale of personnel and operations. Small- and medium-sized enterprises are an important carrier of mass entrepreneurship and innovation. They play an irreplaceable role in increasing employment, promoting economic growth, scientific and technological innovation, social harmony, and stability. It has important strategic significance for national economic and social development. Different countries, different stages of economic development, and different industries will have certain differences in their definition standards, which will change with the dynamic development of the economy [1]. Countries generally define small- and medium-sized enterprises in terms of quality and quantity. The qualitative indicators mainly include the organizational form, financing mode, and industry status of the enterprise. In contrast, the quantitative indicators mainly include the number of employees, paid-in capital, and total assets. A management system is composed of a management process and method to achieve the goal of an enterprise through the deployment of interrelated management positions and personnel [2]. Enterprise management can adopt the method of systematic analysis and comprehensively study various professional management of enterprises. These combine the internal conditions and external environment of production and operation activities. It also works on quantitative analysis and qualitative analysis. It selects the optimal scheme to improve economic benefits and promote production development [3]. Enterprise management systems perform decision-making, planning, organization, leadership, monitoring, analysis, and so forth. They provide real-time, relevant, accurate, and complete data and provide a decision-making basis for managers and information sharing among various enterprise departments.Small and medium enterprises management was introduced in China long after its development in other countries. Other countries have received the concept of digital management relatively earlier, for example, extreme programming, Cockburn’s crystal series method, open-source, and other technologies. Therefore, the development of foreign enterprise management systems has become increasingly mature. Domestic large-scale enterprises also have a lot of discussions and implementation. However, a few successful developers with advanced large-scale application platforms and some successful developers only use foreign products for integration and transformation [4]. In China, the biggest obstacle to the management of small- and medium-sized enterprises is that the development cost is too high, and the training of users is not enough. As a result, the development of the system is easy to die prematurely, and the system cannot play its benefits. However, the domestic development of small-scale application systems is very successful, such as personnel and financial system, purchase, sales and inventory systems, and production management systems.Edge computing is an open platform that integrates the core capabilities of the network, computing, storage, and application to provide the nearest end services on the side close to the object or data source. Its application is initiated at the edge side, which produces a faster network service response. It meets the basic needs of enterprises in real-time business, application intelligence, security, and privacy protection. Edge computing is located between the physical entity and the industrial connection or at the top of the physical entity. In contrast, cloud computing can still access the historical data of edge computing [5]. They are combined with the current problems faced by the middle and lower enterprise management to ease the system management. The high integration of capital flow and information flow makes the enterprise decision-makers know the real data of their operation and sharing information. It improves the management efficiency and timely grasp of the partner’s information. Therefore, this paper designs a small- and medium-sized enterprise management system based on an edge algorithm. After the system’s function is studied, it is used in the actual enterprise management to improve the management efficiency of small- and medium-sized enterprises and enterprise information security.The rest of the paper is organized in accordance with the following pattern: in Section2, we discuss the enterprise management system using an edge algorithm; the analysis is performed in Section 3, and Section 4 concludes the paper.


## 2. Application of Small and Medium Enterprise Management System Using Edge Algorithm

In this section, we discuss the system architecture, applications, and collaborative function layers.


### 2.1. System Architecture

The construction of small and medium enterprise management systems based on edge algorithms needs to be analyzed from technology and management needs. The management needs to understand and use the management characteristics of small- and medium-sized enterprises. From the perspective of collaborative engineering and system engineering applicability of small- and medium-sized enterprises, its functional structure can be appropriately simplified and reorganized. It establishes a collaborative management center with core manufacturing enterprises, including collaborative planning, selection and management matching, information exchange, access control management, data security management, and other management systems [6]. The system can maintain the core idea of enterprise collaborative management and value chain management and enhance the applicability and operability of the integrated platform. The management system should be networked, intelligent, integrated, virtualized, and secure. Therefore, a small- and medium-sized enterprise management system based on an edge algorithm is designed. The system consists of a collaborative function layer, data service layer, basic environment layer, and application layer. Its architecture is shown in Figure 1.Figure 1
System architecture.


#### 2.1.1. Collaborative Function Layer

This layer is the top layer of the system, and it is also one of the core leading layers of system management. It includes four functional components: enterprise collaborative planning component, selection and matching component (supplier, cooperative plant, customer, etc.), information exchange component, and access control component. It is mainly used to realize information exchange and queries between internal departments of enterprises. The information exchange and query within certain authority between enterprises and suppliers, cooperative plants, customers, and other related parties [7].


#### 2.1.2. Data Service Layer

It is used to store all information of enterprises, and it is also a data information communication interface in a networked manufacturing environment. It includes information interface agents based on common object request broker architecture (CORBA), for example, customer service interface agent, planning interface agent, design interface agent, supply interface agent, production interface agent, inventory interface agent, and so forth. At the same time, the layer also deploys XML-based information interface agents. The information exchange interface agents, which are mainly used for information exchange between enterprises and related parties.


#### 2.1.3. Basic Environment Layer

The primary environment layer is based on a local area network (LAN), a virtual private network (VPN), and Internet/Extranet/Intranet. It adopts networked object distribution technology and realizes collaborative information exchange and integration among members based on XML technology. It adopts CORBA technology to implement the interoperability between heterogeneous systems through object request broker (ORB).


#### 2.1.4. Application Layer

The application layer is the bottom layer of the system, and it is also one of the core leading layers of system management. This layer realizes the processing of specific businesses through the control of the collaborative management center. The collaborative management center plays the role of information exchange and system integration center, the manager of public information, and the provider of the interface required for the access, interaction, and interoperability of the member’s application system and database [8].


### 2.2. Application Layer

The following section describes various components of application layers.


#### 2.2.1. Structure of Application Layer

The application layer is one of the core layers of the system, mainly used for the storage and integration of enterprise information data and stores the related information data of related parties, which is the basis of information exchange, query, and access. Therefore, it is imperative to ensure the security of the data in this layer. This layer takes edge computing as the core and sets up a privacy protection mechanism so that when each relational party implements information operation within the scope of authority, it cannot obtain the information of other relational methods [9]. This layer is mainly divided into three parts, namely, client, edge node, and service provider. Its structure is shown in Figure 2.(1)
Client: the main role is to complete the data request and data perception tasks, mainly through the mobile device GPS positioning, various sensors, cameras, and other data acquisition and applications(2)
Edge node: its main function is to complete the whole process of privacy protection through appropriate methods and mechanisms(3)
Service provider: its main function is to provide data aggregation and service request processing, respond to the data processed by edge nodes, and provide feedback resultsFigure 2
Application layer structure.Assuming that the coverage area of the edge node isS, the location privacy protection mechanism K can be generated by adding noise to protect the user’s privacy. The main goal is to realize that even if the attacker can know that the user is in a certain area, it cannot determine the real location. When users use location-based services or perform location-related operations, they submit the real location to the edge node and then implement the location privacy protection mechanism at the edge node [10]. Next, the edge node implements a location privacy protection mechanism for the query interest results (or other location-related applications) and filters the useless results according to the real location.


#### 2.2.2. Protection Mechanism Based on Edge Computing

The main idea of the geographical indiscernibility mechanism is that the real position isx0=R at any time. However, the reported position is randomly generated according to the noise function x=R. The main goal is to ensure that the attacker can only understand the user’s area but cannot infer the user’s real location from this area. Based on the concept of differential privacy, a formal definition of geographic indiscernibility is given. If the user’s real location in the region and any possible location in the region S are represented by l1 and l2, respectively, then when K only satisfies formulas (1) and (2), it is called geographic indiscernibility mechanism:(1)Pl0|l1≤eεdl1,l2Pl0|l2,(2)∀l1,l2:dl1,l2≤r.The above definition can be expressed asPl1D≤eεdl1,l2Pl2D, D∈D, D representing all data sets and dl1,l2 representing the distance between l1 and l2. The location to submit represents the meaning of the geographic indistinguishability mechanism because two locations l1,l2 generate the location l1,l2 to be submitted with the same probability. Based on the committed location l0, the probability that an attacker can distinguish which is the real location is not negligible [11]. A privacy protection mechanism is proposed to generate the noise location by adding Laplacian distribution noise through the above analysis. When the actual position is l1 and l2, the probability of a point in a certain region around l0 is only one multiplication factor eεdl1,l2. This property can be achieved by requiring that the probability of generating a point in the nearby region decreases exponentially with the distance from the actual location l1. In linear space, Laplace can satisfy this behavior. Laplace distribution with parameter b is recorded as Lapb, with density function Pz|b=1/2bexp−z/b and its variance is 2b2. Considering b=1/ε, the density function of the z point can be obtained proportionally. This distribution has the highest density at 0. For distributions that are not 0, they can be expressed as e−εz. For the distribution of multidimensional Laplace, it can be proved that dx,z is used instead of x,z.Considering the parameterε∈R+ and the actual position l1, the probability density function of the noise mechanism can be obtained. For any other reporting position l0, there is(3)Dεl1l0=ε22πe−εdl0,l1,where the normalization factor is ε2/2π and ε represents the privacy budget.The plane coordinate of the probability density function is determined only by distance, so it can be transformed into a coordinate system with the current positionl1x1,y1 as the origin. The position point l1x1,y1 is expressed as a point where the distance from the coordinate point θ is the angle of the line formed by two points relative to the horizontal axis of the Cartesian coordinate system [12]. According to the standard transformation formula (14), the polar coordinate transformation of Laplacian distribution with the origin as the center is as follows:(4)Dεr,θ=ε2r2πe−εr,where r is the distance from the real position l1 to the noisy position l0. Because the two random variables representing radius and angle are independent, polar coordinates have a very convenient property. Therefore, the probability density function can be expressed as the product of two sidelines [13]. Then, the formula of two random variables r,θ is(5)Dε,r=∫02πDεr,θdθ=ε2re−εr,Dε,θ=∫0∞Dεr,θdr=12π.Therefore,Dεr,θ=Dε,rDε,θ is obtained, assuming that the real location point is l1x1,y1, then by adding the location point following Laplacian distribution noise, it can be obtained:(6)l0=x1+rcosθ,y+rsinθ.By adding Laplacian noise, location privacy is protected. Because the radiusr and the angle are independent in polar coordinates, in order to get the point r,θ, it can be obtained from Dεr,θ, respectively.BecauseDε,θ is a constant, it is easy to get the value of the random distribution. In this paper, uniform distribution is used, which is randomly generated in the interval.The polar radiusr is obtained by the cumulative distribution function cdfC:(7)Cε−1=∫0rDε,rρdρ=1−1+εre−εr,where ρ is the threshold value and Cεr represents the radius of random probability point between 0 and r. Finally, a random number p and the probability interval of uniform distribution 0,1 are generated. If r=Cε−1 is set, it can get the following results:(8)Cε−1p=1εp−1e+1.In this way, the randomness of radius distribution can be realized. In different situations, users have different privacy requirements. For example, when people stay in places they often visit, such as home and office, they want to protect these sensitive places with a higher degree of privacy at the expense of service quality. However, when they are in a public area, it is unreasonable to sacrifice so much quality of service to protect their location privacy [14]. Therefore, a reasonable way is to adjust the privacy level and realize different levels of privacy protection in different scenarios. The privacy level is constrained by ε obtaining better service quality.


### 2.3. Collaborative Function Layer

#### 2.3.1. Structure of Collaborative Function Layer

In enterprise management, the operation of its business process is not limited to one enterprise, including the joint operation among all enterprises of the related parties. Therefore, collaborative management is the foundation of multiparty cooperation. The technical structure of the collaborative function layer is shown in Figure3.Figure 3
Technical structure of synergistic function layer.Workflow technology will reasonably organize all kinds of information resources inside and outside the enterprise, provide support for collaborative group work, and improve the operation efficiency of the enterprise. Therefore, workflow technology must be used to realize the coordination and monitoring of enterprise business processes. In order to meet the flexibility, availability, scalability, nesting of workflow management, and support for a dynamic application, the collaborative function layer takes the process management control engine to support the collaborative work between enterprise departments. It realizes the full process support for enterprise business process [15], mainly including process model definition, process management control engine, and global task collaborative monitoring service. It can realize the internal personnel information query, cross-department information exchange, cross-enterprise relationship information query, and information push.


#### 2.3.2. Information Push Based on the Fusion of the Number of Common Scoring Users and Information Interest Relationship

In the process of related information query operation between various departments and cross-enterprises, the system opens the information operation authority within its authority according to its identity information. In order to ensure that the query personnel can accurately query the information they need, the system can accurately push the information according to the query content. The collaborative function layer combines the common scoring user number and information interest relationship algorithm model. It introduces the knowledge of interest degree and calculates the similarity between information by establishing the interest degree vector between information [16]. The calculation process of the algorithm model can be roughly divided into three processes: ① establish the user’s direct interest in information according to the user’s input information content; ② establish the user’s indirect interest in information by combining the direct interest in information and the similarity between users; and ③ fuse the direct interest in information and the indirect interest in information to establish the information interest vector, calculate the similarity between information, and complete information push.Generally, the user information scoring matrix is am×n-dimension matrix, which is(9)R=R1,1R1,2R1,nR2,1R2,2R2,nRm.1Rm,2Rm,n,where the number of users, the number of information, and the score of user u on information i are expressed by m, n, and Ru,i, respectively.(1) Direct Interest in Information. The user’s score of information reflects the user’s liking for information. Therefore, it is feasible to use the user’s score of information to represent the direct interest of information [17]. If the score of the user u for information i is Ru,i, the direct interest degree of the user u for information II is as follows: (10)InDu,i=Ru,iRmax,where the maximum value of the system scoring range is expressed in Rmax.(2) Indirect Interest in Information. In collaborative filtering, there is a common problem of the sparsity of scoring data. It is not accurate to measure the similarity between information only by using the direct degree of interest between information. The indirect degree of interest between information also reflects the similarity between information to a certain extent. It can be simply considered that the user’s indirect score of information represents the user’s indirect interest in information [18]. The indirect score of the user υ to information i is defined as follows: if a user u has a rating on information i, the user υ does not store information i, but the user υ is similar to the user u; then it can be considered that the user υ has an indirect score on information i through a user u. The direct interest vector InD1,InD2,…,InDg of information is set as i, where g≤m,g∈Z, u∈1,2,…,g, and the similarity between the user υ and u is simυ,u; then, the indirect interest of the user υ to information i is (11)InDu,i=∑u=1gInDu∗simυ,u∑u=1gsimυ,u.The similaritysimυ,u between the user υ and u is calculated by cosine similarity.(3) Information Similarity. The user’s direct interest and indirect interest in information i constitute the information’s interest vector In−teresti=In1,i,In2,i,…,Inm,i. If the user u has a direct interest InDu,i in the information i, then Inu,i=InDu,i; otherwise, Inu,i=InIu,i. The information interest relation matrix is composed of information interest vector:(12)In=In1,1In1,2In1,nIn2,1In2,2In2,nInm,1Inm,2Inm,n.Then, the similarity between informationi and information j can be calculated by Pearson similarity:(13)sim2i,j=∑u=1mInu,i−In¯iInu,j−In¯j∑u=1mInu,i−In¯i2∑u=1mInu,i−In¯i2,where In¯i and In¯j represent the average interest degree of information i and j, respectively.In order to comprehensively consider the factors that affect the similarity calculation, the similarity between information is calculated from multiple perspectives. Based on the above analysis, this paper proposes a similarity calculation method that combines the number of users and information interest by weighted fittingsim1i,j and sim2i,j:(14)simi,j=λsim1i,j+1−λsim2i,j,where the weight factor is λ. In order to better adjust the weight between sim1i,j and sim2i,j and make the similarity calculation results more accurate, the adaptive balance factor model is proposed:(15)λ=sim12i,jsim12i,j+sim22i,j.It can be seen that the value range ofλ is 0,1. When λ is 0, sim2i,j is used to calculate the similarity between information; when λ is 1, sim1i,j is used to calculate the similarity between information. Using λ weight factors can achieve the effect of dynamic adjustment.


#### 2.3.3. Overall Implementation Process of the Algorithm

Input: user information rating matrix; output: information recommendation list.(1)
Calculate the similarity between items and the number of users jointly evaluated: according to the user-information scoring matrix, calculate the similarity weight between items and the number of users jointly evaluated. The calculation formulas are as follows:(16)wi,j=11+exp−Ru,i−Ru¯Ru,j−Ru¯,(17)simjcci,j=Ii∩IjIi∪Ij,wheresimjcci,j value range is 0,1. If the number of scoring users of the two messages is exactly the same, the value is 1; if the number of scoring users of the two messages is completely different, the value is 0.(2)
Calculation of information similarity: according to the similarity of information and the weight of the number of common scoring users, the similarity of information is calculated. The calculation formula is as follows:(18)sim1i,j=simjcci,j∗simAd−pcci,j.(3)
Calculation of information interest: the user-information scoring matrix is obtained using equations (11) and (12). The user’s direct interest and indirect interest in information are calculated, respectively [19]. The interest relation matrix In is established by fusing the information interest.(4)
Calculate information interest similarity: according to the information interest matrix, using equation (15), we calculate the information interest similarity sim2i,j.(5)
Fusion information similarity and interest similarity: calculate the adaptive balance factor according to formula (16) and use formula (14) to fuse information similarity and interest similarity simi,j.(6)
Find the nearest neighbor set (NNs) of the target information: according to the Top-n strategy, select thek information with the highest similarity to the target information to form a set [20]. It is regarded as the NNS of the target information.(7)
Scoring prediction: it predicts the user’s scoring of target information:(19)Pu,i=Ri¯+∑j∈NNSisimi,jRu,j−Rj¯∑j∈NNSisimi,j.(8)
Construction of recommendation list: according to the user’s prediction score of target information, select several information with the highest score to form a recommendation column and recommend it to the user.


## 2.1. System Architecture

The construction of small and medium enterprise management systems based on edge algorithms needs to be analyzed from technology and management needs. The management needs to understand and use the management characteristics of small- and medium-sized enterprises. From the perspective of collaborative engineering and system engineering applicability of small- and medium-sized enterprises, its functional structure can be appropriately simplified and reorganized. It establishes a collaborative management center with core manufacturing enterprises, including collaborative planning, selection and management matching, information exchange, access control management, data security management, and other management systems [6]. The system can maintain the core idea of enterprise collaborative management and value chain management and enhance the applicability and operability of the integrated platform. The management system should be networked, intelligent, integrated, virtualized, and secure. Therefore, a small- and medium-sized enterprise management system based on an edge algorithm is designed. The system consists of a collaborative function layer, data service layer, basic environment layer, and application layer. Its architecture is shown in Figure 1.Figure 1
System architecture.


### 2.1.1. Collaborative Function Layer

This layer is the top layer of the system, and it is also one of the core leading layers of system management. It includes four functional components: enterprise collaborative planning component, selection and matching component (supplier, cooperative plant, customer, etc.), information exchange component, and access control component. It is mainly used to realize information exchange and queries between internal departments of enterprises. The information exchange and query within certain authority between enterprises and suppliers, cooperative plants, customers, and other related parties [7].


### 2.1.2. Data Service Layer

It is used to store all information of enterprises, and it is also a data information communication interface in a networked manufacturing environment. It includes information interface agents based on common object request broker architecture (CORBA), for example, customer service interface agent, planning interface agent, design interface agent, supply interface agent, production interface agent, inventory interface agent, and so forth. At the same time, the layer also deploys XML-based information interface agents. The information exchange interface agents, which are mainly used for information exchange between enterprises and related parties.


### 2.1.3. Basic Environment Layer

The primary environment layer is based on a local area network (LAN), a virtual private network (VPN), and Internet/Extranet/Intranet. It adopts networked object distribution technology and realizes collaborative information exchange and integration among members based on XML technology. It adopts CORBA technology to implement the interoperability between heterogeneous systems through object request broker (ORB).


### 2.1.4. Application Layer

The application layer is the bottom layer of the system, and it is also one of the core leading layers of system management. This layer realizes the processing of specific businesses through the control of the collaborative management center. The collaborative management center plays the role of information exchange and system integration center, the manager of public information, and the provider of the interface required for the access, interaction, and interoperability of the member’s application system and database [8].


## 2.1.1. Collaborative Function Layer

This layer is the top layer of the system, and it is also one of the core leading layers of system management. It includes four functional components: enterprise collaborative planning component, selection and matching component (supplier, cooperative plant, customer, etc.), information exchange component, and access control component. It is mainly used to realize information exchange and queries between internal departments of enterprises. The information exchange and query within certain authority between enterprises and suppliers, cooperative plants, customers, and other related parties [7].


## 2.1.2. Data Service Layer

It is used to store all information of enterprises, and it is also a data information communication interface in a networked manufacturing environment. It includes information interface agents based on common object request broker architecture (CORBA), for example, customer service interface agent, planning interface agent, design interface agent, supply interface agent, production interface agent, inventory interface agent, and so forth. At the same time, the layer also deploys XML-based information interface agents. The information exchange interface agents, which are mainly used for information exchange between enterprises and related parties.


## 2.1.3. Basic Environment Layer

The primary environment layer is based on a local area network (LAN), a virtual private network (VPN), and Internet/Extranet/Intranet. It adopts networked object distribution technology and realizes collaborative information exchange and integration among members based on XML technology. It adopts CORBA technology to implement the interoperability between heterogeneous systems through object request broker (ORB).


## 2.1.4. Application Layer

The application layer is the bottom layer of the system, and it is also one of the core leading layers of system management. This layer realizes the processing of specific businesses through the control of the collaborative management center. The collaborative management center plays the role of information exchange and system integration center, the manager of public information, and the provider of the interface required for the access, interaction, and interoperability of the member’s application system and database [8].


## 2.2. Application Layer

The following section describes various components of application layers.


### 2.2.1. Structure of Application Layer

The application layer is one of the core layers of the system, mainly used for the storage and integration of enterprise information data and stores the related information data of related parties, which is the basis of information exchange, query, and access. Therefore, it is imperative to ensure the security of the data in this layer. This layer takes edge computing as the core and sets up a privacy protection mechanism so that when each relational party implements information operation within the scope of authority, it cannot obtain the information of other relational methods [9]. This layer is mainly divided into three parts, namely, client, edge node, and service provider. Its structure is shown in Figure 2.(1)
Client: the main role is to complete the data request and data perception tasks, mainly through the mobile device GPS positioning, various sensors, cameras, and other data acquisition and applications(2)
Edge node: its main function is to complete the whole process of privacy protection through appropriate methods and mechanisms(3)
Service provider: its main function is to provide data aggregation and service request processing, respond to the data processed by edge nodes, and provide feedback resultsFigure 2
Application layer structure.Assuming that the coverage area of the edge node isS, the location privacy protection mechanism K can be generated by adding noise to protect the user’s privacy. The main goal is to realize that even if the attacker can know that the user is in a certain area, it cannot determine the real location. When users use location-based services or perform location-related operations, they submit the real location to the edge node and then implement the location privacy protection mechanism at the edge node [10]. Next, the edge node implements a location privacy protection mechanism for the query interest results (or other location-related applications) and filters the useless results according to the real location.


### 2.2.2. Protection Mechanism Based on Edge Computing

The main idea of the geographical indiscernibility mechanism is that the real position isx0=R at any time. However, the reported position is randomly generated according to the noise function x=R. The main goal is to ensure that the attacker can only understand the user’s area but cannot infer the user’s real location from this area. Based on the concept of differential privacy, a formal definition of geographic indiscernibility is given. If the user’s real location in the region and any possible location in the region S are represented by l1 and l2, respectively, then when K only satisfies formulas (1) and (2), it is called geographic indiscernibility mechanism:(1)Pl0|l1≤eεdl1,l2Pl0|l2,(2)∀l1,l2:dl1,l2≤r.The above definition can be expressed asPl1D≤eεdl1,l2Pl2D, D∈D, D representing all data sets and dl1,l2 representing the distance between l1 and l2. The location to submit represents the meaning of the geographic indistinguishability mechanism because two locations l1,l2 generate the location l1,l2 to be submitted with the same probability. Based on the committed location l0, the probability that an attacker can distinguish which is the real location is not negligible [11]. A privacy protection mechanism is proposed to generate the noise location by adding Laplacian distribution noise through the above analysis. When the actual position is l1 and l2, the probability of a point in a certain region around l0 is only one multiplication factor eεdl1,l2. This property can be achieved by requiring that the probability of generating a point in the nearby region decreases exponentially with the distance from the actual location l1. In linear space, Laplace can satisfy this behavior. Laplace distribution with parameter b is recorded as Lapb, with density function Pz|b=1/2bexp−z/b and its variance is 2b2. Considering b=1/ε, the density function of the z point can be obtained proportionally. This distribution has the highest density at 0. For distributions that are not 0, they can be expressed as e−εz. For the distribution of multidimensional Laplace, it can be proved that dx,z is used instead of x,z.Considering the parameterε∈R+ and the actual position l1, the probability density function of the noise mechanism can be obtained. For any other reporting position l0, there is(3)Dεl1l0=ε22πe−εdl0,l1,where the normalization factor is ε2/2π and ε represents the privacy budget.The plane coordinate of the probability density function is determined only by distance, so it can be transformed into a coordinate system with the current positionl1x1,y1 as the origin. The position point l1x1,y1 is expressed as a point where the distance from the coordinate point θ is the angle of the line formed by two points relative to the horizontal axis of the Cartesian coordinate system [12]. According to the standard transformation formula (14), the polar coordinate transformation of Laplacian distribution with the origin as the center is as follows:(4)Dεr,θ=ε2r2πe−εr,where r is the distance from the real position l1 to the noisy position l0. Because the two random variables representing radius and angle are independent, polar coordinates have a very convenient property. Therefore, the probability density function can be expressed as the product of two sidelines [13]. Then, the formula of two random variables r,θ is(5)Dε,r=∫02πDεr,θdθ=ε2re−εr,Dε,θ=∫0∞Dεr,θdr=12π.Therefore,Dεr,θ=Dε,rDε,θ is obtained, assuming that the real location point is l1x1,y1, then by adding the location point following Laplacian distribution noise, it can be obtained:(6)l0=x1+rcosθ,y+rsinθ.By adding Laplacian noise, location privacy is protected. Because the radiusr and the angle are independent in polar coordinates, in order to get the point r,θ, it can be obtained from Dεr,θ, respectively.BecauseDε,θ is a constant, it is easy to get the value of the random distribution. In this paper, uniform distribution is used, which is randomly generated in the interval.The polar radiusr is obtained by the cumulative distribution function cdfC:(7)Cε−1=∫0rDε,rρdρ=1−1+εre−εr,where ρ is the threshold value and Cεr represents the radius of random probability point between 0 and r. Finally, a random number p and the probability interval of uniform distribution 0,1 are generated. If r=Cε−1 is set, it can get the following results:(8)Cε−1p=1εp−1e+1.In this way, the randomness of radius distribution can be realized. In different situations, users have different privacy requirements. For example, when people stay in places they often visit, such as home and office, they want to protect these sensitive places with a higher degree of privacy at the expense of service quality. However, when they are in a public area, it is unreasonable to sacrifice so much quality of service to protect their location privacy [14]. Therefore, a reasonable way is to adjust the privacy level and realize different levels of privacy protection in different scenarios. The privacy level is constrained by ε obtaining better service quality.


## 2.2.1. Structure of Application Layer

The application layer is one of the core layers of the system, mainly used for the storage and integration of enterprise information data and stores the related information data of related parties, which is the basis of information exchange, query, and access. Therefore, it is imperative to ensure the security of the data in this layer. This layer takes edge computing as the core and sets up a privacy protection mechanism so that when each relational party implements information operation within the scope of authority, it cannot obtain the information of other relational methods [9]. This layer is mainly divided into three parts, namely, client, edge node, and service provider. Its structure is shown in Figure 2.(1)
Client: the main role is to complete the data request and data perception tasks, mainly through the mobile device GPS positioning, various sensors, cameras, and other data acquisition and applications(2)
Edge node: its main function is to complete the whole process of privacy protection through appropriate methods and mechanisms(3)
Service provider: its main function is to provide data aggregation and service request processing, respond to the data processed by edge nodes, and provide feedback resultsFigure 2
Application layer structure.Assuming that the coverage area of the edge node isS, the location privacy protection mechanism K can be generated by adding noise to protect the user’s privacy. The main goal is to realize that even if the attacker can know that the user is in a certain area, it cannot determine the real location. When users use location-based services or perform location-related operations, they submit the real location to the edge node and then implement the location privacy protection mechanism at the edge node [10]. Next, the edge node implements a location privacy protection mechanism for the query interest results (or other location-related applications) and filters the useless results according to the real location.


## 2.2.2. Protection Mechanism Based on Edge Computing

The main idea of the geographical indiscernibility mechanism is that the real position isx0=R at any time. However, the reported position is randomly generated according to the noise function x=R. The main goal is to ensure that the attacker can only understand the user’s area but cannot infer the user’s real location from this area. Based on the concept of differential privacy, a formal definition of geographic indiscernibility is given. If the user’s real location in the region and any possible location in the region S are represented by l1 and l2, respectively, then when K only satisfies formulas (1) and (2), it is called geographic indiscernibility mechanism:(1)Pl0|l1≤eεdl1,l2Pl0|l2,(2)∀l1,l2:dl1,l2≤r.The above definition can be expressed asPl1D≤eεdl1,l2Pl2D, D∈D, D representing all data sets and dl1,l2 representing the distance between l1 and l2. The location to submit represents the meaning of the geographic indistinguishability mechanism because two locations l1,l2 generate the location l1,l2 to be submitted with the same probability. Based on the committed location l0, the probability that an attacker can distinguish which is the real location is not negligible [11]. A privacy protection mechanism is proposed to generate the noise location by adding Laplacian distribution noise through the above analysis. When the actual position is l1 and l2, the probability of a point in a certain region around l0 is only one multiplication factor eεdl1,l2. This property can be achieved by requiring that the probability of generating a point in the nearby region decreases exponentially with the distance from the actual location l1. In linear space, Laplace can satisfy this behavior. Laplace distribution with parameter b is recorded as Lapb, with density function Pz|b=1/2bexp−z/b and its variance is 2b2. Considering b=1/ε, the density function of the z point can be obtained proportionally. This distribution has the highest density at 0. For distributions that are not 0, they can be expressed as e−εz. For the distribution of multidimensional Laplace, it can be proved that dx,z is used instead of x,z.Considering the parameterε∈R+ and the actual position l1, the probability density function of the noise mechanism can be obtained. For any other reporting position l0, there is(3)Dεl1l0=ε22πe−εdl0,l1,where the normalization factor is ε2/2π and ε represents the privacy budget.The plane coordinate of the probability density function is determined only by distance, so it can be transformed into a coordinate system with the current positionl1x1,y1 as the origin. The position point l1x1,y1 is expressed as a point where the distance from the coordinate point θ is the angle of the line formed by two points relative to the horizontal axis of the Cartesian coordinate system [12]. According to the standard transformation formula (14), the polar coordinate transformation of Laplacian distribution with the origin as the center is as follows:(4)Dεr,θ=ε2r2πe−εr,where r is the distance from the real position l1 to the noisy position l0. Because the two random variables representing radius and angle are independent, polar coordinates have a very convenient property. Therefore, the probability density function can be expressed as the product of two sidelines [13]. Then, the formula of two random variables r,θ is(5)Dε,r=∫02πDεr,θdθ=ε2re−εr,Dε,θ=∫0∞Dεr,θdr=12π.Therefore,Dεr,θ=Dε,rDε,θ is obtained, assuming that the real location point is l1x1,y1, then by adding the location point following Laplacian distribution noise, it can be obtained:(6)l0=x1+rcosθ,y+rsinθ.By adding Laplacian noise, location privacy is protected. Because the radiusr and the angle are independent in polar coordinates, in order to get the point r,θ, it can be obtained from Dεr,θ, respectively.BecauseDε,θ is a constant, it is easy to get the value of the random distribution. In this paper, uniform distribution is used, which is randomly generated in the interval.The polar radiusr is obtained by the cumulative distribution function cdfC:(7)Cε−1=∫0rDε,rρdρ=1−1+εre−εr,where ρ is the threshold value and Cεr represents the radius of random probability point between 0 and r. Finally, a random number p and the probability interval of uniform distribution 0,1 are generated. If r=Cε−1 is set, it can get the following results:(8)Cε−1p=1εp−1e+1.In this way, the randomness of radius distribution can be realized. In different situations, users have different privacy requirements. For example, when people stay in places they often visit, such as home and office, they want to protect these sensitive places with a higher degree of privacy at the expense of service quality. However, when they are in a public area, it is unreasonable to sacrifice so much quality of service to protect their location privacy [14]. Therefore, a reasonable way is to adjust the privacy level and realize different levels of privacy protection in different scenarios. The privacy level is constrained by ε obtaining better service quality.


## 2.3. Collaborative Function Layer

### 2.3.1. Structure of Collaborative Function Layer

In enterprise management, the operation of its business process is not limited to one enterprise, including the joint operation among all enterprises of the related parties. Therefore, collaborative management is the foundation of multiparty cooperation. The technical structure of the collaborative function layer is shown in Figure3.Figure 3
Technical structure of synergistic function layer.Workflow technology will reasonably organize all kinds of information resources inside and outside the enterprise, provide support for collaborative group work, and improve the operation efficiency of the enterprise. Therefore, workflow technology must be used to realize the coordination and monitoring of enterprise business processes. In order to meet the flexibility, availability, scalability, nesting of workflow management, and support for a dynamic application, the collaborative function layer takes the process management control engine to support the collaborative work between enterprise departments. It realizes the full process support for enterprise business process [15], mainly including process model definition, process management control engine, and global task collaborative monitoring service. It can realize the internal personnel information query, cross-department information exchange, cross-enterprise relationship information query, and information push.


### 2.3.2. Information Push Based on the Fusion of the Number of Common Scoring Users and Information Interest Relationship

In the process of related information query operation between various departments and cross-enterprises, the system opens the information operation authority within its authority according to its identity information. In order to ensure that the query personnel can accurately query the information they need, the system can accurately push the information according to the query content. The collaborative function layer combines the common scoring user number and information interest relationship algorithm model. It introduces the knowledge of interest degree and calculates the similarity between information by establishing the interest degree vector between information [16]. The calculation process of the algorithm model can be roughly divided into three processes: ① establish the user’s direct interest in information according to the user’s input information content; ② establish the user’s indirect interest in information by combining the direct interest in information and the similarity between users; and ③ fuse the direct interest in information and the indirect interest in information to establish the information interest vector, calculate the similarity between information, and complete information push.Generally, the user information scoring matrix is am×n-dimension matrix, which is(9)R=R1,1R1,2R1,nR2,1R2,2R2,nRm.1Rm,2Rm,n,where the number of users, the number of information, and the score of user u on information i are expressed by m, n, and Ru,i, respectively.(1) Direct Interest in Information. The user’s score of information reflects the user’s liking for information. Therefore, it is feasible to use the user’s score of information to represent the direct interest of information [17]. If the score of the user u for information i is Ru,i, the direct interest degree of the user u for information II is as follows: (10)InDu,i=Ru,iRmax,where the maximum value of the system scoring range is expressed in Rmax.(2) Indirect Interest in Information. In collaborative filtering, there is a common problem of the sparsity of scoring data. It is not accurate to measure the similarity between information only by using the direct degree of interest between information. The indirect degree of interest between information also reflects the similarity between information to a certain extent. It can be simply considered that the user’s indirect score of information represents the user’s indirect interest in information [18]. The indirect score of the user υ to information i is defined as follows: if a user u has a rating on information i, the user υ does not store information i, but the user υ is similar to the user u; then it can be considered that the user υ has an indirect score on information i through a user u. The direct interest vector InD1,InD2,…,InDg of information is set as i, where g≤m,g∈Z, u∈1,2,…,g, and the similarity between the user υ and u is simυ,u; then, the indirect interest of the user υ to information i is (11)InDu,i=∑u=1gInDu∗simυ,u∑u=1gsimυ,u.The similaritysimυ,u between the user υ and u is calculated by cosine similarity.(3) Information Similarity. The user’s direct interest and indirect interest in information i constitute the information’s interest vector In−teresti=In1,i,In2,i,…,Inm,i. If the user u has a direct interest InDu,i in the information i, then Inu,i=InDu,i; otherwise, Inu,i=InIu,i. The information interest relation matrix is composed of information interest vector:(12)In=In1,1In1,2In1,nIn2,1In2,2In2,nInm,1Inm,2Inm,n.Then, the similarity between informationi and information j can be calculated by Pearson similarity:(13)sim2i,j=∑u=1mInu,i−In¯iInu,j−In¯j∑u=1mInu,i−In¯i2∑u=1mInu,i−In¯i2,where In¯i and In¯j represent the average interest degree of information i and j, respectively.In order to comprehensively consider the factors that affect the similarity calculation, the similarity between information is calculated from multiple perspectives. Based on the above analysis, this paper proposes a similarity calculation method that combines the number of users and information interest by weighted fittingsim1i,j and sim2i,j:(14)simi,j=λsim1i,j+1−λsim2i,j,where the weight factor is λ. In order to better adjust the weight between sim1i,j and sim2i,j and make the similarity calculation results more accurate, the adaptive balance factor model is proposed:(15)λ=sim12i,jsim12i,j+sim22i,j.It can be seen that the value range ofλ is 0,1. When λ is 0, sim2i,j is used to calculate the similarity between information; when λ is 1, sim1i,j is used to calculate the similarity between information. Using λ weight factors can achieve the effect of dynamic adjustment.


### 2.3.3. Overall Implementation Process of the Algorithm

Input: user information rating matrix; output: information recommendation list.(1)
Calculate the similarity between items and the number of users jointly evaluated: according to the user-information scoring matrix, calculate the similarity weight between items and the number of users jointly evaluated. The calculation formulas are as follows:(16)wi,j=11+exp−Ru,i−Ru¯Ru,j−Ru¯,(17)simjcci,j=Ii∩IjIi∪Ij,wheresimjcci,j value range is 0,1. If the number of scoring users of the two messages is exactly the same, the value is 1; if the number of scoring users of the two messages is completely different, the value is 0.(2)
Calculation of information similarity: according to the similarity of information and the weight of the number of common scoring users, the similarity of information is calculated. The calculation formula is as follows:(18)sim1i,j=simjcci,j∗simAd−pcci,j.(3)
Calculation of information interest: the user-information scoring matrix is obtained using equations (11) and (12). The user’s direct interest and indirect interest in information are calculated, respectively [19]. The interest relation matrix In is established by fusing the information interest.(4)
Calculate information interest similarity: according to the information interest matrix, using equation (15), we calculate the information interest similarity sim2i,j.(5)
Fusion information similarity and interest similarity: calculate the adaptive balance factor according to formula (16) and use formula (14) to fuse information similarity and interest similarity simi,j.(6)
Find the nearest neighbor set (NNs) of the target information: according to the Top-n strategy, select thek information with the highest similarity to the target information to form a set [20]. It is regarded as the NNS of the target information.(7)
Scoring prediction: it predicts the user’s scoring of target information:(19)Pu,i=Ri¯+∑j∈NNSisimi,jRu,j−Rj¯∑j∈NNSisimi,j.(8)
Construction of recommendation list: according to the user’s prediction score of target information, select several information with the highest score to form a recommendation column and recommend it to the user.


## 2.3.1. Structure of Collaborative Function Layer

In enterprise management, the operation of its business process is not limited to one enterprise, including the joint operation among all enterprises of the related parties. Therefore, collaborative management is the foundation of multiparty cooperation. The technical structure of the collaborative function layer is shown in Figure3.Figure 3
Technical structure of synergistic function layer.Workflow technology will reasonably organize all kinds of information resources inside and outside the enterprise, provide support for collaborative group work, and improve the operation efficiency of the enterprise. Therefore, workflow technology must be used to realize the coordination and monitoring of enterprise business processes. In order to meet the flexibility, availability, scalability, nesting of workflow management, and support for a dynamic application, the collaborative function layer takes the process management control engine to support the collaborative work between enterprise departments. It realizes the full process support for enterprise business process [15], mainly including process model definition, process management control engine, and global task collaborative monitoring service. It can realize the internal personnel information query, cross-department information exchange, cross-enterprise relationship information query, and information push.


## 2.3.2. Information Push Based on the Fusion of the Number of Common Scoring Users and Information Interest Relationship

In the process of related information query operation between various departments and cross-enterprises, the system opens the information operation authority within its authority according to its identity information. In order to ensure that the query personnel can accurately query the information they need, the system can accurately push the information according to the query content. The collaborative function layer combines the common scoring user number and information interest relationship algorithm model. It introduces the knowledge of interest degree and calculates the similarity between information by establishing the interest degree vector between information [16]. The calculation process of the algorithm model can be roughly divided into three processes: ① establish the user’s direct interest in information according to the user’s input information content; ② establish the user’s indirect interest in information by combining the direct interest in information and the similarity between users; and ③ fuse the direct interest in information and the indirect interest in information to establish the information interest vector, calculate the similarity between information, and complete information push.Generally, the user information scoring matrix is am×n-dimension matrix, which is(9)R=R1,1R1,2R1,nR2,1R2,2R2,nRm.1Rm,2Rm,n,where the number of users, the number of information, and the score of user u on information i are expressed by m, n, and Ru,i, respectively.(1) Direct Interest in Information. The user’s score of information reflects the user’s liking for information. Therefore, it is feasible to use the user’s score of information to represent the direct interest of information [17]. If the score of the user u for information i is Ru,i, the direct interest degree of the user u for information II is as follows: (10)InDu,i=Ru,iRmax,where the maximum value of the system scoring range is expressed in Rmax.(2) Indirect Interest in Information. In collaborative filtering, there is a common problem of the sparsity of scoring data. It is not accurate to measure the similarity between information only by using the direct degree of interest between information. The indirect degree of interest between information also reflects the similarity between information to a certain extent. It can be simply considered that the user’s indirect score of information represents the user’s indirect interest in information [18]. The indirect score of the user υ to information i is defined as follows: if a user u has a rating on information i, the user υ does not store information i, but the user υ is similar to the user u; then it can be considered that the user υ has an indirect score on information i through a user u. The direct interest vector InD1,InD2,…,InDg of information is set as i, where g≤m,g∈Z, u∈1,2,…,g, and the similarity between the user υ and u is simυ,u; then, the indirect interest of the user υ to information i is (11)InDu,i=∑u=1gInDu∗simυ,u∑u=1gsimυ,u.The similaritysimυ,u between the user υ and u is calculated by cosine similarity.(3) Information Similarity. The user’s direct interest and indirect interest in information i constitute the information’s interest vector In−teresti=In1,i,In2,i,…,Inm,i. If the user u has a direct interest InDu,i in the information i, then Inu,i=InDu,i; otherwise, Inu,i=InIu,i. The information interest relation matrix is composed of information interest vector:(12)In=In1,1In1,2In1,nIn2,1In2,2In2,nInm,1Inm,2Inm,n.Then, the similarity between informationi and information j can be calculated by Pearson similarity:(13)sim2i,j=∑u=1mInu,i−In¯iInu,j−In¯j∑u=1mInu,i−In¯i2∑u=1mInu,i−In¯i2,where In¯i and In¯j represent the average interest degree of information i and j, respectively.In order to comprehensively consider the factors that affect the similarity calculation, the similarity between information is calculated from multiple perspectives. Based on the above analysis, this paper proposes a similarity calculation method that combines the number of users and information interest by weighted fittingsim1i,j and sim2i,j:(14)simi,j=λsim1i,j+1−λsim2i,j,where the weight factor is λ. In order to better adjust the weight between sim1i,j and sim2i,j and make the similarity calculation results more accurate, the adaptive balance factor model is proposed:(15)λ=sim12i,jsim12i,j+sim22i,j.It can be seen that the value range ofλ is 0,1. When λ is 0, sim2i,j is used to calculate the similarity between information; when λ is 1, sim1i,j is used to calculate the similarity between information. Using λ weight factors can achieve the effect of dynamic adjustment.


## 2.3.3. Overall Implementation Process of the Algorithm

Input: user information rating matrix; output: information recommendation list.(1)
Calculate the similarity between items and the number of users jointly evaluated: according to the user-information scoring matrix, calculate the similarity weight between items and the number of users jointly evaluated. The calculation formulas are as follows:(16)wi,j=11+exp−Ru,i−Ru¯Ru,j−Ru¯,(17)simjcci,j=Ii∩IjIi∪Ij,wheresimjcci,j value range is 0,1. If the number of scoring users of the two messages is exactly the same, the value is 1; if the number of scoring users of the two messages is completely different, the value is 0.(2)
Calculation of information similarity: according to the similarity of information and the weight of the number of common scoring users, the similarity of information is calculated. The calculation formula is as follows:(18)sim1i,j=simjcci,j∗simAd−pcci,j.(3)
Calculation of information interest: the user-information scoring matrix is obtained using equations (11) and (12). The user’s direct interest and indirect interest in information are calculated, respectively [19]. The interest relation matrix In is established by fusing the information interest.(4)
Calculate information interest similarity: according to the information interest matrix, using equation (15), we calculate the information interest similarity sim2i,j.(5)
Fusion information similarity and interest similarity: calculate the adaptive balance factor according to formula (16) and use formula (14) to fuse information similarity and interest similarity simi,j.(6)
Find the nearest neighbor set (NNs) of the target information: according to the Top-n strategy, select thek information with the highest similarity to the target information to form a set [20]. It is regarded as the NNS of the target information.(7)
Scoring prediction: it predicts the user’s scoring of target information:(19)Pu,i=Ri¯+∑j∈NNSisimi,jRu,j−Rj¯∑j∈NNSisimi,j.(8)
Construction of recommendation list: according to the user’s prediction score of target information, select several information with the highest score to form a recommendation column and recommend it to the user.


## 3. Results Analysis

In order to test the management effect and application performance of the system, a medium-sized enterprise in a construction industry is taken as the research object. The enterprise has been established for seven years. It has five departments: the general management department, marketing department, finance department, technology department, and logistics department. There are a total of 246 employees, with annual sales of 38.8 million, and a total of 6 cooperative enterprises. Before the enterprise used the system in this paper, all the information in the enterprise is retrieved and sent by the logistics department.The experimental environment is a ThinkCentre PC with a 64-bit Windows 7 operating system, 4-core 3.4 GHz Core i7 processor, and 16 GB memory. The performance of the system is tested to determine whether the system can meet the needs of users. The test results are shown in Table1.Table 1
System function test results.
Testing capabilitiesThe test contentThe test resultsThe login functionWhen the user logs in successfully, whether the role of the user can be verified and whether there is a prompt when the user’s name and password are incomplete or incorrect.YesInput functionEnterprise employee information, department management information, and other information input function, whether normal, and input error whether the system will prompt.YesQuery functionWhether various query conditions can correctly complete the query function, whether the query results can be displayed correctly, and whether there is a prompt for the data not queried.YesPush functionAfter the information query, whether the system can complete the relevant information push.YesPrivacy featuresWhether the system will prompt and refuse access when the user queries the information that is not within the authority.YesDelete functionWhether the function of other modules of the system will be affected after the deletion of data.NoStorage capabilitiesWhether the input information can be completely saved.YesAccording to the test results in Table1, it can be seen that the system can meet the normal requirements of users: a complete normal login, information input, query, push, privacy protection, information deletion, and information storage functions. It ensures the normal operation of all functions. When the system implements information security and privacy protection, the value of the difference parameter k and privacy parameter ε in the data set has a certain influence on the security protection. When the two parameters are taken differently, the information security degree is tested. The results are shown in Figures 4 and 5.Figure 4
Safety degree test results of different values ofk.Figure 5
Information security degree of different privacy budget values.According to the test results of Figures4 and 5, the information security degree also changes with the different values of the parameter k. It is showing an irregular floating pattern of up-down-up and down. When the value is 9, the information security degree is the highest; with the increase, the information security degree first increases and decreases. When the value is 11, the information security degree is the best, so the values of the two parameters are 9 and 11, respectively, and they are used in all subsequent tests.In order to test the enterprise’s information query performance of the system by testing the query selection performance of the system in different quantities, the query selection performance of the system in this paper is shown in Figure6. It refers to the percentage of all probability numbers meeting the query conditions in the total number. The calculation formula is as follows:(20)RE=QDt−QDt′maxQDt,γ,where the relative error, the result of querying the original data set, and the result of querying the published data set are represented by RE, QDt, and QDt′, respectively, and γ is the threshold.Figure 6
Test results of query selection performance of the system.According to the test results in Figure6, the relative error is gradually increasing with the increase of the amount of query data. However, when the data is 15 GB, the relative error is still less than 0.3%, indicating that the system has good information query performance. It can ensure the user’s query demand for the required information. In order to judge the privacy, make statistics of the degree of information privacy of the system when different concurrent users query the same partner information within the same no longer authorized scope. It implements a cross authority query on the partner quotation information of the experimental object in the third quarter of 2019. The results are shown in Figure 7.Figure 7
Results of privacy degree test.According to the test results in Figure7, with the increase of concurrent users, there is no impact on the privacy and security of the system; the detailed content of quotation information cannot be viewed without authority authentication. The increase of users does not reduce the degree of privacy and security, and the degree of information query is less than 0.06%. It shows that the security and privacy mechanism of the system in this paper has good performance, which can greatly protect the information privacy beyond the scope of the query authority.After testing the information query, the system will complete the push of relevant query information. The average absolute error widely used in the evaluation of collaborative methods is used to measure the accuracy of the system information push score. The test results are shown in Figure8. The average absolute error is calculated as follows:(21)MAE=∑u,i∈testPu,i−Ru,iNtest,where the predicted score and real score of user u for information i are, respectively, expressed by Pu,i and Ru,i and the total score of query information set is expressed by Ntest. The quality of information push increases with the decrease of MAE value, and the system requirement standard is MAE value within 1.Figure 8
Test results pushed by system information.According to the test results in Figure8, with the increase of data, the MAE value of system information push has been floating in the range of 0.29–0.45, with a small floating degree. When the data volume is 15 GB, the MAE value is 0.38, which all meet the requirements. The results show that the system can push user information accurately, and the quality of the information is high.In order to test the application effect of the system in small- and medium-sized enterprises, the efficiency improvement of the partners in the related cooperation, for example, in accounting and other information queries within one year before and after the application of the system is tested. The results are shown in Figure9.Figure 9
Query efficiency test results.According to the test results in Figure9, before applying this system, due to the traditional manual implementation of information retrieval and mail transmission, the efficiency is slow and time-consuming, and the information retrieved may be incomplete. After applying the system in this paper, there is no need for personnel to retrieve and transmit information, whether it is the time information retrieval of various departments within the enterprise of the information viewing of partners. After logging into the system and passing the authentication, the information within the scope of authority can be entirely and timely queried, and the efficiency is significantly improved. When the amount of timely query information is 150 GB, all information can be queried within 1 minute. It shows that the application of the system is high and meets the needs of small- and medium-sized enterprises.


## 4. Conclusion

In the current competitive market, the demand of small- and medium-sized enterprises for collaborative information management is quite different. The purpose of enterprise informatization is to realize the personalization, networking, popularization, digitization, globalization, and marketization of small- and medium-sized enterprises. It aims to promote significantly the development and utilization of information resources and information technology to improve the quality of customer service and social productivity. This research discusses the management and daily operation characteristics of small- and medium-sized enterprises. It takes small- and medium-sized enterprises as an example to realize the purpose of improving the information utilization efficiency and management level, accelerating the speed of information transmission and sharing, and implementing relevant tests. The results show that the proposed system can accelerate information transmission and sharing speed and has a good privacy protection function for the information within the scope of nonauthority.With the deepening of attention to enterprise applications, our next research task is mainly intelligent enterprise business flow management; that is, when some business flow changes, the program can dynamically reorganize the business flow management part and introduce data warehouse technology and data mining technology into the system to adapt to the continuous improvement of system requirements.



---

*Source: 8730413-2021-06-07.xml*