In the era of big data, the continuous development and research of 5G, networks and new technology have promoted the application and implementation of data. As an important output factor of business, the amount of information, the number of data sources, and the quality of data types are increasing exponentially, making smart business technology widely used in business scenarios. Guangxi’s sugar output accounts for 60% of China’s total, which plays an important role in national sugar safety. In recent years, it has continuously promoted the digital transformation of the sugar industry. The "big data screen" platform was designed using data visualization, which has played a role in promoting the digital transformation of sugar production. This paper analyzes and studies the visualization design of intelligent business data by taking "big data screen" as an example, and introduces the design method of computer-supported cooperative work (CSCW) program suitable for business applications.

A low-cost wireless vibration sensor can be built using a 3-axis accelerometer, such as ADXL345, attached to a low-cost Wi-Fi microchip, such as ESP8266. In an Internet of Things (IoT) setting, a large number of such inexpensive sensor nodes can be setup with the widely used direct-read-and-send method which samples and sends individually acquired vibration data points from the sensor through the Internet to a server. In this work, we show that such a method is not effective. As the microcontroller alternates between sampling and sending the data, the micro delays of transmission will affect the sensor sampling rate and cause the data points to space unevenly, making the acquired data inaccurate. We propose that vibration should be sampled and transmitted in batches, as such data are acquired continuously without interruption and data points are more evenly spaced. However, the proposed batch-read-and-send will have interbatch gaps that need to be filled. Thus, the key contribution of this work is the novel use of compressive sampling (CS) technique to bridge those gaps. Experimental results show that the direct-read-and-send method loses more information and can only achieve a maximum sampling rate of 350 Hz with a standard uncertainty of 12.4, whereas the proposed solution can measure the vibration wirelessly and continuously up to 633 Hz. Gaps with up to 160 missing points can be filled using CS and achieve better accuracy, with a mean absolute error (MAE) of up to 0.048 and a standard uncertainty of 0.001, making the low-cost wireless vibration sensor a cost-effective solution in an IoT setting.

Due to rapid population growth, the demand for food is also elevating, which inspires farmers to embrace precision agriculture to increase production by exploiting predictive analytics on relevant real-time data. The exactitude of a prediction is vital to decide the next course of actions to be taken to compensate current demands, which again relies on a competent data acquisition technique. The Media Access Control (MAC) protocols have significant contribution in designing data acquisition technique. In this paper, we propose a new Store-and-Delivery base MAC (SD-MAC) protocol for Air-Ground Collaborative Wireless Networks (AGCWNs) to acquire data efficiently from the sensing devices which are deployed in the agricultural field. Our proposed protocol takes into consideration of the factors of network architecture and transforms them into advantages to attain higher throughput. The performance of the proposed protocol is evaluated using simulations and involving another such protocol, where the proposed protocol outperforms the other protocol.

Detecting human movement is an important issue in monitoring and studying human activities especially for elderly and patients. The availability of wireless sensor network eases the monitoring work. Generally, a wireless sensor node for movement detection is embedded with an accelerometer and powered by batteries. The sensor node needs to transmit the sensed data from accelerometer wirelessly to other nodes or directly to a base station. If there are more data to be transmitted, it consumes more energy and thus the batteries drain out more quickly. Thus, an energy saving scheme, called Data Abstraction and Reformation (DAR), is proposed in this paper to reduce data transmission. Through data abstraction, sensor nodes filter out insignificant sensed data but only report those significant to a base station, and with data reformation, the complete data will be reconstructed at the base station with only the received data. We show that with a good selection of data abstraction and data reformation criteria, a movement detecting sensor node will only need to report 10%~30% of the sensed data in order to provide full human movement monitoring at a base station.

Financial institutions are struggling with the challenges of managing and analyzing large dataset, especially if the dataset are accessed and shared among various subsidiaries from different location. These existing organizations, in the past, often employed a centralized control over their dataset as a way to curb data integrity and data solidarity. In this instance, a central processing unit, often a single machine, could consume all resources, else not affording to process the data altogether. To solve these incumbent problems, distributed computing techniques are being introduced to improve the efficiency of data processing. In this project, we present a framework to distribute processing resources for data mining tool, i.e. to provide the ability to distribute the processes, over a cloud software stack using open source tools and platforms. As a conclusion to this framework, we discussed the open source tools and platforms along with our preliminary investigation results.

