1,026,267 research outputs found
Time-freeness and Clock-freeness and Related Concepts in P Systems
In the majority of models of P systems, rules are applied at the ticks of a
global clock and their products are introduced into the system for the following step. In
timed P systems, di erent integer durations are statically assigned to rules; time-free P
systems are P systems yielding the same languages independently of these durations. In
clock-free P systems, durations are real and are assigned to individual rule applications; thus, different applications of the same rule may last for a different amount of time. In
this paper, we formalise timed, time-free, and clock-free P system within a framework
for generalised parallel rewriting. We then explore the relationship between these variants
of semantics. We show that clock-free P systems cannot effi ciently solve intractable
problems. Moreover, we consider un-timed systems where we collect the results using
arbitrary timing functions as well as un-clocked P systems where we take the union over
all possible per-instance rule durations. Finally, we also introduce and study mode-free
P systems, whose results do not depend on the choice of a mode within a fixed family of
modes, and compare mode-freeness with clock-freeness
Scaling properties of a ferromagnetic thin film model at the depinning transition
In this paper, we perform a detailed study of the scaling properties of a
ferromagnetic thin film model. Recently, interest has increased in the scaling
properties of the magnetic domain wall (MDW) motion in disordered media when an
external driving field is present. We consider a (1+1)-dimensional model, based
on evolution rules, able to describe the MDW avalanches. The global interface
width of this model shows Family-Vicsek scaling with roughness exponent
and growth exponent . In contrast, this
model shows scaling anomalies in the interface local properties characteristic
of other systems with depinning transition of the MDW, e.g. quenched
Edwards-Wilkinson (QEW) equation and random-field Ising model (RFIM) with
driving. We show that, at the depinning transition, the saturated average
velocity vanished very slowly (with ) when the reduced force . The simulation
results show that this model verifies all accepted scaling relations which
relate the global exponents and the correlation length (or time) exponents,
valid in systems with depinning transition. Using the interface tilting method,
we show that the model, close to the depinning transition, exhibits a
nonlinearity similar to the one included in the Kardar-Parisi-Zhang (KPZ)
equation. The nonlinear coefficient with , which implies that as the depinning transition is
approached, a similar qualitatively behaviour to the driven RFIM. We conclude
this work by discussing the main features of the model and the prospects opened
by it.Comment: 10 pages, 5 figures, 1 tabl
Resolution with Symmetry Rule Applied to Linear Equations
This paper considers the length of resolution proofs when using
Krishnamurthy's classic symmetry rules. We show that inconsistent linear
equation systems of bounded width over a fixed finite field with
a prime have, in their standard encoding as CNFs, polynomial length
resolutions when using the local symmetry rule (SRC-II).
As a consequence it follows that the multipede instances for the graph
isomorphism problem encoded as CNF formula have polynomial length resolution
proofs. This contrasts exponential lower bounds for
individualization-refinement algorithms on these graphs.
For the Cai-F\"urer-Immerman graphs, for which Tor\'an showed exponential
lower bounds for resolution proofs (SAT 2013), we also show that already the
global symmetry rule (SRC-I) suffices to allow for polynomial length proofs.Comment: 18 pages, to be published in STACS 202
A Model of Antibiotic Resistance Evolution Dynamics Through P Systems with Active Membranes and Communication Rules
Baquero, F.; Campos Frances, M.; Llorens, C.; Sempere Luna, JM. (2018). A Model of Antibiotic Resistance Evolution Dynamics Through P Systems with Active Membranes and Communication Rules. Lecture Notes in Computer Science. 11270:33-44. https://doi.org/10.1007/978-3-030-00265-7_3S334411270Barbacari, N., Profir, A., Zelinschi, C.: Gene regulatory network modeling by means of membrane computing. In: Proceedings of the 7th International Workshop on Membrane Computing WMC 2006. LNCS, vol. 4361, pp. 162â178 (2006)Besozzi, D., Cazzaniga, P., Cocolo, S., Mauri, G., Pescini, D.: Modeling diffusion in a signal transduction pathway: the use of virtual volumes in P systems. Int. J. Found. Comput. Sci. 22(1), 89â96 (2011)Campos, M.: A membrane computing simulator of trans-hierarchical antibiotic resistance evolution dynamics in nested ecological compartments (ARES). Biol. Direct 10(1), 41 (2015)Ciobanu, G., PÄun, Gh., PĂ©rez-JimĂ©nez, M.J.: Applications of Membrane Computing. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-29937-8Colomer, M.A., Margalida, A., Sanuy, D., PĂ©rez-JimĂ©nez, M.J.: A bio-inspired model as a new tool for modeling ecosystems: the avian scavengeras a case study. Ecol. Model. 222(1), 33â47 (2011)Colomer, M.A., MartĂnez-del-Amor, M.A., PĂ©rez-Hurtado, I., PĂ©rez-JimĂ©nez, M.J., Riscos-NĂșñez, A.: A uniform framework for modeling based on P systems. In: Li, K., Nagar, A.K., Thamburaj, R. (eds.) IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2010), vol. 1, pp. 616â621 (2010)Dassow, J., PÄun, Gh.: On the power of membrane computing. TUCS Technical Report No. 217 (1998)Frisco, P., Gheorghe, M., PĂ©rez-JimĂ©nez, M.J. (eds.): Applications of Membrane Computing in Systems and Synthetic Biology. ECC, vol. 7. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-03191-0PÄun, Gh.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108â143 (2000)PÄun, Gh.: Membrane Computing: An Introduction. Springer, Heidelberg (2002). https://doi.org/10.1007/978-3-642-56196-2PÄun, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)World Health Organization: Antimicrobial Resistance: Global Report on Surveillance (2014
Geometric and harmonic means based priority dispatching rules for single machine scheduling problems
[EN] This work proposes two new prority dispatching rules (PDRs) for solving single machine scheduling problems. These rules are based on the geometric mean (GM) and harmonic mean (HM) of the processing time (PT) and the due date (DD) and they are referred to as GMPD and HMPD respectively. Performance of the proposed PDRs is evaluated on the basis of five measures/criteria i.e. Total Flow Time (TFT), Total Lateness (TL), Number of Late Jobs (TNL), Total Earliness (TE) and Number of Early Parts (TNE). It is found that GMPD performs better than other PDRs in achieving optimal values of multiple performance measures. Further, effect of variation in the weight assigned to PT and DD on the combined performance of TFT and TL is also examined which reveals that for deriving optimal values of TFT and TL, weighted harmonic mean (WHMPD) rule with a weight of 0.105 outperforms other PDRs. The weighted geometric mean (WGMPD) rule with a weight of 0.37 is found to be the next after WHMPD followed by the weighted PDT i.e. WPDT rule with a weight of 0.76.Ahmad, S.; Khan, ZA.; Ali, M.; Asjad, M. (2021). Geometric and harmonic means based priority dispatching rules for single machine scheduling problems. International Journal of Production Management and Engineering. 9(2):93-102. https://doi.org/10.4995/ijpme.2021.15217OJS9310292Baharom, M. Z., Nazdah, W., &Hussin, W. (2015). Scheduling Analysis for Job Sequencing in Veneer Lamination Line. Journal of Industrial and Intelligent Information, 3(3). https://doi.org/10.12720/jiii.3.3.181-185Chan, F. T. S., Chan, H. K., Lau, H. C. W., & Ip, R. W. L. (2003). Analysis of dynamic dispatching rules for a flexible manufacturing system. Journal of Materials Processing Technology, 138(1), 325-331. https://doi.org/10.1016/S0924-0136(03)00093-1Cheng, T. C. E., &Kahlbacher, H. G. (1993). Single-machine scheduling to minimize earliness and number of tardy jobs. Journal of Optimization Theory and Applications, 77(3), 563-573. https://doi.org/10.1007/BF00940450da Silva, N. C. O., Scarpin, C. T., PĂ©cora, J. E., & Ruiz, A. (2019). Online single machine scheduling with setup times depending on the jobs sequence. Computers & Industrial Engineering, 129, 251-258. https://doi.org/10.1016/j.cie.2019.01.038Doh, H.H., Yu, J.M., Kim, J.S., Lee, D.H., & Nam, S.H. (2013). A priority scheduling approach for flexible job shops with multiple process plans. International Journal of Production Research, 51(12), 3748-3764. https://doi.org/10.1080/00207543.2013.765074Dominic, Panneer D. D., Kaliyamoorthy, S., & Kumar, M. S. (2004). Efficient dispatching rules for dynamic job shop scheduling. The International Journal of Advanced Manufacturing Technology, 24(1), 70-75.ĂuraseviÄ, M., &JakoboviÄ, D. (2018). A survey of dispatching rules for the dynamic unrelated machines environment. Expert Systems with Applications, 113, 555-569. https://doi.org/10.1016/j.eswa.2018.06.053Forrester, P. (2006). Operations Management: An Integrated Approach. International Journal of Operations & Production Management.Geiger, C. D., &Uzsoy, R. (2008). Learning effective dispatching rules for batch processor scheduling. International Journal of Production Research, 46(6), 1431-1454. https://doi.org/10.1080/00207540600993360Hamidi, M. (2016). Two new sequencing rules for the non-preemptive single machine scheduling problem. The Journal of Business Inquiry, 15(2), 116-127.Holthaus, O., & Rajendran, C. (1997). New dispatching rules for scheduling in a job shop-An experimental study. The International Journal of Advanced Manufacturing Technology, 13(2), 148-153. https://doi.org/10.1007/BF01225761Hussain, M. S., & Ali, M. (2019). A Multi-agent Based Dynamic Scheduling of Flexible Manufacturing Systems. Global Journal of Flexible Systems Management, 20(3), 267-290. https://doi.org/10.1007/s40171-019-00214-9Jayamohan, M. S., & Rajendran, C. (2000). New dispatching rules for shop scheduling: A step forward. International Journal of Production Research, 38(3), 563-586. https://doi.org/10.1080/002075400189301Kadipasaoglu, S. N., Xiang, W., &Khumawala, B. M. (1997). A comparison of sequencing rules in static and dynamic hybrid flow systems. International Journal of Production Research, 35(5), 1359-1384. https://doi.org/10.1080/002075497195371Kanet, J. J., & Li, X. (2004). A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness. Journal of Scheduling, 7(4), 261-276. https://doi.org/10.1023/B:JOSH.0000031421.64487.95Lee, D.K., Shin, J.H., & Lee, D.H. (2020). Operations scheduling for an advanced flexible manufacturing system with multi-fixturing pallets. Computers & Industrial Engineering, 144, 106496. https://doi.org/10.1016/j.cie.2020.106496Lu, C.C., Lin, S.W., & Ying, K.C. (2012). Robust scheduling on a single machine to minimize total flow time. Computers & Operations Research, 39(7), 1682-1691. https://doi.org/10.1016/j.cor.2011.10.003Krishnan, M., Chinnusamy, T. R., & Karthikeyan, T. (2012). Performance Study of Flexible Manufacturing System Scheduling Using Dispatching Rules in Dynamic Environment. Procedia Engineering, 38, 2793-2798. https://doi.org/10.1016/j.proeng.2012.06.327Munir, E. U., Li, J., Shi, S., Zou, Z., & Yang, D. (2008). MaxStd: A task scheduling heuristic for heterogeneous computing environment. Information Technology Journal, 7(4), 679-683. https://doi.org/10.3923/itj.2008.679.683Oyetunji, E. O. (2009). Some common performance measures in scheduling problems. Research Journal of Applied Sciences, Engineering and Technology, 1(2), 6-9.Pinedo, M. L. (2009). Planning and Scheduling in Manufacturing and Services (2nd ed.). Springer-Verlag. https://doi.org/10.1007/978-1-4419-0910-7Prakash, A., Chan, F. T. S., & Deshmukh, S. G. (2011). FMS scheduling with knowledge based genetic algorithm approach. Expert Systems with Applications, 38(4), 3161-3171. https://doi.org/10.1016/j.eswa.2010.09.002Rafsanjani, M. K., &Bardsiri, A. K. (2012). A New Heuristic Approach for Scheduling Independent Tasks on Heterogeneous Computing Systems. International Journal of Machine Learning and Computing, 371-376. https://doi.org/10.7763/IJMLC.2012.V2.147Tyagi, N., Tripathi, R. P., &Chandramouli, A. B. (2016). Single Machine Scheduling Model with Total Tardiness Problem. Indian Journal of Science and Technology, 9(37). https://doi.org/10.17485/ijst/2016/v9i37/97527Vinod, V., & Sridharan, R. (2008). Dynamic job-shop scheduling with sequence-dependent setup times: Simulation modeling and analysis. The International Journal of Advanced Manufacturing Technology, 36(3), 355-372. https://doi.org/10.1007/s00170-006-0836-4Waikar, A. M., Sarker, B. R., & Lal, A. M. (1995). A comparative study of some priority dispatching rules under different shop loads. Production Planning & Control, 6(4), 301-310. https://doi.org/10.1080/0953728950893028
A Calculus of Looping Sequences with Local Rules
In this paper we present a variant of the Calculus of Looping Sequences (CLS
for short) with global and local rewrite rules. While global rules, as in CLS,
are applied anywhere in a given term, local rules can only be applied in the
compartment on which they are defined. Local rules are dynamic: they can be
added, moved and erased. We enrich the new calculus with a parallel semantics
where a reduction step is lead by any number of global and local rules that
could be performed in parallel. A type system is developed to enforce the
property that a compartment must contain only local rules with specific
features. As a running example we model some interactions happening in a cell
starting from its nucleus and moving towards its mitochondria.Comment: In Proceedings DCM 2011, arXiv:1207.682
Dialectic tensions in the financial markets: a longitudinal study of pre- and post-crisis regulatory technology
This article presents the findings from a longitudinal research study on regulatory technology in the UK financial services industry. The financial crisis with serious corporate and mutual fund scandals raised the profile of
compliance as governmental bodies, institutional and private investors introduced a âtsunamiâ of financial regulations. Adopting a multi-level analysis, this study examines how regulatory technology was used by financial firms to meet their compliance obligations, pre- and post-crisis. Empirical data collected over 12 years examine the deployment of
an investment management system in eight financial firms. Interviews with public regulatory bodies, financial
institutions and technology providers reveal a culture of compliance with increased transparency, surveillance and
accountability. Findings show that dialectic tensions arise as the pursuit of transparency, surveillance and
accountability in compliance mandates is simultaneously rationalized, facilitated and obscured by regulatory
technology. Responding to these challenges, regulatory bodies continue to impose revised compliance mandates on
financial firms to force them to adapt their financial technologies in an ever-changing multi-jurisdictional regulatory landscape
- âŠ