bluuebunny/crossref_metadata_2025 huggingface dataset:
Eruditos y «pobres diablos». La corrección en las imprentas españolas del Siglo de las Luces
Authors: Corbeto Albert
Published: October 2018

En este trabajo se estudia la corrección de pruebas en la España de la Ilustración como actividad erudita e institucional, con especial atención a lasempresas editoriales de la Real Biblioteca, así como también la corrección como actividad «profesional», realizada por aquellos hombres de letras que no habían podido acceder a los principales centros culturales o educativos y que malvivían trabajando en las imprentas con contratos temporales escasamente remunerados.
En Vitoria: En la Imprènta nueva de Doña Manuela de Ezquerra, Impressora de esta M. N. y M. L. Provincia de Alava, [1762-1763?]
Authors: López Varea María Eugenia
Published: October 2018

Descubrimiento de un nuevo impreso de Manuela de Ezquerra, quien regentó su propia imprenta en Vitoria, en el siglo XVIII, mientras estaba casadacon Bartolomé de Riesgo, primer impresor de Vitoria y de Álava. Se recoge su producción conocida hasta el momento, así como el último impresodescubierto en la Biblioteca de la Universidad Pontificia Comillas de Madrid.
Los graduales dominicale y sanctorale impresos en México durante el siglo XVI
Authors: Carreño Velázquez Elvia
Published: October 2018

El presente trabajo es una propuesta para la identificación y recuperación de los libros antiguos, en este caso de los primeros que se imprimieron en México. Para ello emplea el método filológico como muestra de las labores interdisciplinarias que ofrecen los libros antiguos. Si bien es cierto que solo se ocupa del registro bibliográfico; se centra en la reconstrucción atendiendo aspectos fundamentales como los legales, tipográficos, históricos y filológicos.
Relaciones de sucesos y terremotos en la Filipinas del siglo XVIII
Authors: Mojarro Romero Jorge
Published: October 2018

El presente trabajo tiene un doble objetivo. En primer lugar, muestra una panorámica de las relaciones de sucesos filipinas del siglo XVIII y establece una tipología temática entre las que destacan aquellas que narran catástrofes naturales. En segundo lugar, se rescatan dos de estas raras relaciones: un impreso filipino, publicado por las prensas franciscanas, que relata las consecuencias del terremoto del territorio de Tayabas en enero de 1743, y un impreso mexicano de 1756 que narra los temblores del volcán Taal a lo largo de la segunda mitad de 1754. Ambos textos se presentan anotados con una introducción analítica.
La biblioteca privada de Konrad Gessner
Authors: Leu Urs B. , De Diego Romero Javier
Published: October 2018

El famoso científico y polímata suizo Konrad Gessner (1516-1565) es considerado el padre de la Bibliografía, el fundador de la Zoología, uno de los botánicos más importantes del siglo XVI y el autor del primer compendio de medicamentos de la Confederación Suiza. Poseía varios animales domésticos y también amplias colecciones de plantas secas, animales disecados, minerales, rocas y libros. Su biblioteca privada, albergada en la actualidad en diversas bibliotecas europeas y norteamericanas, permite comprender mejor los intereses intelectuales y la actividad investigadora de este gran erudito.
«A Jesuit Book», que no es jesuítico ni libro
Authors: Bécares Botas Vicente
Published: October 2018

Se analiza el comportamiento de algunos libreros, científicos y profesionales relacionados con la falsificación de libros antiguos, en este caso de obras de Galileo, que afectan a un pliego hispano impreso en Lima en 1650 y a la difusión de la ciencia moderna en el ámbito hispánico.
Динаміка ендотеліальної дисфункції після прямих методів реваскуляризації з приводу хронічної ішемії нижніх кінцівок
Authors: Rusyn V. I. , Korsak V. V. , Horlenko F. V. , Kenidra A. Yu.
Published: October 2018

Мета. Вивчити динаміку ендотеліальної дисфункції у хворих з дистальними формами ураження артеріального русла до та після відновлення плину крові.

Матеріали і методи. Вивчено та проаналізовано результати комплексного обстеження 30 хворих, прооперованих у відділенні судинної хірургії Закарпатської обласної клінічної лікарні імені Андрія Новака з 2012 по 2018 р. з приводу хронічної ішемії нижніх кінцівок (НК): ІІБ ступінь ішемії був у 17 (56,7%) пацієнтів, ІІІА - у 13 (43,3%). Усім хворим виконано стегново-підколінне шунтування. У всіх хворих до та через 30 днів після оперативного втручання забирали венозну кров з подальшим визначенням кількості десквамованих ендотеліоцитів (ДЕТ), за якою судили про ступінь ендотеліальної дисфункції.

Результати. Зменшення кількості ДЕТ з (6,12 ± 0,21) до (3,9 ± 0,08) × 105 в 1 л плазми після виконання прямих методів реваскуляризації з приводу хронічної ішемії НК свідчить про достовірне зниження ступеня ендотеліальної дисфункцїї (р < 0,001).

Висновки. Переважання процесів регенерації над виявленням апоптозних ендотеліоцитів в інтимі судин та кількості ДЕТ свідчить про зниження ступеня ураження судин, позитивний динамічний ангіогенез та ефективність проведеного лікування.
Класифікація місцевих ускладнень гострого панкреатиту як підґрунтя для вибору оптимального методу їх хірургічної корекції
Authors: Andriushchenko V. V. , Andriushchenko D. V. , Mahlovanyi V. A.
Published: October 2018