Optical packets may arrive at an optical switch in an uncoordinated fashion. Therefore, fiber delay lines (FDL) are needed to buffer packets when contention occurs. There have been several optical-buffered switch architectures and FDL assignment algorithms proposed in the literature. However, most of them either have high implementation complexity, or fail to schedule departure time for delayed packets. In this paper, we study the scheduling algorithms for the single-stage shared-FDL optical packet switch. We propose two new FDL assignment algorithms: the sequential FDL assignment (SEFA) algorithm and the multi-cell FDL assignment (MUFA) algorithm. Our algorithms can make resource reservation so as to schedule departure time for packets. Owing to FDL and/or output-port conflicts, the packets that fail to be scheduled are discarded before entering the switch. We show by simulation that with these algorithms, the optical-buffered switch can achieve a loss rate of /spl sim/10/sup -7/ even at the load of 0.9.

A new parallel algorithm for route assignments in Benes-Clos (1962, 1953) networks is studied. Most known sequential route assignment algorithms, such as the looping algorithm, are designed for circuit switching systems where the switching configuration can be rearranged at relatively low speed. In packet switching systems, switch fabrics must be able to provide internally conflict-free paths simultaneously, and accommodate packets requesting connections in real time as they arrive at the inputs. In this paper, we develop a parallel routing algorithm for Benes networks by solving a set of Boolean equations which are derived from the connection requests and the symmetric structure of the networks. Our approach can handle partial permutations easily. The time complexity of our algorithm is O(log/sup 2/ N), where N is the network size. We also extend the algorithm and show that it can be applied to the Clos networks if the number of central modules is M=2/sup m/, where m is a positive integer. The time complexity is O(log N/spl times/log M) in this case.

Recently, a quasi-static routing scheme called path switching was proposed for large-scale packet switch systems. The path-switched Clos network is called a cross-path switch. The cross-path switch is capable of supporting multirate and multicast traffic. In this paper, we develop a general framework for it to handle multimedia traffic. We study the statistical behavior of the cross-path switch using exponential bounded burstiness (EBB) processes as source session traffic models. With characterizing the service guarantees by service curves, we derive a set of statistical bounds on the delay, backlog and departure processes at the switch on a per-session basis. These bounds are necessary for providing per-session statistical quality of service (QoS) guarantees in the cross-path switch and achieving high system utilization.

The three-stage Clos network has been studied extensively as a framework for the implementation of large-scale ATM switches. Previously, a quasi-static routing scheme for three-stage Clos networks, called the path-switching scheme, has been proposed by Lee and Lam to achieve low switch complexity and high throughput. We derive in this paper the nonblocking conditions when the bandwidth requirements of traffic are rounded up to simplify switch operation. We discuss the implications of these results for switch implementation. In particular, we show how use the results to build a semi-optical network to reduce switch complexity.

This letter addresses issues related to achieving optimal performance in a class of scalable asynchronous transfer mode switches. In particular, we propose an algorithm to implement a multilevel stop-and-go queueing strategy that integrates the routing and scheduling functions. The algorithm provides a tight delay bound and ensures that desirable traffic characteristics are preserved when cells traverse across the switch.

In asynchronous transfer mode (ATM) switching systems, switch fabrics must be able to provide not only internally conflict-free paths for cells, but also quality of service (QoS) guarantee for calls. Most research concerning QoS guarantee focuses on the service disciplines of output-buffered switches. However, the scalability of output-buffered switches is rather low because of high implementation complexity. Previously, a new switching implementation called the cross-path switch has been proposed to achieve high throughput and low complexity. This paper addresses fundamental issues related to service disciplines in such a switch that are needed to achieve optimal performance. In particular we propose an algorithm to implement a multi-level stop-and-go queueing strategy that integrates the routing and scheduling functions. We show that our algorithm provides a tight delay bound and ensures that desirable traffic characteristics are preserved when cell traverse across the switch.

A new parallel algorithm for route assignment in Benes-Clos network is studied. In packet switching systems, switch fabrics must be able to provide internally conflict-free paths simultaneously and to accommodate packets requesting for connections in real-time as they arrive at the inputs. Most known sequential route assignment algorithms, such as the looping algorithm for Benes (1962) networks or Clos (1953) networks, are designed for circuit switching systems where the switching configuration can be rearranged at a relatively low speed. Most existing parallel routing algorithms are not practical for packet switching because they either assume the set of connection requests is a full permutation or fail to deal with output contentions among the set of input packets. We develop a parallel routing algorithm by solving a set of Boolean equations which are derived from the connection requests and the symmetric structure of the Benes network. Our approach can handle both the partial permutations and the output contention problem easily. The time complexity of our algorithm is O(log/sup 2/N), where N is the network size. Furthermore, we extend the algorithm and show that it can be applied to the Clos network if the number of central modules is a power of two.