for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> COMPUTER SCIENCE (Total: 1992 journals)     - ANIMATION AND SIMULATION (29 journals)    - ARTIFICIAL INTELLIGENCE (98 journals)    - AUTOMATION AND ROBOTICS (98 journals)    - CLOUD COMPUTING AND NETWORKS (60 journals)    - COMPUTER ARCHITECTURE (9 journals)    - COMPUTER ENGINEERING (9 journals)    - COMPUTER GAMES (16 journals)    - COMPUTER PROGRAMMING (24 journals)    - COMPUTER SCIENCE (1159 journals)    - COMPUTER SECURITY (45 journals)    - DATA BASE MANAGEMENT (13 journals)    - DATA MINING (32 journals)    - E-BUSINESS (22 journals)    - E-LEARNING (29 journals)    - ELECTRONIC DATA PROCESSING (21 journals)    - IMAGE AND VIDEO PROCESSING (39 journals)    - INFORMATION SYSTEMS (105 journals)    - INTERNET (92 journals)    - SOCIAL WEB (50 journals)    - SOFTWARE (34 journals)    - THEORY OF COMPUTING (8 journals) COMPUTER SCIENCE (1159 journals)                  1 2 3 4 5 6 | Last
 Cluster Computing   [SJR: 0.605]   [H-I: 24]   [1 followers]  Follow         Hybrid journal (It can contain Open Access articles)    ISSN (Print) 1573-7543 - ISSN (Online) 1386-7857    Published by Springer-Verlag  [2354 journals]
• Data storage optimization strategy in distributed column-oriented database
• Authors: Kun Zheng; Danpeng Gu; Falin Fang; Miao Zhang; Kang Zheng; Qi Li
Pages: 2833 - 2844
Abstract: Scan operation will involve many fragments and cause many extra invalid partitioning query operations in distributed column-oriented database which affects query efficiency seriously, especially for spatial data. To solve this question, this paper refers to partitioning strategy in distributed column-oriented database and advocates a spatial data storage optimization strategy named ‘SPPS’. This strategy makes adjacent spatial objects stored in the same data fragment with considering spatial adjacency, and reserves the spatial information of each fragment. Thus spatial query operation can locate the relevant fragment on basis of spatial information of fragment, and extra invalid partitioning scan operations would be lighted. Then the storage and query efficiency would be improved. To verify the validity of ‘SPPS’ optimization strategy, this paper carries on relevant experiments based on HBase and records spatial query efficiency with and without ‘SPPS’ respectively. The experiments results indicate that ‘SPPS’ strategy can optimize the storage and query efficiency in distributed column-oriented databases.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1081-3
Issue No: Vol. 20, No. 4 (2017)

• Effective algorithm for determining the number of clusters and its
application in image segmentation
• Authors: Jialun Pei; Long Zhao; Xiangjun Dong; Xue Dong
Pages: 2845 - 2854
Abstract: The k-means algorithm is a popular clustering method for image segmentation. However, the main disadvantage of this algorithm is its dependence on the number of initial clusters. In this paper, we present an optimal criterion which can select the best segmentation result with less number of clusters. The optimal criterion overcomes the shortcoming of initialization based on the intra-class and inter-class difference. Eight digital images were employed to verify the segmentation results of the optimal criterion. Simultaneously, we have improved the traditional k-means algorithm to find the initial clustering centers efficiently. Experimental results show that the segmented images selected by the optimal criterion have sufficient stability and robustness. In addition, we verify the consistency of results by two kinds of objective assessment measures. The proposed optimal criterion can successfully display the best segmentation results precisely and efficiently so as to instead of artificial selection.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1083-1
Issue No: Vol. 20, No. 4 (2017)

• Coded-exposure camera and its circuits design
• Authors: Xiang Li; Yi Sun
Pages: 3003 - 3014
Abstract: In the industrial production line, the motion of the target is the main reason for blurred image of the camera monitoring. A coded-exposure devices and circuits are designed to get restored image from this motion blurring. A given binary code sequence which represent open or close of shutter in CCD circuits driven by FPGA is used to control the exposure-time. The sampled images are processed by deconvolution algorithm and the high frequency information of them could be preserved by using the coded-exposure sequence resulting in blurred image restoration. The de-blurred problem could be converted to a well-posed from an ill-posed one. Experiments demonstrate that using the coded-exposure, the device proposed is able to improve the quality of blurred image.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-0964-7
Issue No: Vol. 20, No. 4 (2017)