Мета. З’ясувати особливості місцевих укладнень (МУ) гострого панкреатиту (ГП), оцінивши їх топографо-анатомічні, патоморфологічні і кількісні характеристики, та опрацювати кваліфікаційну систематизацію МУ ГП.

Матеріали і методи. Проаналізовано результати лікування 460 хворих із МУ ГП при помірно тяжкому – 350 (76%) пацієнтів - і тяжкому – 110 (24%) пацієнтів -клінічному перебігу захворювання із застосуванням щодо МУ термінів «одиночні», «множинні» і «поєднані».

Результати. Одиночні МУ ГП виявлено у 285 (62%) хворих, переважно у сальниковій сумці (46%), паренхімі підшлункової залози (ПЗ) і заочеревинному просторі (33%). Множинні і поєднані МУ констатовано у 175 (38%) хворих, зокрема, множинні - у 42 (24%), поєднані – у 133 (76%). При тяжкому клінічному перебігу ГП домінували поєднані МУ – 41% спостережень порівняно з 25% спостережень при помірно тяжкому перебігу захворювання (χ2 = 6,564; р=0,01) та множинні - відповідно 18 і 7% спостережень (χ2 = 86,451; p < 0,0001). При помірно тяжкому перебігу ГП переважали одиночні МУ – 68% спостережень.

Висновки. МУ ГП вирізняються своїми топографо-анатомічними, патоморфологічними та кількісними характеристиками, а їх класифікація є основою для вибору методу хірургічної корекції.
Нові аспекти застосування глісонового методу мобілізації воріт печінки в хірургічному лікуванні метастатичного колоректального раку
Authors: Kolesnik O. O. , Burlaka A. A.
Published: October 2018

Мета. Покращити безпосередні результати хірургічного лікування хворих із метастатичним колоректальним раком (мКРР) шляхом удосконалення Глісонового методу резекції печінки.

Матеріали і методи. Проведено ретроспективний аналіз (із січня 2014 по листопад 2017 р.) клінічних даних 62 хворих із МКРР, яким виконували мобілізацію воріт печінки Глісоновим методом.

Результати. Інтраопераційна крововтрата становила (382 ± 221) мл, тривалість резекції – (254 ± 63,7) хв, періопераційна гемотрансфузія – (380 ± 120) мл, теплова ішемія (селективний маневр Прінгла – СМП) – (25,1 ± 13,6) хв. Хірургічні ускладнення ІІІ і більше ступеня за класифікацією Clavien-Dindo зареєстровані у 5 (8,06%) хворих. Померлих не було.

Висновки. Оптимізація Глісонового методу мобілізації воріт печінки продемонструвала його доцільність та ефективність у хірургічному лікуванні МКРР. Основною перевагою цього методу вважаємо можливість визначення варіантної анатомії печінки, зменшення тривалості та об’єму теплової ішемії паренхіми.
Fostering Learners Adaptive Competence: Does Acquisition of Self-Regulation and Metacognition Differentiate between Students?
Authors: Ntim Stephen Kwabena
Published: October 2018

This study examined whether or not heuristics skills such as self-regulated and metacognitive strategies differentiate significantly between high ability students. Using an experiment with purposive sample size of estimated two hundred and forty high ability students, an independent t-test conducted at alpha 0.01 suggested a high statistical difference between the experimental and control groups performed at [t=2.91, p=0.01]. This was suggestive that the control group without the self-regulated and metacognitive intervention strategies performed much lower than the experimental groups. These results were interpreted that it was the acquisition of these skills that was the predicting cause of this enhanced performance of the experimental group as opposed to the control. Self-regulated and metacognitive skills significantly fostered this adaptive competence of learners exposed to these strategies more than those who were not.
Perceptions of Chinese Students on the Issues of College English Teaching and its Curriculum
Authors: Chen Lin
Published: October 2018

Existing studies mainly focus on the teaching strategies of College English from the perspective of instructors. Current College English reform also emphases on following well-accepted principles, such as learner-centered and task-based teaching. However, various purposes and needs of studying College English, the suitable teaching strategies are little investigated and interpreted. This study conducted depth interviews with those non-English majors in two Chinese universities to identify their purposes of learning College English and accordingly their responses towards teaching strategies. The result of this study revealed that studying overseas for further education is one of the main purposes of studying English among non-English majors. Based on this aim, the reform on the curriculum and teaching strategies required to be considered and conducted.
Loop Analysis by Quantification over Iterations
Authors: Gleiss Bernhard , Kovács Laura , Robillard Simon
Published: October 2018

We present a framework to analyze and verify programs containing loops by using a first-order language of so-called extended expressions. This language can express both functional and temporal properties of loops. We prove soundness and completeness of our framework and use our approach to automate the tasks of partial correctness verification, termination analysis and invariant generation. For doing so, we express the loop semantics as a set of first-order properties over extended expressions and use theorem provers and/or SMT solvers to reason about these properties. Our approach supports full first-order reasoning, including proving program properties with alternation of quantifiers. Our work is implemented in the tool QuIt and successfully evaluated on benchmarks coming from software verification.
Parse Condition: Symbolic Encoding of LL(1) Parsing
Authors: Singal Dhruv , Agarwal Palak , Jhunjhunwala Saket , Roy Subhajit
Published: October 2018

