Search

The widespread application of blockchain technology and artificial intelligence in the field of accounting will replace many manual tasks, which will have a great impact on the training of accounting professionals in colleges and universities, mainly focused on training skilled personnel. Therefore, it is of great significance to study the impact of blockchain and artificial intelligence on the accounting professionals in universities and their corresponding ability structure. Defining the application stage of artificial intelligence and blockchain in the field of finance and accounting from the perspective of technology implementation, we can clarify the functional characteristics of artificial intelligence and blockchain in this field; By analyzing the development process of artificial intelligence and blockchain in the field of finance and accounting with non-technical factors, it can be judged that it has an achievable development stage. And on this basis, the author put forward specific suggestions for the ability structure training of future accounting professionals.

In view of the information loss problem caused by image compression, data packet loss and other reasons during X-ray nondestructive testing, we proposed a novel dense residual network to further improve the quality of steel cord conveyor belt X-ray images reconstruction. Compared with previous works, the special connections provide multiple short paths for the forward propagation to improve reconstruction accuracy and for the backward propagation of gradient flow to accelerate the convergence speed. Extensive experiments confirm the effectiveness of our dense residual connections. Both subjective visual effect and objective quantitative evaluation are better than bicubic interpolation and super-resolution convolutional neural network (SRCNN). Especially for execution time, our method only takes 0.142s and it is fast enough for real-time application. Moreover, our method can be extended to natural images reconstruction.

With the rapid development of hospital information technologies, more and more hospitals build electronic medical record (EMR) systems, which provides a comprehensive source for medical data mining and analysis. Most current EMR systems adopt a mixed structure. On the other hand, most data mining algorithms are designed for highly structured data. In this paper, we study the problem of interesting association rule mining on unstructured EMR data. We first analyze characteristics of unstructured EMR data by analyzing real in-patient department EMR of chronic occupational disease from a major hospital in Qingdao, and then put forward a novel association rule mining algorithm, called Un-Apriori, based on Apriori. Un-Apriori adopts a two-step preprocessing procedure for the original EMR data to resolve problems induced by the unstructured EMR data and satisfy specific requirement of Apriori algorithm. Taking asbestosis, a typical chronic occupational disease, as example we evaluate performance of the proposed Un-Apriori algorithm. Two types of experiments are implemented on the Hadoop platform, results and corresponding analysis are also provided. Experiments show that it is feasible and effective to apply data mining algorithms to discover latent association relationships or patterns hidden in unstructured EMRs so long as the reprocessing method is appropriate. Achievements obtained in this paper also provide valuable assistance decision supports for personalized therapeutic regimens and daily health managements of asbestosis patients.

This paper proposes a secure retrieval scheme based on homomorphic encryption for the server-side structured database. With the advantage of this scheme, ciphertext in server under unreliable storage circumstance can be efficiently retrieved without exposition of plaintext. Users can also have detailed access to their data. In this paper, a data encryption and decryption algorithm based on homomorphic encryption is proposed for character data in database. Server can calculate and operate the ciphertext data directly. An equivalent retrieval algorithm based on homomorphic encryption is proposed for equivalent retrieval of ciphertext data, which can effectively reduce the amount of data returned to the client and improve the retrieval efficiency. A counting joint index generation algorithm with upper limit based on dual encoding function is proposed for fuzzy retrieve of character data which can improve the efficiency of the server's filtering of the irrelevant data and reduce the waste of time and space.

As market competition intensifies, the logistics part is being a new profit growth point, and it is critical for businesses to select the appropriate logistics service providers. Existing logistics service provider selection method is too subjective and evaluation index is not comprehensive. On the basis of considering the impact factors to logistics service providers selected evaluation, this paper established a logistics service provider selection evaluation system, then it applied rough set theory to reduce attribute and extract the core factors. It used information entropy to determine index objectivity weight and establishing to evaluate logistics service providers. The evaluation results improved the objectivity and accuracy.