• Image 1D OMP sparse decomposition with modified fruit-fly optimization
algorithm
• Authors: Ming Yang; Ning-bo Liu; Wei Liu
Pages: 3015 - 3022
Abstract: The Fruit-fly optimization algorithm (FOA) is good at parallel search ability in the evolution process, but it traps in local optimum sometimes. Simulated Annealing (SA) algorithm accepts the second-optimum solution with Mrtropolis criterion so as to jump out of the local optimum. So, combined the advantages of two algorithms, modified FOA (FOA-SA) algorithm is presented in this paper. In FOA-SA, the smell concentration function is improved as well, so as to get the whole searching directions for fruit-fly. At the same time, in order to solve the problem of the computational complexity in image 2D sparse decomposition, image 1D orthogonal matching pursuit (OMP) algorithm with FOA-SA algorithm is implemented. Experimental results show that the convergence of FOA-SA is better than that in FOA, and the speed of image 1D sparse algorithm is 2.41 times faster than 2D for the 512  $$\times$$  512 image under the same conditions.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-0966-5
Issue No: Vol. 20, No. 4 (2017)

• Extreme learning machine classification method for lower limb movement
recognition
• Authors: Yuxiang Kuang; Qun Wu; Junkai Shao; Jianfeng Wu; Xuehua Wu
Pages: 3051 - 3059
Abstract: In order to identify the lower limb movements accurately and quickly, a recognition method based on extreme learning machine (ELM) is proposed. The recognizing target set is constructed by decomposing the daily actions into different segments. To get the recognition accuracy of seven movements based on the surface electromyography, the recognition feature vector space is established by integrating short-time statistical characteristics under time domain, and locally linear embedding algorithm is used to reduce the computational complexity and improve robustness of algorithm. Compared with BP, the overall recognition accuracy for each subject in the best dimension with ELM is above 95%.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-0985-2
Issue No: Vol. 20, No. 4 (2017)

• Bus arrival time prediction with real-time and historic data
• Authors: Haitao Xu; Jing Ying
Pages: 3099 - 3106
Abstract: Provision of accurate bus arrival information is vital to passengers for reducing their anxieties and waiting times at bus stop. GPS-equipped buses can be regarded as mobile sensors probing traffic flows on road surfaces. In this paper, we present an approach that predicts bus arrival time in terms of the knowledge learned from a large number of historical bus GPS trajectories. In our approach, we build time-dependent path-section graph, where a path-section is a road segment between two adjacent bus stops, to model the properties of dynamic road networks. Then, a clustering approach is designed to estimate the distribution of travel time on each path-section in different time slots. Finally, bus arrival time is predicted based on the path-section graph and real-time GPS information. Using a real-world trajectory dataset generated by 1000 buses in a period of 2 months, a bus arrival time prediction system is built. Then we evaluate the system with extensive experiments and realistic evaluations. Experiments show that our method is close to the actual value and better than some typical algorithms.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1006-1
Issue No: Vol. 20, No. 4 (2017)

• Research of pre-stack AVO elastic parameter inversion problem based on
hybrid genetic algorithm
• Authors: Qinghua Wu; Liping Wang; Zhixin Zhu
Pages: 3173 - 3183
Abstract: Pre-stack amplitude variation with offset (AVO) elastic parameter inversion technology, combined with genetic algorithm, provides a relatively effective identifying method to oil-gas exploration. However, many problems, such as, fast convergence in algorithm and being easy to fall into local optimization, are brought in traditional genetic algorithm, which leads to an unsatisfied inversion performance. Therefore, this essay proposes a hybrid genetic algorithm which is better in solving pre-stack AVO elastic parameter inversion problem. Taguchi thought is also introduced into this algorithm, which helps to produce better descents and to avoid falling into local optimization, and makes results more robustness. Additionally, as genetic algorithm is poor in local search and inversion of p-wave, s-wave and density, neighborhood search is adopted to optimize density inversion. Inversion accuracy is greatly improved.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1033-y
Issue No: Vol. 20, No. 4 (2017)

