for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> PHYSICS (Total: 780 journals)
    - MECHANICS (20 journals)
    - NUCLEAR PHYSICS (48 journals)
    - OPTICS (90 journals)
    - PHYSICS (564 journals)
    - SOUND (20 journals)
    - THERMODYNAMICS (29 journals)

PHYSICS (564 journals)            First | 1 2 3 4 5 6 | Last

COSPAR Colloquia Series     Full-text available via subscription   (Followers: 1)
Cryogenics     Hybrid Journal   (Followers: 20)
Current Applied Physics     Full-text available via subscription   (Followers: 4)
Diamond and Related Materials     Hybrid Journal   (Followers: 12)
Differential Equations and Nonlinear Mechanics     Open Access   (Followers: 5)
Doklady Physics     Hybrid Journal   (Followers: 1)
Dynamical Properties of Solids     Full-text available via subscription  
ECS Journal of Solid State Science and Technology     Full-text available via subscription   (Followers: 2)
Egyptian Journal of Remote Sensing and Space Science     Open Access   (Followers: 5)
EJNMMI Physics     Open Access  
Embedded Systems Letters, IEEE     Hybrid Journal   (Followers: 23)
Energy Procedia     Open Access   (Followers: 3)
Engineering Failure Analysis     Hybrid Journal   (Followers: 42)
Engineering Fracture Mechanics     Hybrid Journal   (Followers: 20)
Environmental Fluid Mechanics     Hybrid Journal   (Followers: 3)
EPJ Nonlinear Biomedical Physics     Open Access  
EPJ Quantum Technology     Open Access  
EPJ Techniques and Instrumentation     Full-text available via subscription  
EPJ Web of Conferences     Open Access  
European Journal of Physics     Full-text available via subscription   (Followers: 5)
European Journal of Physics Education     Open Access   (Followers: 4)
European Physical Journal - Applied Physics     Full-text available via subscription   (Followers: 5)
European Physical Journal C     Hybrid Journal  
Europhysics News     Open Access  
Experimental Mechanics     Hybrid Journal   (Followers: 19)
Experimental Methods in the Physical Sciences     Full-text available via subscription  
Experimental Techniques     Hybrid Journal   (Followers: 47)
Exploration Geophysics     Hybrid Journal   (Followers: 4)
Few-Body Systems     Hybrid Journal  
Fire and Materials     Hybrid Journal   (Followers: 6)
Flexible Services and Manufacturing Journal     Hybrid Journal   (Followers: 1)
Fluctuation and Noise Letters     Hybrid Journal   (Followers: 1)
Fluid Dynamics     Hybrid Journal   (Followers: 6)
Fortschritte der Physik/Progress of Physics     Hybrid Journal  
Frontiers in Physics     Open Access   (Followers: 2)
Frontiers of Materials Science     Hybrid Journal   (Followers: 4)
Frontiers of Physics     Hybrid Journal   (Followers: 1)
Fusion Engineering and Design     Hybrid Journal   (Followers: 9)
Geochemistry, Geophysics, Geosystems     Full-text available via subscription   (Followers: 26)
Geografiska Annaler, Series A: Physical Geography     Hybrid Journal   (Followers: 3)
Geophysical Research Letters     Full-text available via subscription   (Followers: 55)
Geoscience and Remote Sensing, IEEE Transactions on     Hybrid Journal   (Followers: 20)
Glass Physics and Chemistry     Hybrid Journal   (Followers: 2)
Granular Matter     Hybrid Journal   (Followers: 2)
Graphs and Combinatorics     Hybrid Journal   (Followers: 7)
Gravitation and Cosmology     Hybrid Journal  
Handbook of Geophysical Exploration: Seismic Exploration     Full-text available via subscription  
Handbook of Metal Physics     Full-text available via subscription  
Handbook of Surface Science     Full-text available via subscription   (Followers: 3)
Handbook of Thermal Analysis and Calorimetry     Full-text available via subscription  
Haptics, IEEE Transactions on     Hybrid Journal   (Followers: 3)
Heat Transfer - Asian Research     Hybrid Journal   (Followers: 8)
High Energy Density Physics     Hybrid Journal   (Followers: 3)
High Pressure Research: An International Journal     Hybrid Journal   (Followers: 1)
IEEE Journal of Quantum Electronics     Hybrid Journal   (Followers: 16)
IEEE Signal Processing Magazine     Full-text available via subscription   (Followers: 36)
IET Optoelectronics     Hybrid Journal   (Followers: 3)
Il Colle di Galileo     Open Access  
Imaging Science Journal     Hybrid Journal   (Followers: 2)
Indian Journal of Biochemistry and Biophysics (IJBB)     Open Access   (Followers: 4)
Indian Journal of Physics     Hybrid Journal   (Followers: 4)
Indian Journal of Pure & Applied Physics (IJPAP)     Open Access   (Followers: 9)
Indian Journal of Radio & Space Physics (IJRSP)     Open Access   (Followers: 5)
Industrial Electronics, IEEE Transactions on     Hybrid Journal   (Followers: 12)
Industry Applications, IEEE Transactions on     Hybrid Journal   (Followers: 3)
Infinite Dimensional Analysis, Quantum Probability and Related Topics     Hybrid Journal  
InfraMatics     Open Access  
Infrared Physics & Technology     Hybrid Journal  
Intelligent Transportation Systems Magazine, IEEE     Full-text available via subscription   (Followers: 2)
Intermetallics     Hybrid Journal   (Followers: 8)
International Applied Mechanics     Hybrid Journal   (Followers: 2)
International Geophysics     Full-text available via subscription   (Followers: 4)
International Heat Treatment and Surface Engineering     Hybrid Journal   (Followers: 2)
International Journal for Computational Methods in Engineering Science and Mechanics     Hybrid Journal   (Followers: 10)
International Journal for Ion Mobility Spectrometry     Hybrid Journal   (Followers: 1)
International Journal for Simulation and Multidisciplinary Design Optimization     Full-text available via subscription   (Followers: 1)
International Journal of Abrasive Technology     Hybrid Journal   (Followers: 2)
International Journal of Aeroacoustics     Full-text available via subscription   (Followers: 6)
International Journal of Applied Electronics in Physics & Robotics     Open Access   (Followers: 1)
International Journal of Astronomy and Astrophysics     Open Access   (Followers: 2)
International Journal of Computational Materials Science and Surface Engineering     Hybrid Journal   (Followers: 8)
International Journal of Damage Mechanics     Hybrid Journal   (Followers: 5)
International Journal of Fatigue     Hybrid Journal   (Followers: 11)
International Journal of Fracture     Hybrid Journal   (Followers: 9)
International Journal of Geometric Methods in Modern Physics     Hybrid Journal   (Followers: 1)
International Journal of Geophysics     Open Access   (Followers: 5)
International Journal of Heat and Fluid Flow     Hybrid Journal   (Followers: 19)
International Journal of Low Radiation     Hybrid Journal  
International Journal of Low-Carbon Technologies     Open Access   (Followers: 1)
International Journal of Mass Spectrometry     Hybrid Journal   (Followers: 14)
International Journal of Material Forming     Hybrid Journal   (Followers: 2)
International Journal of Materials and Product Technology     Hybrid Journal   (Followers: 3)
International Journal of Mechanical Sciences     Hybrid Journal   (Followers: 6)
International Journal of Mechanics and Materials in Design     Hybrid Journal   (Followers: 5)
International Journal of Medical Physics, Clinical Engineering and Radiation Oncology     Open Access   (Followers: 4)
International Journal of Micro-Nano Scale Transport     Full-text available via subscription   (Followers: 1)
International Journal of Microstructure and Materials Properties     Hybrid Journal   (Followers: 7)
International Journal of Microwave Science and Technology     Open Access   (Followers: 3)
International Journal of Modeling, Simulation, and Scientific Computing     Hybrid Journal   (Followers: 1)
International Journal of Modern Physics A     Hybrid Journal   (Followers: 1)

  First | 1 2 3 4 5 6 | Last