For knots spaced uniformly, the B-spline interpolation can be represented by an interpolator with a B-spline filter. In this paper, a B-spline filter bank is designed to describe the nonuniform B-spline interpolation. Signals considered here are those that can be split into several uniform subsequences by decimation. The decimated signals are then interpolated by the uniform B-spline functions to recover signals. However, aliasing cannot be eliminated through direct interpolation on the decimated subsequence. By using a bank of multilevel filters, aliasing can be removed to obtain that nonuniform B-spline interpolation is carried out by uniform B-spline interpolation.

On-line damages detection of mine conveyor belt is developed by using machine vision technology. By analyzing the feature of images collected by the CCD camera for the Mine Conveyer Belt, an algorithm of JPEG encoding based on linear difference is proposed for compressing and transmission, which solves the problem of high efficiency and real-time transmission of image data. A method based on the parameter test is proposed in the algorithm for transmission error control. The algorithm can effectively reduce the amount of data transmission, and can ensure the real-time performance of the network, which has important application value in the detection system based on machine vision.

Traditional guidance laws are designed based on Lyapunov theorem. They will guide the line of sight (LOS) angular rate to converge to zero when time approaches infinity. In this paper, guidance laws with finite time convergence are proposed in terms of finite time stability theory of nonlinear control systems. It is proved that the LOS angular rate will converge to zero before the final guidance ends with the designed guidance laws. Simulation results show that the guidance laws are highly effective.

Electronic Patient Record (EPR) is the start of medical treatment information and the core of a Hospital Information System (HIS). First, the data flow at a hospital is presented. Then, based on B/S system architecture, a three-layer EPR management system is presented. Case history database stores and manages EPR data. The middle layer consists of application server and Web server where transaction logics are realized. At the client layer, the system can be navigated with a browser by different users. And then, the development of the server is discussed in detail. Its expandable, maintainable and secure B/S system architecture is cost-effective and is developed with Eclipse platform. The server is developed with the components registered in the Struts-config.xml file. At the client, JSP pages are created with Dreamweaver. The prototype system is tested by test run and its correctness is validated.

In this paper, a differential clonal selection algorithm (DCSA) combined with an adaptive penalty function method is proposed for solving constrained optimization problems. In order to improve the diversity of the solution, a minority part of the antibodies located in sparse region are selected to do proportional cloning according to their minimum neighbor distance values. Comparison is made to four state-of-the-art algorithms in solving eleven well-known standard test problems. Simulation results show that DCSA performs better or similarly than the four approaches.

In this paper, a novel immune algorithm with dynamic memetic Cauchy mutation (DMCMIA) for multi-objective optimization is proposed. The idea of memetics is incorporated into the mutation process and a dynamic memetic Cauchy mutation (DMCM) operator is developed. The DMCM operator combines global exploration and local refinement efficiently, which adopts a generation-dependent parameter to guarantee a good balance between global search and local search. Comparison is made to another multi-objective optimization algorithm, nondominated neighbor immune algorithm, termed as NNIA, in solving five ZDT and five DTLZ standard test problems. Simulation results based on coverage of two set, convergence metric and spacing show that DMCMIA performs better than NNIA in generating approximations to the true Pareto front. In addition, the effectiveness of the novel dynamic memetic Cauchy mutation is verified by comparison to polynomial mutation and Gaussian mutation, the experimental results reinforce the advantage of the DMCM operator.

With the increasing of market competition, human dispatching service can reduce enterprise's human resources cost. But asymmetric information among principal, dispatching agency and dispatched workers may cause moral hazard of dispatching agency and dispatched workers. This paper considers moral hazard under asymmetric information. It researches the maximum problem of principal's profit under the incentive compatibility constraints of considering dispatching agency and dispatched workers. Through model analysis it commissioned that principal can adjust the incentive coefficient in order to better motivate dispatching agency and dispatched workers, so that the requester to obtain more revenue.

Empirical mode decomposition (EMD) can adaptively decompose multicomponent signals into a finite number of simple oscillatory mode functions termed intrinsic mode functions (IMFs) through a sifting process. In this paper, a tree-structured EMD filter is designed to describe the EMD algorithm. The core element of the EMD filter is called sifting filter which depicts the EMD sifting process of extracting an IMF. As a consequence, the tree-structured EMD filter can make toward a better understanding of the EMD method.