• The mechanical arm control based on harmony search genetic algorithm
• Authors: Zhaolan He; Bo Pan; Zongze Liu; Xianxian Tang
Pages: 3251 - 3261
Abstract: Considering the low efficiency and instability of traditional genetic algorithm optimized PID controller, an improved algorithm named harmony search genetic algorithm to optimize PID controller’s parameters of mechanical arm is proposed in this paper. Using harmony search algorithm in the initial population generation process of genetic algorithm improved the algorithm’s performance. Harmony search genetic algorithm is more suitable to optimize PID controller’s parameters than traditional genetic algorithm in six degrees of freedom mechanical arm system. Compared to the traditional control optimization method, as shown in the simulation results, the new kind of optimization method is better in both validity and stability.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1053-7
Issue No: Vol. 20, No. 4 (2017)

• Synchronization study of Hindmarsh–Rose neuron coupled system based on
numerical simulation of time delay
• Authors: Kaijun Wu; Boping Zhang; Bin Tian; Sanshan Du; Huaiwei Lu
Pages: 3287 - 3297
Abstract: This paper studied the synchronization of Hindmarsh–Rose neuron coupled system based on numerical simulation of time delay through theoretical derivation and numerical simulation. Researches found that coupling strength can influence the discharge activity of coupled neuron system and the synchronization of the coupled neurons. Adjusting coupling strength between coupled neuron systems can change two neuron systems from non-synchronization to synchronization. Meanwhile, the researches also found that proper time delay can change two Hindmarsh–Rose neuron systems coupled by electrical synapse from synchronization to non-synchronization, and then destroy the system’s synchronization.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1063-5
Issue No: Vol. 20, No. 4 (2017)

• A novel fingerprinting using channel state information with
MIMO–OFDM
• Authors: Lei Zhang; Enjie Ding; Zhikai Zhao; Yanjun Hu; Xin Wang; Kai Zhang
Pages: 3299 - 3312
Abstract: With the increasing demand of location-based services, indoor localization based on fingerprinting has become an increasingly important technique due to its high accuracy and low hardware requirement. The paper presents a novel fingerprinting system with a fine-grained information known as channel state information (CSI). The proposed fingerprint exploits multiple antennas and subcarriers of the IEEE 802.11n network using multiple input multiple output (MIMO)–orthogonal frequency division multiplexing system and takes account into the distance of features in each fingerprint. The experimental performance of the fingerprint is compared with RSSI-based Fingerprinting system and the CSI–MIMO Fingerprinting system. The experiment results show that the system achieves the accuracy of 0.61 and 0.9 m in static and dynamic scenarios respectively.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1072-4
Issue No: Vol. 20, No. 4 (2017)

• Design of integrated neural network model for weld seam tracking and
penetration monitoring
• Authors: Dukun Ding
Pages: 3345 - 3355
Abstract: This paper has proposed a new method for welding procession monitoring and controlling. A Cartesian welding experimental platform is firstly setup. Then welding experiments can be performed and several groups of welding images can be captured by the vision sensor. A composite filtering system is set up and used to filter the weld arc disturbance. Then median filter and grey level transformation operations are performed to enhance the contrast of processing district on the image. On this basis,the grey centroid of weld pool C, the width of outer weld pool W, the width of inner weld pool N and welding current I are seem to be the heat distribution condition parameters. The weld seam error e and the welding penetertion condition p are used to be the welding conditon detection parameters. A BP neural network is used to set up the relationship between the heat distribution condition parameters and the welding condition detection parameters. In the end, several testing experiments are performed. The resluts show that the pediction value of the tracking error are fit to the measuring value, and the average tracking error is 0.011 mm. The accuracy rate of the model for welding penetration prediction is up to 95%.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1084-0
Issue No: Vol. 20, No. 4 (2017)