In this work, we propose the notion of a Parse Condition—a logical condition that is satisfiable if and only if a given string w can be successfully parsed using a grammar G. Further, we propose an algorithm for building an SMT encoding of such parse conditions for LL(1) grammars and demonstrate its utility by building two applications over it: automated repair of syntax errors in Tiger programs and automated parser synthesis to automatically synthesize LL(1) parsers from examples. We implement our ideas into a tool, Cyclops, that is able to successfully repair 80% of our benchmarks (675 buggy Tiger programs), clocking an average of 30 seconds per repair and synthesize parsers for interesting languages from examples. Like verification conditions (encoding a program in logic) have found widespread applications in program analysis, we believe that Parse Conditions can serve as a foundation for interesting applications in syntax analysis.
Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse
Authors: Jiang Chuan , Ciardo Gianfranco
Published: October 2018

A complementary technique to decision-diagram-based model checking is SAT-based bounded model checking (BMC), which reduces the model checking problem to a propositional satisfiability problem so that the corresponding formula is satisfiable iff a counterexample or witness exists. Due to the branching time nature of computation tree logic (CTL), BMC for the universal fragment of CTL (ACTL) considers a counterexample in a bounded model as a set of bounded paths. Since the existential fragment of CTL (ECTL) is dual to ACTL, and ACTL formulas are often negated to obtain ECTL ones in practice, we focus on BMC for ECTL and propose an improved translation that generates a possibly smaller propositional formula by reducing the number of bounded paths to be considered in a witness. Experimental results show that the formulas generated by our approach are often easier for a SAT solver to answer. In addition, we propose a simple modification to the translation so that it is also defined for models with deadlock states.
Plagiarism Checker and Classification of Files on Cloud Using Smart Cloud
Authors: Sharma Manish , Sharma Shilpi
Published: October 2018

This research paper proposes an approach to solve the issue of duplicacy in clouds. there are lots of unused and duplicate data on the internet that only consumes the limited amount of data storage these service providers can provide. If the cloud is not efficient enough it can lead to much higher cost than expected for the service providers. Another issue is that the data is stored in a server that might be present several miles away and not close to the user. This further adds to the cost and efficiency. These issues can be solved with the help of a Smart Cloud. We will take the proportions of two vectors and create a ratio which rates the document in the classification.
Graph Path Orderings
Authors: Dershowitz Nachum , Jouannaud Jean-Pierre
Published: October 2018

We define well-founded rewrite orderings on graphs and show that they can be used to show termination of a set of graph rewrite rules by verifying all their cyclic extensions. We then introduce the graph path ordering inspired by the recursive path ordering on terms and show that it is a well-founded rewrite ordering on graphs for which checking termination of a finite set of graph rewrite rules is decidable. Our ordering applies to arbitrary finite, directed, labeled, ordered multigraphs, hence provides a building block for rewriting with graphs, which should impact the many areas in which computations take place on graphs.
SimuLTE-MEC: Extending SimuLTE for Multi-Access Edge Computing
Authors: Nardini Giovanni , Virdis Antonio , Stea Giovanni , Buono Angelo
Published: October 2018

Multi-access Edge Computing (MEC) is a novel paradigm to enrich current 4G and future 5G cellular networks by placing cloud-computing-based capabilities at the edge of the network. This will allow operators and service providers to endow the cellular network with enriched services. In this paper we describe the modeling and development of a MEC extension for the SimuLTE framework.
An Integrated Framework for Fog Communications and Computing in Internet of Vehicles
Authors: Bonadio Alessio , Chiti Francesco , Fantacci Romano
Published: October 2018

In this paper, the novel Fog Communications and Computing paradigm is addressed by presenting an integrated system architecture, that is applied to achieve a full con- text awareness for vehicular networks and, consequently, to react on traffic anomalous conditions. In particular, we propose to adopt a specific co-designed approach involving Application and Networks Layers. For the latter one, as no infrastructure usually exists, effective routing protocols are needed to guarantee a certain level of reliability of the in- formation collected from individual vehicles. As a consequence, we investigated classical Epidemic Flooding based, Network Coding inspired and Chord protocols. Besides, we resort to Blockchain principle to design a distributed consensus sensing application. The system has been tested by resorting to OMNeT++ framework for its modularity, high fidelity and flexibility. Performance analysis has been conducted over realistic scenarios in terms of consensus making overhead, latency and scalability, pointing out the better trade-off allowing the overlay P2P network formation and the complete context awareness achieved by the vehicles community.
Security Challenges and Application for Underwater Wireless Sensor Network
Authors: Kumar Sarvesh Kumar , Kumari Bersha , Chawla Harshita
Published: October 2018

Automated detection of the abnormalities in brain image analysis is very important and it is prerequisite for planning and treatment of the disease. Computed tomography scan is an imaging technique used for studying brain images. Classification of brain images is important in order to distinguish between normal brain images and those having the abnormalities in brain like hematomas, tumor, edema, concussion etc. The proposed automated method identifies the abnormalities in brain CT images and classifies them using support vector machine. The proposed method consists of three important phases, First phase is preprocessing, second phase consists of feature extraction and final phase is classification. In the first phase preprocessing is performed on brain CT images to remove artifacts and noise. In second phase features are extracted from brain CT images using gray level co-occurrence matrix (GLCM). In the final stage, extracted features are fed as input to SVM classifier with different kernel functions that classifies the images into normal and abnormal with different accuracy levels.
Towards evaluating Named Data Networking for the IoT: A framework for OMNeT++
Authors: Abane Amar , Muhlethaler Paul , Bouzefrane Samia , Daoui Mehammed , Battou Abdella
Published: October 2018