Empirical mode decomposition (EMD) can adaptively separate the intrinsic oscillatory modes of signals into a finite number of intrinsic mode functions (IMFs). IMFs will lose their physical meaning when mode mixing phenomenon occurs. In this paper, we first analyze the relationship between mode mixing and intermittency in signals. We then introduce a new type of mode mixing which is not caused by intermittency in signals. Finally, we argue that the time-varying extrema sampling rate is the essential reason of mode mixing.

The discovery of giant magneto-impedance(GMI) in soft magnetic materials has opened new horizon in the development of micro-magnetic sensors operating at nano-Tesla range. A new type of asymmetric giant magneto impedance (A-GMI)sensor was developed and the performance of the sensowas carefully studied. This paper presents a design of linear magnetic sensor based on AGMI in Co 68.15 Fe 4.35 Si 12.5 B 15 wire s-subjected to a high frequency pulse current, which demonstrates a considerable asymmetry and enhanced sensitivity. Su-sequent, a novel approach, adopting rotary ellipsoid witharray of magnetic dipole, is used for the modeling of the field distribution of the battlefield ferromagnetic target, especially for tank. On account of amorphous wire's characteristics, th-e research of the paper provides a promising and effective w-ay to improve the performance for detecting and recognizingthe target and makes it possible for the microminiaturization of the micro-magnetic fuze system.

With the rapid development of global economics in recent years, buyer’s market is greatly expanded where consumer’s demand becomes diversified and individual. So the management and control problems of Make-to-Order (MTO) production enterprises are paid more and more attention. In the paper, the problem of rough capability estimation for the Make to Order enterprises is described and discussed that deal with production orders of different delivery dates based on limited manufacturing resources. According to the capabilities and delivery dates that new orders require, a total capability bill and corresponding calculating methods of various capabilities are established to solve the rough capability estimation problem. The approach can be used to rapidly judge whether an enterprise has the capabilities needed to finish production orders on time, and estimate new order’s delivery date. The information can support a negotiator to make correct decisions on the delivery dates of coming production orders when bargaining with users. A rough production capability estimation system for Make-to-Order enterprises under limited manufacturing resources constraints is developed on Delphi 7 platform and is validated by an instance.

Hospital medicine storage information system is an important element of Hospital Information System (HIS). The implementation of hospital medicine storage information system based on B/S architecture is discussed. The main functions and implementation details of the system are presented. Based on Java 2 Platform Enterprise Edition (J2EE), using integrated open source frame, four-level structure is adopted to develop the system. Hereinto, the representation level, control level, and transaction logic level adopt the struts frame that accords with MVC mode, while the persistent data level adopts Hibernate frame. Consequently, it not only makes the system structure clear and maintainable, but also strengthens codes’ readability and reusability greatly.

In production process, a cutter management system should provide accurate, timely, and optimal information of cutters and their components. However, there are few cutter management and consultation systems based on B/S (Browser/Server) structure. In the paper, a cutter database management system is developed based on B/S architecture. The cutter database management system is mainly consisted of user information management, cutter query, technological document and borrowing status browsing, cutter information and borrowing status management, cutter type management, technological document management, cutter storage location management, user information browsing, system management, etc. The system is developed using NetBeans 5.0 and Microsoft Office Access 2003. JSP is mainly used to develop View level, Servlet is used to realize Controller level, and JavaBean is used to realize Model level. MVC frame realizes the separation between functional modules and display modules. At the same time, the maintainability, expandability, portability, and reusability of the system are improved. B/S architecture simplifies system maintenance and upgrade, and reduces development and maintenance costs.

From a systematic perspective, the connotation and evaluation of manufacturing enterprise competitive strength are analyzed and studied. Using the AHP method and considering the characteristics of manufacturing enterprises, an indices system for manufacturing enterprise competitive strength evaluation is established based on innovation achievement, productivity, and marketing competitive strength. In the evaluation process, subjective weights are determined through expert investigation method and objective weights are determined through entropy weight method. Then, using no dimensional processing method and convergence processing method, a corresponding evaluation model is established through combining the subjective weights and objective weights. Finally, based on the evaluation model, the comprehensive manufacturing enterprise competitive strength is determined. The evaluation system of enterprise competitive strength analysis and evaluation is developed on Delphi 7 platform and is validated by an instance.