• Neural networks for MANET AODV: an optimization approach
• Authors: Hua Yang; Zhimei Li; Zhiyong Liu
Pages: 3369 - 3377
Abstract: To find a route with good stability and less cost is a hot issue because of MANET’s mobility. AODV is one of the most widely used routing protocols in MANET because of its wide application, good performance and expansion. However, AODV is only an optional route instead of an optimized one. In this paper, continuous Hopfield Neural Networks is used to optimize the route to seek an optimal or nearly-optimal route, which can improve the usability and survivability of MANET. The simulation results show that CHNN-AODV is more effective and advantageous than AODV in the measurement of packet receiving rate, end-to-end average delay and routing recovery frequency.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1086-y
Issue No: Vol. 20, No. 4 (2017)

• Quality evaluation of tourmaline red based on uniform color space
• Authors: Ying Guo
Pages: 3393 - 3408
Abstract: Based on the uniform color space $$\hbox {CIE}\,1976\hbox {L}^{{*}}\hbox {a}^{{*}}\hbox {b}^{{*}},$$ the red colors of 310 tourmalines were conducted with the research of color colorimetry. In terms of the quantitative analysis of color indexes such as lightness, chroma and color hue, we put forward the eight-class five-level systems for quality evaluation of tourmaline red by K-Means cluster analysis. The systems were sorted from superior to inferior: Fancy Vivid, Fancy Intense, Fancy Deep, Fancy and Fancy Dark. Through Fisher discriminant, the accuracy was proved to be up to 98.7%. Furthermore, we analyzed the effects of different standard light sources (D $$_{65},$$ A and CWF) on tourmaline red in detail. It was pointed out that D $$_{65}$$ could better reflect the color of non-self-luminous object, which was suitable for quality evaluation of tourmaline red. Light source A significantly improved the chroma and hue of tourmaline red for red tourmaline display. Light source CWF reduced the chroma of tourmaline red, making the hue significantly deviated from the red. Therefore, CWF was not suitable for tourmaline red lighting. Finally, the work discussed the effects of non-color background lightness and color background on tourmaline red to derive the following results: (1) in the process of non-color background lightness transformation, the lightness and chroma of tourmaline red were sensitive and changed significantly, with high synchronism; whereas, the color hue has unobvious change. The higher lightness and chroma of tourmaline red led to larger effects of non-color background lightness transformation to visual lightness and saturation. It was thus proved that the non-color background was suitable for quality evaluation of tourmaline red. (2) In the process of color background transformation, color metal alloy background has significantly higher lightness (average lightness 83.81) and chroma (average chroma 39.21) than tourmaline red, with obvious orange hue (average hue angle 74.48). Therefore, color metal alloy background significantly enhanced the lightness and chroma of tourmaline red, thus greatly contributing to quality evaluation of tourmaline red. However, color metal alloy background made orange hue obvious, namely strengthening mixed hue of non-mainstream red, which was not conducive to quality evaluation of tourmaline red. Therefore, color metal alloy background was only suitable for inlaid jewelry material or gemstone display rather than quality evaluation.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1091-1
Issue No: Vol. 20, No. 4 (2017)

• Research on key technologies of technological service and management based
• Authors: Jinhong Xu; Xiaoguang Yang
Pages: 3409 - 3415
Abstract: Detection of similarity in scientific and technical data finds repetition rate of contents in project notification form for technology plan submitted by each unit. It is conducted through comparison between the same batch and previous batches on declaration book from each declaration unit. Furthermore, it affords early warning, which is an important link in normativeness for project management. Usually, cluster system based on Web servers is adopted to reduce data processing time, where loading balancing of each node is a research hotspot. This paper proposed auto-adaptive load balancing (AALB) algorithm to accomplish load balancing for each node in the cluster by predicting request arrival rate and request size and rapidly adjusting parameter value. The experiment proves that data block distribution is more balanced in each node using balancing strategy for AALB, with less time compared with other load balancing.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1103-1
Issue No: Vol. 20, No. 4 (2017)