Named Data Networking is a promising architecture for emerging Internet applications such as the Internet of Things (IoT). Many studies have already investigated how NDN can be an alternative for IP in future IoT deployments. However, NDN-IoT propositions need accurate evaluation at network level and system level as well. This paper introduces an NDN framework for OMNeT++. Designed for low-end devices and gateways of the IoT, the framework is capable of simulating NDN scenarios at the boundary of the network and the system. The framework implementation is presented and used to study a typical aspect of NDN integration in IoT devices.
Malware Detection for Cyber Security Enhancement in Smart Grid
Authors: Li Congmiao , Srinivasan Dipti , Reindl Thomas
Published: October 2018

Many embedded systems in a Smart Grid have special constraints in terms of timing, cost and power consumption to ensure security. This paper addresses the Smart Grid security problem with a focus on improving the security of crucial components, and reducing the risks from cyber attacks. A hardware architecture to enhance the security of important embedded devices in the smart grid has been proposed and implemented. This hardware based malware detection system runs on a dedicated hardware implemented with FPGA logic, and allows detection in near real-time. The system architecture and results are presented in the paper.
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs
Authors: Das Anupam , Doumane Amina , Pous Damien
Published: October 2018

We give a new proof that the axioms of left-handed Kleene algebra are complete with respect to language containments. This proof is significantly simpler than both the proof of Boffa (which relies on Krob’s completeness result), and the more recent proof of Kozen and Silva. Our proof builds on a recent non-wellfounded sequent calculus which makes it possible to explicitly compute the invariants required for left-handed Kleene algebra.
A Survey Paper on Different Steganography Technique
Authors: Singh Shashi Kant , Yadav Seema , Raj Ankur , Gupta Priya
Published: October 2018

With the rapid advance in digital network, information technology, digital libraries, and particularly World Wide Web services, many kinds of information could be retrieved any time. So in this digital scenario invisible communication between two parties is the prime concern. Steganography is the technique of hidden communication. It not only hides the message contents, instead it hides the existence of the message. In this paper, a new image steganography method based on spatial domain is proposed secret data hided in image segments using least significant bit (LSB) steganography is proposed. The color image is divided into four equal parts and the secret data is also divided into four equal parts and those divided data is hided in the image segments using least significant bit steganography. In this paper we have critically analyzed various steganographic techniques and also have covered steganography overview its major types, classification, applications.
Unlocking the Enigma of e-Governance in Rural Areas in Perspective to States of India
Authors: Sharma Avinash , Gupta Nishi , Rana Sanjeev
Published: October 2018

The concept of an e-Governance system came into existence just few years back. Its main objective is to provide access to government services to every individual 24 hours a day as well as 7 days a week. It involves large number of confidential data and information that can be accessed by citizens through media. In nutshell, we can say that online working of a government or providing its services online to its citizens at their door step is known as e-Governance. In today’s scenario, growth of any country can be measured by the scope of e-Governance in that country. In this paper, we highlighted various challenges and issues including security issues, different languages issues, geographical areas issues etc being faced by e-Governance system in rural India.
Alternating Reachability Games with Behavioral and Revenue Objectives
Authors: Kupferman Orna , Tamir Tami
Published: October 2018

We introduce and study alternating reachability games with tolls (ARGTs). An ARGT is a multi-player game played on a directed graph. Each player has a source vertex and a set of target vertices. The vertices of the graph are partitioned among the players. Thus, each player owns a subset of the vertices. In the beginning of the game, each player places a token on her source vertex. Whenever a token reaches a vertex v, the owner of the token pays a toll to the owner of vertex v, who directs the token to one of the successors of v. The objective of each player combines a reachability objective with a minimal-cost maximal-profit objective. For the first, the token of the player needs to reach one of her target vertices. For the second, the player aims at decreasing the toll she pays to other players and increasing the toll paid to her due to visits in vertices she owns. ARGTs model settings in which the vertices are owned by entities who also use the network; for example, communication networks in which service providers own the routers and send messages. ARGTs also offer an extension of rational synthesis with rewards to actions. To the best of our knowledge, this model is the first to combine behavioral and revenue objectives.

We study different instances of the game, distinguishing between various network topologies and various levels of overlap among the reachability objectives of the players. We analyze the stability of ARGTs, characterizing instances for which a Nash equilibrium is guaranteed to exist, and studying its inefficiency. We also analyze the problems of finding optimal strategies for the players and for the society as a whole.
Matching in the Description Logic FL0 with respect to General TBoxes
Authors: Baader Franz , Fernandez Gil Oliver , Marantidis Pavlos
Published: October 2018

Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics two decades ago, motivated by applications in the Classic system. Shortly afterwards, a polynomial-time matching algorithm was developed for the DL FL0. However, this algorithm cannot deal with general TBoxes (i.e., finite sets of general concept inclusions). Here we show that matching in FL0 w.r.t. general TBoxes is in ExpTime, which is the best possible complexity for this problem since already subsumption w.r.t. general TBoxes is ExpTime-hard in FL0. We also show that, w.r.t. a restricted form of TBoxes, the complexity of matching in FL0 can be lowered to PSpace.
Rewriting Environment for Arithmetic Circuit Verification
Authors: Yu Cunxi , Yasin Atif , Su Tiankai , Mishchenko Alan , Ciesielski Maciej
Published: October 2018