In order to deal with dynamic change in a manufacturing environment, all kinds of manufacturing resources are reorganized as multifarious agents with different resources and capability. According to the automation level and working mode of each functional agent to finish its tasks in the manufacturing environment, the manufacturing resource agents are divided into three categories. In order to construct these various agents conveniently, a multi-layer structure is put forward. Based on the structure, the agents can not only rapidly deal with unexpected events, but also recognize and predict the environment change automatically to adjust their behavior. A manufacturing system hierarchical architecture based on MAS is also provided. According to the change of actual productive tasks and the difference of scheduling strategies, the manufacturing system can be reconstructed flexibly by changing the MAS structure and the granularity of the agents. Consequently, it can adapt to the rapid change of the manufacturing environment and the manufacturing resources.

To realize distributed cooperative product design in virtual enterprises and supply chains, an extended MVC-based Web application framework based on XML on J2EE platform is put forward that is more flexible, expansible and maintainable. An integrated information framework for loosely coupling software modules based on uniform XML data model is also presented to change the confused situation that comes from connecting isolated data sources. On the basis of the MVC-based extended Web application framework, the architecture of a machine tool distributed cooperative design system for virtual enterprises is presented. The system includes the modules of requirement analysis, scheme decision-making, project management, task decomposition, process monitor, resource management, user management, and collaborative tool management. A machine tool distributed cooperative design system is developed to validate the extended MVC-based Web application framework and XML interoperable information model.

As electronic patient record (EPR) is the basis of clinical information and the core of a hospital information system (HIS), the research on EPR is an important element of HIS and digital hospital construction. Based on B/S architecture, a three-layer EPR management system is presented. Its expandable, maintainable and secure B/S system architecture is cost-effective and is developed with Eclipse platform. The dataflow and activities at a hospital are analyzed. Based on the function and operation analysis of the clinical department in a hospital, the database structure for the EPR management system is designed using E-R charts. The functioning process of the server in the B/S architecture is discussed. The server is developed with the components registered in Struts-config.xml file. At the client, JSP pages are created with dreamweaver. The prototype system is tested by test run and its correctness is validated.

Due to the bandwidth constraint and unreliable transmission of network, data packet dropout exists inevitably in networked control systems (NCSs). Networked three tank system with the controller designed without having the network in mind is analyzed and conclusions are drawn that network should be considered when designing NCSs. Next, NCSs with arbitrary but finite data packet dropout is modeled as switched linear system and sufficient conditions are presented on the stability of NCSs. The corresponding state feedback controller can be constructed by using the feasible solutions of a group of linear matrix inequalities. Simulation results for the three tank system are given, which prove the validity of the design method.

Faced with processing time uncertainties, equipment reliability/availability, demand changes, manpower fluctuation and so on in a dynamic manufacturing environment, an organization structure for agile production scheduling and control based on MAS is put forward to achieve effective and efficient production. A hybrid multi-layer agent structure is put forward to facilitate constructing various agents. Bidding mechanism is adopted to decompose and assign manufacturing tasks that determine the cooperative relationship among agents at different levels. The integration of task assignment and scheduling is realized through capability matching and dynamic scheduling. Agent granularity and MAS model are determined dynamically according to production demands. Consequently, all resources in a manufacturing system are reorganized into an agile manufacturing network of agents to collaboratively plan, control and manage distributed production by exploiting the autonomous and cooperative characteristics of various agents.

To satisfy current requirements of Web applications and solve the existing problems in Web application development, an extended MVC-based Web application framework based on XML on J2EE platform is put forward that is more flexible, expansible and maintainable. According to the characteristics of structured and unstructured machine tool product data in Web based distributed cooperative design environment, the definition and model of an XML- based document tree is presented, which is able to unify the representation of product design and manufacturing information. An XML style interface and mapping interface mechanism are discussed to realize interactive information transaction across heterogeneous platforms. A machine tool distributed cooperative design system is developed to validate the extended MVC-based web application framework and XML interoperable information model. The result shows their effectiveness.