• Securing video cloud storage by ERBAC mechanisms in 5g enabled vehicular
networks
• Authors: R. Gopi; A. Rajesh
Pages: 3489 - 3497
Abstract: With the growth of vehicular communication technologies, ubiquitous objects can be interacted and connected to the Internet. Generally, vehicles in VANETs should broadcast safety messages periodically. Since safety messages have been containing traffic interrelated information and sensitive to locality privacy, which is an essential to make sure ambiguity, dependability, and traceability the broadcast. Cooperative transmission is an effective approach for vehicular communications the progress wireless transmission capacity and reliability in fifth-generation (5G) small-cell networks. In this paper, one can analyze the safety communication, the traffic related information, accidents or other privacy aware information is in the form of video reporting service. This service is implemented a vehicular cloud to instantly the reporting videos for official authorities and an ambulance timer. However, due to high and secure traffic data, the vehicular cloud was built on dynamic resources; as a result, it experience of several inherent challenges, which is increasing the complexity on its implementation. Therefore, one can design secure communication system to use cryptography approach and also implement enhanced role-based access control (ERBAC) mechanism for providing the ability of the authority to view the video files in cloud storage system. Experimental results are provided to verify the proposed framework showing by its effectiveness of delivery on time with computational cost.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-0987-0
Issue No: Vol. 20, No. 4 (2017)

• A novel framework to facilitate personalized web search in a dual mode
• Authors: J. Jayanthi; J. Selvakumar
Pages: 3527 - 3535
Abstract: Now days, web search engines provide good services in terms of retrieval and presentation of the information to the user. A foremost difficulty in the modern and ever growing web is the lack of user interest adaption in the process of web search. All users are presented with the same set of search engine result pages (SERPs) for a given input query string, since it follows the keyword based search. The limitation of keyword based search is (i) uncertain user needs and (ii) improper query selection. If the programmer is searching for a query “switch”, it refers to the switch statement of a programming language and for an electrical engineer, the context of search is the physical house hold switch component. In addition to that a user may fall short in choosing the proper query for search that best articulate their information need. Hence, it is evident that keyword searches have tough time to distinguish the user context over the query. A typical approach to focus on this challenge is a personalized web search strategy where the results are retrieved based on the user interest and preferences. The three different major search modules are: (i) building user profiles (ii) re-ranking the SERPs in personal mode and (iii) re-ranking the SERPs in group mode. The proposed work stands for contributing in the field of user profile construction and personalized page ranking. A new method of user model representation termed as Preference Network is constructed. The proposed system can work in both initialization and maintenance mode to build a new or update an existing model. Both the short term and long term interest are utilized to rank the SERPs. The user interest score and group interest score are computed dynamically.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1128-5
Issue No: Vol. 20, No. 4 (2017)

• A two-phase data space partitioning for efficient skyline computation
• Authors: Aziz Nasridinov; Jong-Hyeok Choi; Young-Ho Park
Pages: 3617 - 3628
Abstract: The skyline has attracted a lot of attention due to its wide application in various fields. However, the skyline computation is a challenging issue as there is a high probability that today’s applications deal with large and high-dimensional data. As skyline computation for such huge amount of data consumes much time, parallel and distributed skyline computations are considered. State-of-the-art methods for parallel and distributed skyline computations use various data space partitioning techniques. However, these methods are not efficient, as in certain cases, these methods perform unnecessary skyline computations in a partitioned space, where local-skyline tuples do not contribute to the global-skyline. This may impose additional processing overload and enlarge the overall skyline computation time. In this paper, we propose a novel data space partitioning method for parallel and distributed skyline computation that consists of two-phases: diagonal and entropy score curve based partitioning. The proposed method produces a small set of local-skyline tuples and leads to a more sophisticated merging step. The experiment results demonstrate that the proposed method reduces the number of comparisons and processing time of skyline computation in large amount of data when compared with the existing state-of-the-art methods.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1070-6
Issue No: Vol. 20, No. 4 (2017)