The paper describes a practical software tool for the verification of integer arithmetic circuits. It covers different types of integer multipliers, fused add-multiply circuits, and constant dividers - in general, circuits whose computation can be represented as a polynomial. The verification uses an algebraic model of the circuit and is accomplished by rewriting the polynomial of the binary encoding of the primary outputs (output signature), using the polynomial models of the logic gates, into a polynomial over the primary inputs (input signature). The resulting polynomial represents arithmetic function implemented by the circuit and hence can be used to extract functional specification from its gate-level implementation. The rewriting uses an efficient And-Inverter Graph (AIG) representation to enable extraction of the essential arithmetic components of the circuit. The tool is integrated with the popular ABC system. Its efficiency is illustrated with impressive results for integer multipliers, fused add-multiply circuits, and divide-by-constant circuits. The entire verification system is offered in an open source ABC environment together with an extensive set of benchmarks.
Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets
Authors: Bendík Jaroslav , Cerna Ivana
Published: October 2018

In many different applications we are given a set of constraints with the goal to decide whether the set is satisfiable. If the set is determined to be unsatisfiable, one might be interested in analysing this unsatisfiability. Identification of minimal unsatisfiable subsets (MUSes) is a kind of such analysis. The more MUSes are identified, the better insight into the unsatisfiability is obtained. However, the full enumeration of all MUSes is often intractable. Therefore, algorithms that identify MUSes in an online fashion, i.e., one by one, are needed. Moreover, since MUSes find applications in various constraint domains, and new applications still arise, there is a desire for domain agnostic MUS enumeration approaches.

In this paper, we present an experimental evaluation of four state-of-the-art domain agnostic MUS enumeration algorithms: MARCO, TOME, ReMUS, and DAA. The evalu- ation is conducted in the SAT, SMT, and LTL constraint domains. The results evidence that there is no silver-bullet algorithm that would beat all the others in all the domains.
Playing with the Maximum-Flow Problem
Authors: Kupferman Orna
Published: October 2018

In the traditional maximum-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow into outgoing edges. The problem has been extensively used in order to optimize the performance of networks in numerous application areas. The definition of the problem corresponds to a setting in which the authority has control on all vertices of the network. Today’s computing environment involves parties that should be considered adversarial. We survey recent studies on flow games, which capture settings in which the vertices of the network are owned by different and selfish entities. We start with the case of two players, max (the authority), which aims at maximizing the flow, and min (the hostile environment), which aims at minimizing the flow. We argue that such flow games capture many modern settings, such as partially- controlled pipe or road systems or hybrid software-defined communication networks. We then continue to the special case where all vertices are owned by min. This case captures evacuation scenarios, where the goal is to maximize the flow that is guaranteed to travel in the most unfortunate routing decisions. Finally, we study the general case, of multiple players, each with her own target vertex. In all settings, we study the problems of finding the maximal flows, optimal strategies for the players, as well as stability and equilibrium inefficiency in the case of multi-player games. We discuss additional variants and their applications, and point to several interesting open problems.
A Simulation Model of IEEE 802.1AS gPTP for Clock Synchronization in OMNeT++
Authors: Puttnies Henning , Danielis Peter , Janchivnyambuu Enkhtuvshin , Timmermann Dirk
Published: October 2018

The aim of this paper is to describe a developed simulation model of the gPTP protocol for time synchronization in OMNeT++ using the INET library. gPTP is part of the IEEE TSN standards. Unfortunately, there is currently no simulation model of gPTP available. Therefore, we developed a new simulation model, compared it to results from the state-of- the-art, and would like to share it with the OMNeT++ community. The simulation model is based on the IEEE 802.1AS specification for full-duplex Ethernet according to a given network topology and use case scenario to analyze the results of the simulation as well as to provide a comparison with results from the state-of-the-art. Time synchronization and propagation delay measurements between time-aware systems are considered and results show that the simulation model works as expected.
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
Authors: Faran Rachel , Kupferman Orna
Published: October 2018

The computational bottleneck in model-checking applications is the blow-up involved in the translation of systems to their mathematical model. This blow up is especially painful in systems with variables over an infinite domain, and in composite systems described by means of their underlying components. We introduce and study linear temporal logic with arithmetic (LTLA, for short), where formulas include variables that take values in Z, and in which linear arithmetic over these values is supported. We develop an automata-theoretic approach for reasoning about LTLA formulas and use it in order to solve, in PSPACE, the satisfiability problem for the existential fragment of LTLA and the model-checking problem for its universal fragment. We show that these results are tight, as a single universally- quantified variable makes the satisfiability problem for LTLA undecidable.

In addition to reasoning about systems with variables over Z, we suggest applications of LTLA in reasoning about hierarchical systems, which consist of subsystems that can call each other in a hierarchical manner. We use the values in Z in order to describe the nesting depth of components in the system. A naive model-checking algorithm for hierarchical systems flattens them, which involves an exponential blow up. We suggest a model-checking algorithm that avoids the flattening and avoids a blow up in the number of components.
When Are Two Gossips the Same?
Authors: Apt Krzysztof , Grossi Davide , Van-Der-Hoek Wiebe
Published: October 2018