Dynamic scheduling algorithms are gaining more and more special attention for their satisfying robustness when confronted with unexpected events as well as their considerably high performance in scheduling. The wasp colony algorithm is a newly presented dynamic scheduling algorithm, which bases on natural insect society behavior models. Based on the principle of the wasp colony algorithm, two different algorithms, namely the routing wasp algorithm and the scheduling wasp algorithm, are combined to solve the job shop dynamic scheduling problem. The algorithms are modified to better adapt to job shop dynamic scheduling environment. The algorithms are developed based on Eclipse 3.2 and J2SE 6.0. Simulation experiments are accomplished and experimental data are analyzed. The results show that the principle of the algorithms is simple, their computational quantity is small, and they can be applied to multi-batch dynamic scheduling with unpredictable entry time due to their favorable potential.

In this paper we study the effect of networks with packet dropout in the feedback loop of a control system. The networked control system with data packets loss is modelled as a discrete-time Markov jumping linear system (MJLS). Based on the results for MJLS, system performance is measured via an Hinfin norm from disturbance to error and the controller is computed by a necessary and sufficient linear matrix inequality condition. Finally we applied these results to three-tank system and compared with static control scheme. Theoretical analysis and simulation results show that the control strategy studied in this paper is effective and feasible

This paper addresses the map building problem for cooperative search by a team of uninhabited air vehicles (UAVs) operating in an unknown and uncertain environment . We present and compare two evidential map-building approaches based on Bayesian theory and Dempster-Shafer theory respectively. We illustrate how to utilize the generated maps into the UAVs path planning procedure so that they could cooperatively localize targets in the environment. The simulation results illustrate the effectiveness of the proposed strategies.

This paper addresses the problem of cooperative search in a given environment by a team of unmanned aerial vehicles (UAVs). We present a decentralized control model for cooperative search and develop a real-time approach for online cooperation among vehicles, which is based on treating the possible paths of other vehicles as "soft obstacles" to be avoided. Using the approach of "rivaling force" between vehicles to enhance cooperation, each UAV takes into account the possible actions of other UAVs such that the overall information about the environment is increased. The simulation results illustrate the effectiveness of the proposed strategy.

A decentralized cooperative strategy for cooperative search by a team of mobile agents (of particular interest is the case of unmanned air vehicles) is presented, where cooperation is accomplished by having each agent take into account the other agents' possible actions. The preliminary associated analysis shows that the proposed strategy guarantees a complete global search of the environment, gives a lower bound on the search time and shows that it is finite.

Searching a spatially extended environment using autonomous mobile agents is a problem that arises in many applications, e.g., search-and-rescue, search-and-destroy, intelligence gathering, surveillance, disaster response, exploration, etc. Since agents such as UAV's are often energy-limited and operate in a hostile environment, there is a premium on efficient cooperative search without superfluous communication. In this paper, we consider how a group of mobile agents, using only limited messages and incomplete information, can learn to search an environment efficiently. In particular, we consider the issue of centralized vs. decentralized intelligence and the effect of opportunistic sharing of learned information on search performance.

This paper presents an approach for cooperative search of a team of distributed agents. We consider two or more agents, or vehicles, moving in a geographic environment, searching for targets of interest and avoiding obstacles or threats. The moving agents are equipped with sensors to view a limited region of the environment they are visiting, and are able to communicate with one another to enable cooperation. The agents are assumed to have some "physical" limitations including possibly maneuverability limitations, fuel/time constraints and sensor range and accuracy. The developed cooperative search framework is based on two inter-dependent tasks: (1) online learning of the environment and storing of the information in the form of a "search map"; and (2) utilization of the search map and other information to compute online a guidance trajectory for the agent to follow. The distributed learning and planning approach for cooperative search is illustrated by computer simulations.