![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Algorithm of Multiple Sensitive Attributes Privacy Based on Personal Anonymous
This paper analyzes the (k, l) - Anonymous model need to address two key questions: re-encoding methods and information loss metrics, and in-depth analysis of the (k, l) - Anonymous model and similar models th...
-
Chapter and Conference Paper
An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times
The Chinese Postman Problem is a famous and classical problem in graph theory. This paper introduces a new variant of this problem, namely Rural Postman Problem with Time Dependent Travel Times, which is motiv...
-
Chapter and Conference Paper
Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves
We investigate an upper bound on the discrepancy and a lower bound on the linear complexity of a class of sequences, derived from elliptic curves by using discrete logarithm in this paper. The results indicate...
-
Chapter and Conference Paper
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences
An efficient algorithm for determining the linear complexity and the minimal polynomial of sequence with period p m q ...
-
Chapter and Conference Paper
Traffic Flow Forecasting Based on Parallel Neural Network
In Intelligent Transportation Systems (ITS), traffic flow forecasting is important to Traffic Flow Guidance System (TFGS). However most of the traffic flow forecasting models cannot meet the requirement of TFG...