We provide an in-depth study of the knowledge-theoretic aspects of communication in so-called gossip protocols. Pairs of agents communicate by means of calls in order to spread information—so-called secrets—within the group. Depending on the nature of such calls knowledge spreads in different ways within the group. Systematizing existing literature, we identify 18 different types of communication, and model their epistemic effects through corresponding indistinguishability relations. We then provide a classification of these relations and show its usefulness for an epistemic analysis in presence of different communication types. Finally, we explain how to formalise the assumption that the agents have common knowledge of a distributed epistemic gossip protocol.
Kaitan Ruang Terbuka Hijau dengan Kenyamanan Termal Perkotaan
Authors: Effendy Sobri , Aprihatmoko Ferdy
Published: October 2018

The existence of green open space in urban areas is very important in influencing the conditions of thermal comfort. The objective of this research was to analyze the relationship between green open space and human comfort for the city of Yogyakarta. We employed Temperature Humidity Index (THI) with input air temperature and relative humidity. The THI value was obtained from four green open space categories those are point, line, area and non-green space. The results showed that the green open space has a positive effect on lowering the air temperature through the cooling effect and providing more comfortable conditions than the place with non-green open space. Based on this research, the city of Yogyakarta could be categorized as quite comfortable.
Penentuan Awal dan Durasi Musim Kemarau Menggunakan Fungsi Polynomial dengan Aplikasi Visual Basic for Applications (VBA)
Authors: Irsyad Fadli , Saptomo Satyanto Krido , Setiawan Budi Indra
Published: October 2018

Forecasting the occurrence of the onset of dry season and its length is important in determining the availability of water for irrigation, domestic and industrial uses. The length of dry season is used for reference in calculating water demand. Prediction of drought can be studied based on the rainfall patterns that have occurred. This is possible because there is a tendency that the rain will repeat a certain pattern at a certain time. The purpose of this study was to predict the onset of dry and rainy seasons as well as their length. Determination of the onset of dry season and its length was conducted using polynomial function of the cumulative amount of rain every single day based on the rain data. The research was conducted using rainfall data from Climate Station III in Serang from 1989 to 2010. The sum of daily rainfall could form a polynomial function. If the magnitude of daily rainfall in a certain period of time is less than the slope of the cumulative annual rainfall, then at that time the dry season is occurred. Determination of the dry season peak can be done by finding the maximum (extreme) point from the polynomial function by getting the second derivative which value is close or equal to zero. In average, the dry season occurred in Serang city started on the 132nd until 300th day. Deviation value for the onset of dry and rainy seasons were 23 and 38 days, respectively, with an average of length of 168 days. The average of R2 value for polynomial function was 0.9937.
The Moderating Effect of Dividend Policy on Free Cash Flow and Profitability Towards Firm Value
Authors: Oktaryani G A Sri , Abdul Mannan Siti Sofiyah
Published: October 2018

ARTICLE INFO  ABSTRACT Keywords:Dividend Policy, Free Cash Flow, Profitability, Firm Value, Manufacture, MRA How to cite:Oktaryani, Sri.,  (2018). Article Title. JMM  UNRAMDOI:10.20956/jmm.v3i2.821   This study is aimed to determine the moderating effect of Dividend Policy on Free Cash Flow and Profitability towards Firm Value. This study use Moderate Regression Analysis (MRA) as tool to analyze the moderating effect of Dividend Policy on the sample tested. Sample are chosen by using purposive sampling method from all manufacture firms that listed on Indonesian Stock Exchange throughout 2010-2015 which offered cash dividend to their shareholders. By using panel data, the findings show that Free Cash Flow and Profitability themselves have significant effect on Firm Value. But conversely, each Free Cash Flow and Profitability does not have significant effect on Firm Value after being moderated by Dividend Policy. It is because the direct effect of Free Cash Flow and Profitability toward Firm value is bigger than the indirect effect. The results indicate that Dividend Policy is just predictor moderation in this case.
DETERMINACIÓN DE LA COMPETITIVIDAD DEL SECTOR AGROPECUARIO EN MÉXICO, 1980-2009
Authors: Ayala Garay Alma Velia , Sangerman-Jarquín Dora Ma. , Schwentesius Rindermann Rita , Almaguer Vargas Gustavo , Jolalpa Barrera José Luis
Published: October 2018

El sector agropecuario en México es cada vez menos competitivo, dado que existe una creciente importación de alimentos, lo que implica la existencia de menor capacidad de producirlos y distribuirlos en el mercado. El objetivo de la presente investigación fue analizar indicadores macroeconómicos, para cuantif icar la competitividad del sector agropecuario en México y su tendencia, dentro de un marco de apertura comercial. La competitividad aditiva revelada resultó menor de cero, con una tendencia decreciente. Alavez,laautosuficienciaalimentaria,labalanzacomercial, el producto interno bruto agropecuario (PIBA) en relación al PIB nacional, PIBA per capita nominal y el salario por productividad, presentaron una tendencia signif icativa a disminuir, con lo que la base macroeconómica no será un pilar adecuado para mejorar la competitividad agropecuaria bajo el contexto analizado. La apertura comercial no ha repercutido en un incremento en la competitividad, pero puede ser mejorada dando prioridad a la soberanía alimentaria, fortaleciendo su mercado interno e invirtiendo en bienes públicos.
ANÁLISIS DE LA CADENA DE VALOR DEL QUESO MANCHEGO EN CUENCA, ESPAÑA
Authors: Trejo Téllez Brenda Inoscencia , De los Ríos Carmenado Ignacio , Figueroa Sandoval Benjamín , Gallego Moreno Francisco José , Morales Flores Francisco Javier
Published: October 2018

El concepto de cadena de valor, se ha desarrollado como respuesta a la necesidad para que las empresas rurales, cumplan con las exigencias de la demanda de productos especializados de alta calidad. En este trabajo se realiza un análisis de la cadena de valor del queso manchego en Cuenca, España; identificando a los agentes y las relaciones entre ellos; en donde se tiene una importante producción de queso manchego con denominación de origen. La investigación se llevó a cabo durante 2008 en la Provincia de Cuenca, España. La metodología que se utiliza incluye las siguientes fases: 1) identificación del sector; 2) identificación de agentes; 3) análisis de la cadena de valor; y 4) análisis de agentes. Los resultados obtenidos presentan que los principales factores que están influyendo en el desarrollo de la cadena de valor son: integración horizontal y vertical, confianza entre agentes, acceso y uso de financiamiento, cumplimiento de normas gubernamentales, cumplimiento de normas de la denominación de origen. Por lo anterior, se concluye que dicha cadena está funcionando correctamente y pueden tomarse elementos de éxito para adecuarse a otros territorios.
CÁLCULO DEL TAMAÑO DE LA MUESTRA FOLIAR EN PLÁTANO HARTÓN
Authors: Ceballos Pérez Samuel Gustavo , Rodriguez Pérez Vianel de Jesús , Rodríguez Rodríguez Orlando Antonio , Gómez Cárdenas Carlos , Rodríguez Guzmán Zulime Fatima
Published: October 2018

Para realizar el seguimiento o auditoría nutricional al cultivo del plátano Hartón, fueron evaluadas dos alternativas de muestreo de su tejido foliar mediante: a) la muestra preliminar completamente al azar; y b) la muestra estratificada aleatoria, con el objetivo de determinar el marco muestreal a fin de obtener el menor tamaño de la muestra en 2008. La unidad de análisis o experimental estuvo, constituida por dos plantas, la planta “madre” al momento de la emisión de la inf lorescencia, y su brote lateral o “hijo” en pleno desarrollo. La muestra foliar fue colectada, acorde a las condiciones establecidas en el muestreo internacional de referencia (MEIR). Esa unidad fue identif icada con pintura brillante, de manera tal que permitiera identificarla 10 a 14 semanas después y fuese cosechada y pesado su racimo. Los resultados demostraron que el marco muestreal generado para muestreo aleatorio estratificado, permite determinar el menor tamaño de la muestra foliar en el ámbito del Sur del Lago de Maracaibo.
“AZUFRASIN”: NUEVA VARIEDAD DE FRIJOL TIPO AZUFRADO PARA EL ESTADO DE SINALOA
Authors: Salinas Pérez Rafael Atanasio , Rodríguez Cota Franklin Gerardo , Padilla Valenzuela Isidoro , Valencia Martínez Yeny , Acosta Gallegos Jorge Alberto
Published: October 2018