• A zero-watermarking scheme with embedding timestamp in vector maps for Big
Data computing
• Authors: Yizhi Liu; Fan Yang; Kun Gao; Wenjie Dong; Jun Song
Pages: 3667 - 3675
Abstract: Digital watermarking is a frontier technology for information security and also one of the most effective approaches to protect the copyright security of vector maps. Zero-watermarking, a sort of constructed watermarking, is different from the traditional embedded watermarking. Due to the lack of embedding watermark into the vector data, zero watermark exists an obvious difficulty to resist interpretation attack. In this paper, we present an improved zero-watermarking scheme for vector maps by introducing the timestamp method to resist the interpretation attack. The proposed scheme does not need any modifications on the original map data, providing the following feature: adding timestamp to the binary sequence of the scrambled watermarking image, performing the exclusive OR operation on scrambled sequence and extracted feature points, and conducting a reverse extraction detection and a timestamp validation on the zero-watermarking sequence. The experimental results show that the proposed scheme could not only resist interpretation attack in zero-watermarking effectively but also is of robustness and invisibility for the geometric attacks and map updating attacks.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-1251-3
Issue No: Vol. 20, No. 4 (2017)

• Towards a scalable and energy-efficient resource manager for coupling
cluster computing with distributed embedded computing
• Authors: Heng Zhang; Chunliang Hao; Yanjun Wu; Mingshu Li
Pages: 3707 - 3720
Abstract: Microservers (MSs, ARM-based mobile devices) with built-in sensors and network connectivity have become increasingly pervasive and their computational capabilities continue to be improved. Many works present that the heterogeneous clusters, consist of the low-power MSs and high-performance nodes (x86-based servers), can provide competitive performance and energy efficiency. However, they make simple modifications in existing distributed computing systems for adaptation, which have been proven not to fully exploit the various heterogeneous resources. In this paper, we argue that these heterogeneous clusters also call for flexible and efficient computational resource sharing and scheduling. We then present Aries, a platform to support abstracting, sharing and scheduling the cluster resources, scaling from embedded devices to high performance servers, between multiple distributed computing frameworks (Hadoop, Spark, etc.). In Aries, we propose a two-layer scheduling mechanism to enhance the resource utilization of these heterogeneous clusters. Specifically, the resource abstraction layer in Aries is constructed for overall coordination of resources, which provide computation and energy management. A hybrid resource abstraction approach is designed to manage HS and MS resources in fine and coarse granularity separately in this layer to support efficient resource offer based on “resource slot”. And the task schedule layer supports various sophisticated schedulers of existing distributed frameworks and decides how many resources to offer computing frameworks. Furthermore, Aries adopts a novel strategy to support smart switch in three system models for energy-saving effectiveness. We evaluate Aries by a variety of typical data center workloads and datasets, and the result shows that Aries can achieve more efficient utilization of resources when sharing the heterogeneous cluster among diverse frameworks.
PubDate: 2017-12-01
DOI: 10.1007/s10586-017-0936-y
Issue No: Vol. 20, No. 4 (2017)

• HBase storage schemas for massive spatial vector data
• Authors: Yong Wang; Chengjun Li; Meng Li; Zhenling Liu
Abstract: With the development of Geographic Information System (GIS), the storage requirement of spatial vector data is increasing dramatically. Nowadays, designing an efficient storage schema for massive spatial vector data becomes a key step for GIS. Cloud computing with NoSQL, such as HBase, can provide massive high-concurrent and scalable service for storage of spatial vector data. However, storage schemas in NoSQL for spatial vector data can be rarely seen. In this paper, two HBase storage schemas for spatial vector data are proposed. One is the storage schema with rowkeys based on Z curve, Z schema, and the other is the storage schema with rowkeys based on geometry objects identifiers, ID schema. In our experiments, the region query efficiency of the two storage schemas is tested on the cloud framework built by us. Different order Z curve and different query ranges are involved in the experiments. Experimental results show, for both schemas, the increase of query range leads to the growth of response time. More importantly, response time of Z schema is about one-fifth as long as that of ID schema in all cases. It can be seen that Z schema is a better solution for storing spatial vector data in HBase.
PubDate: 2017-10-25
DOI: 10.1007/s10586-017-1253-1

JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327

Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs