scholarly journals A novel method for determining fixed running time in operating electric train tracking optimal speed profile

Author(s):  
An Thi Hoai Thu Anh ◽  
Nguyen Van Quyen

<span lang="EN-US">Tracking the optimal speed profile in electric train operation has been proposed as a potential solution for reducing energy consumption in electric train operation, at no cost to improve infrastructure of existing Metro lines as well. However, the optimal speed profile needs to meet fixed running time. Therefore, this paper focuses on a new method for determining the fixed running time complied with the scheduled timetable when trains track the optimal speed profile. The novel method to ensure the fixed running time is the numerical-analytical one. Calculating accelerating time ta, coasting time tc, braking time tb via values of holding speed vh, braking speed vb of optimal speed profile with the constraint condition: the running time equal to the demand time. The other hands, vh and vb are determined by solving nonlinear equations with constraint conditions. Additionally, changing running time suit for each operation stage of metro lines or lines starting to conduct schedules by the numerical-analytical method is quite easy. Simulation results obtained for two scenarios with data collected from electrified trains of Cat Linh-Ha Dong metro line, Vietnam show that running time complied with scheduled timetables, energy saving by tracking optimal speed profile for the entire route is up to 8.7%, if the running time is one second longer than original time, energy saving is about 11.96%.</span>

2020 ◽  
Vol 10 (6) ◽  
pp. 6488-6493
Author(s):  
T. T. T. A. Anh ◽  
N. V. Quyen

The significant energy consumption for railway electric transportation operation poses a great challenge in outlining saving energy solutions. Speed profile optimization based on optimal control theory is one of the most common methods to improve energy efficiency without the railway infrastructure investment costs. The paper proposes an optimization method based on Pontryagin's Maximum Principle (PMP), not only to find optimal switching points in three operation phases: accelerating, coasting, braking, and from these switching points being able to determine the optimal speed profile, but also to ensure fixed-trip time. In order to determine trip time abiding by the scheduled timetables by applying nonlinear programming puts the Lagrange multiplier λ in the objective function regarded as a time constraint condition. The correctness and energy effectiveness of this method have been verified by the simulation results with data collected from the electrified trains of the Cat Linh-Ha Dong metro line in Vietnam. The saving energy levels are compared in three scenarios: electrified train operation tracking the original speed profile (energy consumption of the route: 144.64kWh), train operation tracking the optimal speed profile without fixed-trip time (energy consumption of the route: 129.18kWh), and train operation tracking the optimal speed profile and fixed trip time (energy consumption of the route: 132.99kWh) in an effort to give some useful choices for operating metro lines.


TAPPI Journal ◽  
2012 ◽  
Vol 11 (10) ◽  
pp. 9-17
Author(s):  
ALESSANDRA GERLI ◽  
LEENDERT C. EIGENBROOD

A novel method was developed for the determination of linting propensity of paper based on printing with an IGT printability tester and image analysis of the printed strips. On average, the total fraction of the surface removed as lint during printing is 0.01%-0.1%. This value is lower than those reported in most laboratory printing tests, and more representative of commercial offset printing applications. Newsprint paper produced on a roll/blade former machine was evaluated for linting propensity using the novel method and also printed on a commercial coldset offset press. Laboratory and commercial printing results matched well, showing that linting was higher for the bottom side of paper than for the top side, and that linting could be reduced on both sides by application of a dry-strength additive. In a second case study, varying wet-end conditions were used on a hybrid former machine to produce four paper reels, with the goal of matching the low linting propensity of the paper produced on a machine with gap former configuration. We found that the retention program, by improving fiber fines retention, substantially reduced the linting propensity of the paper produced on the hybrid former machine. The papers were also printed on a commercial coldset offset press. An excellent correlation was found between the total lint area removed from the bottom side of the paper samples during laboratory printing and lint collected on halftone areas of the first upper printing unit after 45000 copies. Finally, the method was applied to determine the linting propensity of highly filled supercalendered paper produced on a hybrid former machine. In this case, the linting propensity of the bottom side of paper correlated with its ash content.


2019 ◽  
Vol 139 (6) ◽  
pp. 580-587
Author(s):  
Shoichiro Watanabe ◽  
Yasuhiro Sato ◽  
Takafumi Koseki ◽  
Takeshi Mizuma ◽  
Ryuji Tanaka ◽  
...  

Author(s):  
Jangbae Jeon

Abstract This work presents a novel method of continuous improvement for faster, better and cheaper TEM sample preparation using Cut Look and Measure (CLM). The improvement of the process is executed by operational monitoring of daily beam conditions, end products, bulk thickness control, recipe usage and tool running time. This process produces a consequent decrease in rework rate and process time. In addition, it also increases throughput with better quality TEM samples.


Author(s):  
Zaheer Ahmed ◽  
Alberto Cassese ◽  
Gerard van Breukelen ◽  
Jan Schepers

AbstractWe present a novel method, REMAXINT, that captures the gist of two-way interaction in row by column (i.e., two-mode) data, with one observation per cell. REMAXINT is a probabilistic two-mode clustering model that yields two-mode partitions with maximal interaction between row and column clusters. For estimation of the parameters of REMAXINT, we maximize a conditional classification likelihood in which the random row (or column) main effects are conditioned out. For testing the null hypothesis of no interaction between row and column clusters, we propose a $$max-F$$ m a x - F test statistic and discuss its properties. We develop a Monte Carlo approach to obtain its sampling distribution under the null hypothesis. We evaluate the performance of the method through simulation studies. Specifically, for selected values of data size and (true) numbers of clusters, we obtain critical values of the $$max-F$$ m a x - F statistic, determine empirical Type I error rate of the proposed inferential procedure and study its power to reject the null hypothesis. Next, we show that the novel method is useful in a variety of applications by presenting two empirical case studies and end with some concluding remarks.


Languages ◽  
2021 ◽  
Vol 6 (3) ◽  
pp. 123
Author(s):  
Thomas A. Leddy-Cecere

The Arabic dialectology literature repeatedly asserts the existence of a macro-level classificatory relationship binding the Arabic speech varieties of the combined Egypto-Sudanic area. This proposal, though oft-encountered, has not previously been formulated in reference to extensive linguistic criteria, but is instead framed primarily on the nonlinguistic premise of historical demographic and genealogical relationships joining the Arabic-speaking communities of the region. The present contribution provides a linguistically based evaluation of this proposed dialectal grouping, to assess whether the postulated dialectal unity is meaningfully borne out by available language data. Isoglosses from the domains of segmental phonology, phonological processes, pronominal morphology, verbal inflection, and syntax are analyzed across six dialects representing Arabic speech in the region. These are shown to offer minimal support for a unified Egypto-Sudanic dialect classification, but instead to indicate a significant north–south differentiation within the sample—a finding further qualified via application of the novel method of Historical Glottometry developed by François and Kalyan. The investigation concludes with reflection on the implications of these results on the understandings of the correspondence between linguistic and human genealogical relationships in the history of Arabic and in dialectological practice more broadly.


2021 ◽  
Vol 13 (9) ◽  
pp. 4648
Author(s):  
Rana Muhammad Adnan ◽  
Kulwinder Singh Parmar ◽  
Salim Heddam ◽  
Shamsuddin Shahid ◽  
Ozgur Kisi

The accurate estimation of suspended sediments (SSs) carries significance in determining the volume of dam storage, river carrying capacity, pollution susceptibility, soil erosion potential, aquatic ecological impacts, and the design and operation of hydraulic structures. The presented study proposes a new method for accurately estimating daily SSs using antecedent discharge and sediment information. The novel method is developed by hybridizing the multivariate adaptive regression spline (MARS) and the Kmeans clustering algorithm (MARS–KM). The proposed method’s efficacy is established by comparing its performance with the adaptive neuro-fuzzy system (ANFIS), MARS, and M5 tree (M5Tree) models in predicting SSs at two stations situated on the Yangtze River of China, according to the three assessment measurements, RMSE, MAE, and NSE. Two modeling scenarios are employed; data are divided into 50–50% for model training and testing in the first scenario, and the training and test data sets are swapped in the second scenario. In Guangyuan Station, the MARS–KM showed a performance improvement compared to ANFIS, MARS, and M5Tree methods in term of RMSE by 39%, 30%, and 18% in the first scenario and by 24%, 22%, and 8% in the second scenario, respectively, while the improvement in RMSE of ANFIS, MARS, and M5Tree was 34%, 26%, and 27% in the first scenario and 7%, 16%, and 6% in the second scenario, respectively, at Beibei Station. Additionally, the MARS–KM models provided much more satisfactory estimates using only discharge values as inputs.


Biomolecules ◽  
2020 ◽  
Vol 10 (4) ◽  
pp. 509 ◽  
Author(s):  
Steffen Glöckner ◽  
Khang Ngo ◽  
Björn Wagner ◽  
Andreas Heine ◽  
Gerhard Klebe

The fluorination of lead-like compounds is a common tool in medicinal chemistry to alter molecular properties in various ways and with different goals. We herein present a detailed study of the binding of fluorinated benzenesulfonamides to human Carbonic Anhydrase II by complementing macromolecular X-ray crystallographic observations with thermodynamic and kinetic data collected with the novel method of kinITC. Our findings comprise so far unknown alternative binding modes in the crystalline state for some of the investigated compounds as well as complex thermodynamic and kinetic structure-activity relationships. They suggest that fluorination of the benzenesulfonamide core is especially advantageous in one position with respect to the kinetic signatures of binding and that a higher degree of fluorination does not necessarily provide for a higher affinity or more favorable kinetic binding profiles. Lastly, we propose a relationship between the kinetics of binding and ligand acidity based on a small set of compounds with similar substitution patterns.


Author(s):  
Heber F. Amaral ◽  
Sebastián Urrutia ◽  
Lars M. Hvattum

AbstractLocal search is a fundamental tool in the development of heuristic algorithms. A neighborhood operator takes a current solution and returns a set of similar solutions, denoted as neighbors. In best improvement local search, the best of the neighboring solutions replaces the current solution in each iteration. On the other hand, in first improvement local search, the neighborhood is only explored until any improving solution is found, which then replaces the current solution. In this work we propose a new strategy for local search that attempts to avoid low-quality local optima by selecting in each iteration the improving neighbor that has the fewest possible attributes in common with local optima. To this end, it uses inequalities previously used as optimality cuts in the context of integer linear programming. The novel method, referred to as delayed improvement local search, is implemented and evaluated using the travelling salesman problem with the 2-opt neighborhood and the max-cut problem with the 1-flip neighborhood as test cases. Computational results show that the new strategy, while slower, obtains better local optima compared to the traditional local search strategies. The comparison is favourable to the new strategy in experiments with fixed computation time or with a fixed target.


Sign in / Sign up

Export Citation Format

Share Document