En el estado de Sinaloa, México el frijol amarillo del tipo Azufrado-Peruano, raza Nueva Granada, es el que mayor superficie ocupa para satisfacer la demanda interna y para la exportación a EE.UU. Se describe el desarrollo y características agronómicas de la nueva variedad de frijol, ‘Azufrasin’; cuya utilización permitirá ampliar el número de variedades disponibles de este frijol en el estado. Esta nueva variedad se desarrolló a partir de la cruza de tres líneas entre ((Azufrado Pimono-78/Canario-72)//AZPA-5); durante el desarrollo la selección se basó en la tolerancia a las enfermedades virales (BCMV y BCMNV), moho blanco (Sclerotinia sclerotorium) y resistencia a la roya (Uromyces appendiculatus var. appendiculatus). Azufrasin es de hábito determinado tipo I, de porte alto con plantas de 45 cm, 100 días a la madurez f isiológica y el peso de cien semillas varia de 44 a 46 g. Azufrasin muestra adaptación en las áreas productoras de frijol del norte de Sinaloa bajo condiciones de riego, donde ha mostrado alta capacidad de rendimiento y alto grado de tolerancia a enfermedades durante el ciclo de otoño-invierno, superando en rendimiento a la variedad Azufrado Higuera con un promedio de 339 kg ha-1.
H-70: HÍBRIDO DE MAÍZ DE ALTO RENDIMIENTO PARA TEMPORAL Y RIEGO DEL ALTIPLANO CENTRAL DE MÉXICO
Authors: Arellano Vázquez José Luis , Virgen Vargas Juan , Rojas Martínez Israel , Avila Perches Miguel Angel
Published: October 2018

El mejoramiento genético de maíz en los Valles Altos, ha permitido desarrollar en la última década, híbridos con alto rendimiento, porte bajo de planta y resistencia al acame, que han sido productos de la combinación de líneas progenitoras de Valles Altos del INIFAP y del CIMMYT (Arellano et al., 1997). El H-70 resultó de esa combinación como un híbrido trilineal, de grano blanco y textura semicristalina, con adaptación favorable a altitudes de 2 200 a 2 600 m, de madurez intermedia, ya que logra su floración masculina o espigamiento a 100 días y la femenina o jiloteo a 102 días, en promedio. Presenta altura de planta de 2.4 m y de mazorca de 1.4 m. Es resistente al acame, y a enfermedades de planta y mazorca. El rendimiento varía de 4 a 13.3 t ha-1, bajo densidad de 65 mil plantas ha-1. La mazorca tiene en promedio una longitud de 16 cm con 18 hileras y 34 granos por hilera. El peso de mazorca es de 180 g y su relación grano/mazorca es 86%. El peso de 100 granos es de 43.3 g. La cosecha se puede realizar a 180 días, con un contenido de humedad en grano de 25 a 26%, por lo que la mazorca debe someterse a un proceso de secado para reducir la humedad al 14%. Si el productor no dispone de almacenes para secado, puede efectuar la cosecha a 210 días con un contenido de humedad del grano de 18% a 19% y procurar que la mazorca continué su secado natural. Los rendimientos obtenidos con H-70 superaron 13% el rendimiento de híbridos comerciales. La constitución genética de este hibrido permite prosperar favorablemente a niveles distintos de precipitación pluvial y la siembra en áreas con retraso del temporal hasta el 15 de mayo. Su porte de planta facilita la siembra intensiva con 70 000 plantas ha-1 para producción de grano y tiene potencial para la producción de forraje en áreas de riego y buen temporal. El principal impacto económico del H-70 es la diferencia de 3 a 7 t ha-1 sobre el rendimiento de la semilla criolla, que representan de 7 a 14 mil pesos por ha. Este incremento hace rentable la producción de maíz.
VARIACIÓN EN LA TOLERANCIA A DESINFECTANTES DE GENOTIPOS ÉLITE DE Coffea spp. CULTIVADOS in vitro
Authors: López-Gómez Pablo , Iracheta-Donjuan Leobardo , Castellanos-Juárez Marbella , Méndez-López Ismael , Aguirre-Medina Juan Francisco , Aguirre-Medina Juan Francisco , Gutiérrez-Díez Adriana , Ojeda-Zacarías Ma. del Carmen , Pérez-Pérez Bernardito Ribai
Published: October 2018

La embriogénesis somática puede ser afectada por la oxidación de los explantes al aplicar un método común de desinfección. En el Campo Experimental Rosario Izapa en 2006, se determinó la tolerancia a desinfectantes de explantes foliares de genotipos de café, mediante la dosis letal media (DL50) y con base en la tolerancia, se definió el desinfectante óptimo para el establecimiento aséptico. La DL50 de hipoclorito de sodio (NaClO), de hipoclorito de calcio (Ca[ClO]2) y la combinación de ambos, en explantes foliares de genotipos de Coffea canephora P. (INIFAP 95-8, 95-9, 97-10, 97-12, 97-15, 97-18, 97-19, 97-20, 00-24 y 00-28) y genotipos de C. arabica L. (INIFAP 2000-1018, 2000-1128 y 2000-692), se determinó mediante la aplicación de ocho concentraciones de NaClO (0.1, 0.5, 1, 1.5, 2, 2.5, 3, 3.5%), ocho concentraciones de Ca(ClO)2 (3, 4, 5, 6, 7, 8, 9 y 10%) y la combinación. Con base en la tolerancia se aplicaron tratamientos de desinfección: 1, 3 y 6% de NaClO, 3.5, 7 y 10.5% de Ca(ClO)2 y la combinación testigo de 3 y 7% de NaClO y Ca(ClO)2, respectivamente. Existió variabilidad en la tolerancia, puesto que la DL50 varió dependiendo del genotipo y el agente desinfectante. La mayoría de los genotipos fueron menos tolerantes al NaClO (DL50 de 2 a 4%); no obstante, el NaClO controló la contaminación y oxidación en dosis bajas (1 y 3%). El NaClO y el Ca(ClO)2 en bajas concentraciones de hasta 2 y 3.5% respectivamente, son una opción para la desinfección de explantes de café que pueden garantizar un estado fisiológico adecuado para dar inicio a la embriogénesis.
CARACTERIZACIÓN CLIMÁTICA DE LA MICROCUENCA DEL RÍO MONAICITO, SUBCUENCA DEL RÍO MOTATÁN-CARACHE
Authors: Pineda Contreras Neida , Arellano Godoy Rosalva , Becerra Sánchez Ligia , Aular Villegas María Eugenia , Azuaje Valera Milton , Pimentel Mendoza José , Jaimes Cárdenas Edgar
Published: October 2018

Se realizó un estudio climático de la microcuenca del Río Monaicito (11 960 ha), perteneciente a la subcuenca del Motatán-Carache, estado Trujillo, Venezuela; fue realizado a partir de diez años de registros (1985-1995) de precipitación media mensual (seis estaciones) y de temperatura media mensual (una estación de referencia). Con la información de precipitación y la ayuda del interpolador Kriging (geoestadístico Surfer 8.0) se elaboró el mapa de isoyetas medias anuales. Porteriormente, se utilizó el método isoporcentual para obtener a escala 1:25 000, bajo el software Surfer, los mapas de líneas isoporcentuales mensuales, que fueron superpuestos para obtener el mapa de isoyetas medias mensuales y la precipitación media mensual de 85 puntos de referencia distribuidos en la microcuenca. La temperatura media mensual de los puntos de referencia se estimó utilizando el método del gradiente térmico vertical, a partir de los datos de la estación Santa Ana (1985-1995). Se elaboraron 85 balances hídricos usando el método Thornthwaite, los cuales sirvieron de base para la obtención de los mapas de índice hídrico anual, índice de humedad y evapotranspiración potencial anual. Luego, mediante la superposición de dichos mapas y la aplicación de los criterios de clasificación del método Thornthwaite, se realizó la regionalización climática de la microcuenca, determinándose que predomina un clima subhúmedo seco, con poco o ningún exceso de agua y cuatro regiones térmicas: mesotérmica templada-fría, mesotérmica templada-cálida, mesotérmica semicálida y megatérmica o cálida.