Journal Cover   Flexible Services and Manufacturing Journal
  [SJR: 1.277]   [H-I: 28]   [1 followers]  Follow
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1936-6582 - ISSN (Online) 1936-6590
   Published by Springer-Verlag Homepage  [2280 journals]
  • A novel multistage deep belief network based extreme learning machine
           ensemble learning paradigm for credit risk assessment
    • Abstract: Abstract To achieve high assessment accuracy for credit risk, a novel multistage deep belief network (DBN) based extreme learning machine (ELM) ensemble learning methodology is proposed. In the proposed methodology, three main stages, i.e., training subsets generation, individual classifiers training and final ensemble output, are involved. In the first stage, bagging sampling algorithm is applied to generate different training subsets for guaranteeing enough training data. Second, the ELM, an effective AI forecasting tool with the unique merits of time-saving and high accuracy, is utilized as the individual classifier, and diverse ensemble members can be accordingly formulated with different subsets and different initial conditions. In the final stage, the individual results are fused into final classification output via the DBN model with sufficient hidden layers, which can effectively capture the valuable information hidden in ensemble members. For illustration and verification, the experimental study on one publicly available credit risk dataset is conducted, and the results show the superiority of the proposed multistage DBN-based ELM ensemble learning paradigm in terms of high classification accuracy.
      PubDate: 2015-09-29
  • A cooperative quay crane-based stochastic model to estimate vessel
           handling time
    • Abstract: Abstract Having a good estimate of a vessel’s handling time is essential for planning and scheduling container terminal resources, such as berth positions, quay cranes (QCs) and transport vehicles. However, estimating the expected vessel handling time is not straightforward , because it depends on vessel characteristics, resource allocation decisions, and uncertainties in terminal processes. To estimate the expected vessel handling time, we propose a two-level stochastic model. The higher level model consists of a continuous-time Markov chain (CTMC) that captures the effect of QC assignment and scheduling on vessel handling time . The lower level model is a multi-class closed queuing network that models the dynamic interactions among the terminal resources and provides an estimate of the transition rate input parameters to the higher level CTMC model. We estimate the expected vessel handling times for several container load and unload profiles and discuss the effect of terminal layout parameters and crane service time variabilities on vessel handling times. From numerical experiments, we find that by having QCs cooperate, the vessel handling times are reduced by up to 15 %. The vessel handling time is strongly dependent on the variation in the QC service time and on the vehicle travel path topology.
      PubDate: 2015-09-21
  • Equilibrium models in multimodal container transport systems
    • Abstract: Abstract Optimizing the performance of multimodal freight transport networks involves adequately balancing the interplay between costs, volumes, times of departure and arrival, and times of travel. In order to study this interplay, we propose an assignment model that is able to efficiently determine flows and costs in a multimodal network. The model is based on a so-called user equilibrium principle, which is at the basis of Dynamic Traffic Assignment problems. This principle takes into account transport demands to be shipped using vehicles that transport single freight units (such as trucks) or multiple freight units (such as trains and barges, where demand should be bundled to reach efficient operations). Given a particular demand, the proposed model provides an assignment of the demand over the available modes of transport. The outcome of the model, i.e., the equilibrium point, minimizes users’ generalized costs, expressed as a function of mode, travel time and related congestion, and waiting time for bundling sufficient demand in order to fill a vehicle. The model deals with these issues across a doubly-dynamic time scale and in an integrated manner. One dynamic involves a learning dynamic converging towards an equilibrium (day-to-day) situation, reflecting the reaction of the players towards the action of the others. Another dynamic considers the possible departure time that results in minimum expected costs, also due to the fact that players mutually influence each other on the choice of departure times, due to congestion effects and costs for early/late arrival of freight units. This is a choice within a given time horizon such as a day or a week. We present a study on the influence and sensitivity of different model parameters, in order to analyse the implications on strategic decisions, fostering a target modal share for freight transportation. We also study under which conditions the different modes can be substitutes for each other.
      PubDate: 2015-09-04
  • Real-time container storage location assignment at an RTG-based seaport
           container transshipment terminal: problem description, control system,
           simulation model, and penalty scheme experimentation
    • Abstract: Abstract We show how the overall productivity of an RTG-based seaport container terminal depends on the system used for automatically selecting storage locations for export containers in real time as they enter the terminal. Several real-time container storage systems are proposed and evaluated by a fully-integrated, discrete event simulation model of a vessel-to-vessel transshipment terminal. In this study, we introduce the problem; present a system for making real-time container storage decisions; describe the simulation model used for experimentation; and describe an experiment that illustrates some of the main trade-offs involved in container storage decisions.
      PubDate: 2015-09-01
  • Optimized allocation of straddle carriers to reduce overall delays at
           multimodal container terminals
    • Abstract: Abstract Increased global container trade and strong competition are boosting the need for efficient container terminals. Using internal transport resources efficiently reduces transfer times and operating costs. This article addresses the allocation of straddle carriers at a tactical level at intermodal container terminals via optimization and simulation. Our objective is to reduce overall delays at the terminal—with special focus on delays of inland transport modes (rail, road and waterway). We introduce a notation to describe different service strategies and delay criteria and analyze the complexity of different service strategies. A generic mixed integer linear program—that can be easily adapted to different service strategies—models the allocation problem based on a network flow representation of the terminal. We conduct a case study for a container terminal at the Grand Port Maritime de Marseille to evaluate the proposed allocation: we adapt the optimization model to the specific terminal, implement a discrete event simulation model and conduct experiments on actual data. Results show that the allocation proposed by the optimization model reduces delays at the terminal and performs well in a stochastic environment.
      PubDate: 2015-09-01
  • Local container drayage problem with tractor and trailer operating in
           separable mode
    • Abstract: Abstract In recent years, the Local Container Drayage Problem (LCDP) has received lots of studies in research as part of container transportation. This paper examines the LCDP under a special operation mode in which tractors and trailers can be separated, i.e., tractors can be assigned to a new task at another location while trailers are waiting for packing or unpacking. The problem is formulated as a vehicle routing and scheduling problem with temporal constraints. The resulting formulation can be used to solve small-scale problems. For large-scale problems, we develop a max–min Ant colony optimization algorithm to reduce the computation time. Numerical experiments with randomly generated instances are performed to demonstrate the performance of the algorithm.
      PubDate: 2015-09-01
  • Reducing hinterland transportation costs through container sharing
    • Abstract: Abstract Based on two scenarios which describe the movement of full and empty containers within seaport hinterland transportation, this contribution determines possible benefits of exchanging empty containers between cooperating trucking companies. In the first scenario, trucking companies only have access to their own containers. In the second scenario, empty containers are permitted to be interchanged among several owners. Descriptions of both scenarios are given by comprehensive mathematical formulations considering vehicle routing, simultaneously with empty container repositioning. Realistic-sized instances are solved by applying an efficient tabu search heuristic. The results show that container sharing between trucking companies leads to remarkable cost savings.
      PubDate: 2015-09-01
  • Experimental evaluation of mixed integer programming models for the
           multi-port master bay plan problem
    • Abstract: Abstract This paper extends the problem of stowing a given set of different type containers in the available slots of a containership, i.e. the so-called master bay plan problem (MBPP), to the multi-port master bay plan problem (MP-MBPP). MP-MBPP considers the whole route of the ship and the different sets of containers which must be loaded at each port of the route for shipping to successive ports. The sequence of alternate unloading and loading operations is relevant for the effectiveness of stowage plans. This paper introduces two exact mixed integer programming (MIP) models for MP-MBPP, aimed to deal with practical and operative aspects of the problem. It also examines some computationally efficient relaxed formulations of the proposed MIP models and reports an extensive computational experimentation performed on real size instances. The results show the effectiveness of the proposed models and the related resolution methods.
      PubDate: 2015-09-01
  • Revenue management methods for the liner shipping industry
    • Abstract: Abstract Due to changes in the industry which have led to opportunities for new market segmentations, revenue management (RM) methods have gained in importance for liner shipping companies in the recent past. Therefore, possible market segmentations of the liner shipping market and suitable RM methods are discussed in this work. Based on a slot allocation model for container bookings, three different booking acceptance strategies are studied and compared with respect to their applicability in liner shipping and their performance regarding profit and capacity utilization. Especially, a new bid-price (BP) strategy is developed and compared to previously presented booking limit strategies. A simulation approach is used to evaluate the strategies for different scenarios. The simulation study reveals large differences in the impact the strategies can have, e.g. depending on the booking forecast quality. As the new BP strategy shows very promising results for many different realistic scenarios, it can be highly recommended for application in liner shipping.
      PubDate: 2015-09-01
  • Seaside operations in container terminals: literature overview, trends,
           and research directions
    • Abstract: Abstract Seaside operations are considered the bottleneck operation in most container terminals around the world. This paper presents an in-depth updated overview of the seaside operations at container terminals and highlights current trends and developments. We review and classify scientific journal papers on container terminal seaside operations, published between 2004 and 2012. The paper also discusses and challenges the current operational paradigms on seaside operations. Lastly, the paper identifies new avenues for academic research based on current trends and developments in the container terminal industry.
      PubDate: 2015-09-01
  • Multi-size container transportation by truck: modeling and optimization
    • Abstract: Abstract This paper investigates a multi-size container truck transportation (MSCTT) problem in which a truck can carry one 40 ft or two 20 ft containers. This problem considers both fixed and flexible drayage orders. A state-transition-based method is presented to formulate the MSCTT problem. The problem is modeled as a sequence-dependent multiple-traveling salesman problem with social constraints in which the distances between cities depend on the sequence of cities visited before. Three tree search procedures and an improved reactive tabu search (IRTS) algorithm are designed to solve the MSCTT problem. They are validated and evaluated based on randomly generated instances extensively. The IRTS algorithm can solve small instances to optimality within less than 1 min. Furthermore, it outperforms the existing reactive tabu search algorithm and can solve realistic-sized instances efficiently. Several interesting findings about the MSCTT problem are presented. Finally, the IRTS algorithm is also applied to a real-world data set.
      PubDate: 2015-09-01
  • Maritime fleet deployment with voyage separation requirements
    • Abstract: Abstract A dry bulk shipping company is operating its fleet on a number of trade routes and is committed to sail a given number of voyages on these trade routes during the planning period, while trying to derive additional revenue from chartering out ships on short term contracts if possible. The shipping company has agreed with the cargo owners that the voyages of a trade should be fairly evenly spread. This leads to a maritime fleet deployment problem with voyage separation requirements. Two formulations for this problem are presented, one arc flow formulation and one path flow formulation. The voyage separation requirements are modeled either as hard constraints or as soft constraints. Computational results show that the path flow model can be solved for problems of realistic size, and that including voyage separation requirements gives solutions with much better spread of voyages. Solving a real life problem and comparing the solution with a plan made manually by experienced fleet schedulers shows that using the proposed optimization method can both generate increased profit and save the schedulers a lot of work.
      PubDate: 2015-09-01
  • Hybrid genetic algorithms for the three-dimensional multiple container
           packing problem
    • Abstract: Abstract The three-dimensional multiple container packing problem (3DMCPP) is used to determine non-overlapping packing of a set of finite three-dimensional rectangular items into the minimum number of identical containers. The decision framework consists of two main activities: item assignment and packing. This paper presents new hybrid genetic algorithms (HGAs) that address current limitations related to the 3DMCPP and enable use of relatively few containers. Rotation constraints are also addressed. An HGA is developed for small problems, and another HGA is created for large problems. Both of the HGAs combine the largest left space first item assignment strategy, a basic genetic algorithm, and the deepest bottom left with fill strategy. Experiments were conducted to demonstrate the performances of the HGAs with two different types of data sets. The results show that the proposed HGAs yield solutions, in a reasonable amount of time, in which relatively few containers are needed.
      PubDate: 2015-09-01
  • Erratum to: Crane scheduling for opportunistic remarshaling of containers
           in an automated stacking yard
    • PubDate: 2015-09-01
  • Literature survey of network optimization in container liner shipping
    • Abstract: Abstract Container liner shipping is one of the most important transportation modes in international trade. The industry is network-based, so network decision contributes much to the success of any operators. There are many decisions in respect of network optimization such as route and schedule design, port selection, fleet size and mix, fleet assignment and scheduling, container movement. Our paper conducts a literature survey to realize optimization problems, methodologies as well as research tendencies to deal with network optimization in container liner shipping. We focus on three major categories: container routing, fleet management and network design. Container routing is related to optimal flow movement of laden and empty containers. Fleet management is involved with decisions of ship assignment and scheduling. Network design is the problem of choosing ports and combining them to create the infrastructure of shipping operation.
      PubDate: 2015-09-01
  • Yard storage planning for minimizing handling time of export containers
    • Abstract: Abstract We consider multiple factors of allocating yard storage space to export containers in a terminal under heavy workloads and with a limited yard storage capacity. We aim at expediting container handling in yards and thus we attempt to balance workloads, shorten yard-to-berth transport distances and minimize the number of sub-blocks with handling jobs. To tackle various objectives in this yard storage allocation, we introduce a hierarchical analytical method that decomposes the planning procedure into two stages. We first optimize workload distribution across the whole yard. Thereafter, we propose a flexible yard allocation strategy and attempt to stack export containers into a minimum number of sub-blocks in the yard so as to facilitate yard crane operation and increase yard space utilization. We present integer programming formulations for these two sub-problems and then solve these two models iteratively by introducing additional parameters and constraints into the formulations. Experimental results indicate that this method is efficient and effective in obtaining good storage templates in the yard by achieving minimum handling time for export containers. Further discussions explore the results of yard space utilization and busy rate in yard blocks when providing different sizes of sub-blocks that contributes to the setting up of suitable sub-blocks in a terminal according to the capacity of its storage space and container handling devices.
      PubDate: 2015-09-01
  • Crane scheduling for opportunistic remarshaling of containers in an
           automated stacking yard
    • Abstract: Abstract Loading of containers onto a vessel can be delayed if the containers are inappropriately stacked at the yard. Remarshaling is the preparatory task of rearranging the containers ahead of loading time to minimize the delay at the time of loading. Previous works on remarshaling derive a remarshaling plan assuming that a certain amount of continuous period of time is available for the remarshaling jobs to be done in a batch; remarshaling jobs cannot be mixed together with the current main jobs in the crane schedule. In contrast, the method proposed in this paper allows remarshaling jobs to be scheduled together with the current jobs under the framework of iterative rescheduling, in which scheduling and execution of the jobs within a predetermined fixed-length look-ahead horizon are repeated in a regular interval. The remarshaling jobs selected for the mix are those that contribute the most to the reduction of future loading delay. The number of remarshaling jobs and their temporal positions within the mixed schedule for a look-ahead horizon are determined appropriately to best utilize the idle time of the automated cranes, which is enforced by an objective function to minimize the delay of the current main jobs as well as the makespan of all the jobs in the horizon.
      PubDate: 2015-09-01
  • Order batching in a bucket brigade order picking system considering picker
    • Abstract: Abstract Bucket brigade order picking improves operational productivity by balancing workloads among pickers with a minimal level of managerial planning and oversight. However, due to variability and uncertainty of the pick locations within a particular order or batch, pickers can encounter blocking delays and thus lose productivity. This study formulates a model to quantify blocking delays and develops a control model to reduce blocking in bucket brigade order picking systems. The Indexed Batching Model for Bucket brigades (IBMB) has indexed batching constraints for generating batch alternatives, bucket brigade picker blocking constraints for quantifying blocking delay, and release-time updating constraints for progressively connecting the batching results with blocking quantification. The IBMB minimizes total retrieval time and improves picker utilization from 2 to 9 % across diverse and practical order picking situations while maintaining the static Work-In-Process. We note that modeling the separation of retrieved batches into orders still remains a challenge.
      PubDate: 2015-08-30
  • The patient assignment problem in home health care: using a data-driven
           method to estimate the travel times of care givers
    • Abstract: Abstract Home health care is one of the recent service systems where human resource planning has a great importance. The assignment of patients to care givers is a relevant issue that the home health care service provider must address before generating the daily routes. The assignment decision is typically made without knowing the visiting sequence, which creates some uncertainties and disparities regarding the effective workload of care givers. However, taking into account travel times in the care giver workload while solving the assignment problem is not straightforward, because travel times can also be affected by clinical conditions of patients and their homes. Providing good travel time estimates that would be used in the assignment decision is the specific topic this paper focuses on. In particular, we propose a data-driven method to estimate the travel times of care givers in the assignment problem when their routes are not available yet. The method, based on the Kernel regression technique, uses the travel times observed from previous periods to estimate the time necessary for visiting a set of patients located in specific geographical locations. The main advantage offered by this technique is the empirical modelling of the travel routes generated by care givers. Numerical results based on realistic problem instances indicate that the proposed estimation method performs better than the average value and k-nearest neighbor search methods and can be successfully used in a two-stage approach that first assigns patients to care givers and then defines their routes.
      PubDate: 2015-08-20
  • Logistics and maritime systems
    • PubDate: 2015-03-13
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2015