bluuebunny/crossref_metadata_2025 huggingface dataset:
Foam Assist in a Gas-Lifted Oil Well
Authors: Farag A.. , Robertson T.. , Kerem M.. , Montero J..
Published: November 2016

Continuous Foam Injection is a proven deliquification technique in gas wells, but the technology typically struggles to perform in wells with high fractions of liquid hydrocarbons. For gas lifted oil wells operating at high water cuts however, continuous downhole foam injection may prove feasible to enhance production. A field trial to test this theory was successfully executed within an oil producing facility in The Netherlands. The objective of this trial was twofold: First, to observe the changes in production owing to downhole injection of a foaming agent while keeping the lift gas rate constant. Second, to perform a lift gas utilization test to identify potential lift gas savings with the assistance of foam. Furthermore, strict specifications on the export crude and produced water had to be achieved. The trial showed successful results. The well had a fast response to the addition of foam whereby initial sluggish production stabilized. This has overcome the flow instability related production deferment, which was significant. Further increases in the foam injection rate to reach the optimum foam concentration helped the well to produce up to 20% more gross liquid than the measured and calculated stable rates. The trial has revealed that with the application of foam, lift gas savings of 35% were feasible and more could be achieved depending on the desired gross liquid production. No process facility upsets were experienced during the trial.

This paper describes the detailed aspects of the trial, including the preparation, execution, and modelling techniques which will benefit and add to the current body of knowledge of foam lift to the petroleum industry.
Reviving the Production of a Dead Well by testing it with Hydraulic Jet Pump
Authors: Kalwar S. A. , Farouque K.. , Awan A. B. , Louis C. S.
Published: November 2016

When the natural energy of a reservoir is not adequate to lift the wellbore fluid to the surface, it is necessary to use an artificial lift system that supplies the additional energy required to continue the exploitation of reservoirs.

This paper presents a trial jet pump application in the dead well of a mature oil field. The well was completed with dual strings of size 2-3/8 in. in a 7 in. casing and was producing from two separate formations. Both formations, despite of having produced for a considerable amount of time, have high reservoir pressures at present. The upper formation being produced independently via short string was loaded up for almost three years, because the API and Gas Oil Ratio (GOR) from the formation were very low along with high water cut. The lower formation had a substantial amount of gas with no water cut and was producing at significant oil rates. However, the formation being produced through the long string did not flow after shutting in for a Bottom Hole Pressure (BHP) survey. The well was unloaded by reducing surface back pressure, but it exhibited slugging behavior and an increased oil API and therefore was abandoned.

The test with hydraulic jet pump was justified by the need to revive production without a work-over. Thus, a jet pump was installed in the short string in a Sliding Side Door (SSD), and the short string was tested first with the long string being isolated. After the testing of short string independently, an SSD connected to the long string in the middle of two packers, was opened so that both formations can be produced from the same short string.

Based on the results, a dead well was successfully revitalized with the cumulative production of 380 BPD i.e., an average of 100 BOPD and 280 BWPD, which was higher than the targeted production rates evaluated for this well. Apart from this, downhole pressure data was gathered with the objectives to observe the potential of reservoir and to assist the operator for making the decision of installing jet pump on the well with or without a worker-over. Nevertheless, this technique allowed the operator to install jet pump through slick-line and consequently saved the cost of a work-over. Hence, jet pump was found to be the most efficient Artificial Lift System (ALS) and the trial achieved more than the expected performance.
Production Optimizaton and Application of Combined Artificial-Lift Systems in Deep Oil Wells
Authors: Zhao Ruidong , Zhang Xin , Liu Meng , Shi Junfeng , Su Lei , Shan Hongyu , Sun Chengyan , Miao Guojing , Wang Yuntao , Shi Liang , Zhang Mingming
Published: November 2016

For deep wells, the limitation and inefficiency of single artificial lifting method appears with increasing depth. Under some conditions, conventional single lifting method is difficult to satisfy the production requirements. Combined artificial-lift system integrates the features of two lifting techniques, and displays the advantages of both to resolve the issues which are impossible to handle with single lifting method.

In the view of lifting process principle and string structure, there are several ways to configure combined artificial-lift system. However, the design of combined consecutive lift is more complex than that of conventional single pump system. Because not only does it involve the distribution of pressure, temperature and viscosity of multiphase flowing in wellbore, but also includes intercoordination between these two pumps and respective working conditions.

In this paper, the design approach of combined lift method is established based on nodal analysis, with which intercoordination of both pumps drainage, dynamic adjustment of comprehensive parameters and setting depth interval optimization could be analyzed. All of these issues have never been considered and studied under the condition of single pump system. In Xinjiang oil field, combined lift method of sucker rod pump and injection pump has been successfully applied in wells where thin oil is doped into heavy oil to decrease the viscosity. It is shown that combined-type consecutive lifting method is feasible in field test.
New Artificial Lift Technology Changes the Game for Completion Design
Authors: Alsiemat M.. , Gambier P..
Published: November 2016

Completion and artificial lift most commonly designed by skilled and specialized engineers in there domain and misunderstand the need from each other's. This is even more accurate when it comes to the understanding of other domain such as production, reservoir, and workover. When it comes to Rig-less deployed ESP, the need to work hand in hand between the different core expertise is more accurate as the wrong design of the well could result in catastrophic implementation. Perfect completion design is most likely not achievable, and well design can always be improved, nonetheless, will proper planning and understanding of the limitations of this new ESP operations, the overall well efficiency can be greatly improved. Among the finding of this paper, the barrier philosophy and bullheading preparations should be carefully reviewed and implemented for any Rig-less deployed ESP. Ultimately, the objective of such technology is to bring increased value to the well.
Electric Submersible Progressing Cavity Pump Driven by Low-Speed Permanent Magnet Synchronous Motor
Authors: Cui Junguo , Xiao Wensheng , Zhang Xinjie , Zhang Xiao , Zhang Peng , Chen Peng , Huang Hongsheng , Wu Xiaodong
Published: November 2016

Today the number of highly-deviated and horizontal wells, viscous and heavy oil wells, sandy and waxy oil wells are increasing. Electric submersible progressing cavity pump (ESPCP) is a good measure for the new situations.

Conventional asynchronous induction motors are currently used most commonly to drive ESPCPs. For energy-efficient and shortening the conventional ESPCP system, a new system – ESPCP directly driven by low-speed permanent magnet synchronous motor (PMSM) – is developed. Compared with the conventional ESPCP system, there is no planetary gear reducer in the new system. To obtain low speed, PMSM with a 36-slot stator and a rotor built with 12 tiles of magnet adopts variable frequency drive. The rated speed of PMSM is 150rpm and the rated output torque is 611Nm.

A pipeline system simulating oil production is built and the load test is carried out, which is under different pressure and flow. The motor runs smoothly during testing and both the torque ripple and speed ripple are small. Test results show that the average efficiency of PMSM is about 70% and the power factor is near to 1. The temperature rise of PMSM is low because of lower specific heat release. The PMSM also has wider ranges of rotation frequency regulation. Now the new system is still being tested in factory and the filed test will be carried out in the near future.

The new system can pass the kick-off section of horizontal wells or deviated wells more easily, and will be a new energy-saving and cost-reducing means of oil production.
Time‐Lapse Electrical Imaging of Water Infiltration in the Context of Soil Aquifer Treatment
Authors: Haaken Klaus , Furman Alex , Weisbrod Noam , Kemna Andreas
Published: November 2016

Core Ideas

We investigated geoelectrical monitoring of water infiltration within soil aquifer treatment.

Time‐lapse ERT is able to track water infiltration under very high recurrent fluxes.

Individual apparent resistivity captures temporal dynamics of water infiltration.

Spatiotemporal ERT monitoring results used for hydraulic subsurface zonation.

In this study, we investigated the ability of online geoelectrical monitoring to characterize water dynamics in the context of soil aquifer treatment (SAT). In spring 2014, we conducted several infiltration experiments at the Shafdan SAT facility in Israel, where treated wastewater is recurrently infiltrated through large ponds into the sandy coastal plain aquifer. Temporally dense electrical resistivity tomography (ERT) measurements were collected to investigate vadose zone flow processes and the influence of heterogeneous sedimentation on the infiltration pattern. Measurements of water content as well as cross‐hole ground‐penetrating radar (GPR) profiles and lithological analyses from boreholes were used to support the ERT results. The observed electrical responses reflect the high temporal dynamics in subsurface water content associated with the applied infiltration–drying cycles. Individual apparent resistivity monitoring data captured general temporal dynamics, providing an easy and cost‐effective means for infiltration monitoring. Time‐lapse ERT results reveal different temporal dynamics in regions of the subsurface as a result of spatially varying hydraulic properties. We propose to use, based on a simple quantitative parametric description, the imaged temporal behavior of electrical conductivity to discriminate zones with different hydraulic properties, which represents a new approach for aquifer zonation based on the observed process dynamics. Our results demonstrate that time‐lapse ERT is a powerful tool for the monitoring of SAT water infiltration with high spatiotemporal resolution. The provided information may be used for assessing and optimizing applied infiltration–drying cycles and, thus, for more effective SAT management.
Structural-functional model of professionally-directed education
Authors: Koroleva Valentina Valerievna
Published: November 2016

In this paper reviewed the technology professionally-directed education in the new educational paradigm. Attempted to construct a model of the educational process. A scheme of notation structural and functional analysis.
Post-reform ballet music in the 60s of the 19th century in Russia
Authors: Panova Elena Vladimirovna
Published: November 2016

This article presents the small period of music development in Russian ballet theater, provides an assessment of ballet composers’ works and the art development influence on a musical theater in the post-reform period of the 19th century.
The development of the main sectors of Russian science in the pre-reform period of RAS
Authors: Glisin Aleksei Fedorovich
Published: November 2016

In this article the author analyzes the state and development of the main sectors of Russian science in the period preceding the beginning of the global reform in this area, in particular, reform of the RAS and its regional offices, and branch academies of sciences. Selection of academic science as an indicator of the state of scientific sphere Russia is not accidental, since the results of the companies is this sector is mainly formed and developed a system of fundamental knowledge, defining the conceptual directions of development of scientific thought and acting on applied science, development and innovation, the thus determining the development of the economy and social sphere. In this regard, the paper analyzes trends in the development of academic science in relation to the general trends of development of scientific activity in the country in order to justify the need for reform of the scientific sector. As the information base used the official statistics. According to the research the author defines the problem areas of domestic science, causing the feasibility of reforms for further sustainable development and improving efficiency
Seismic hazard assessment of the earth dams under strong earthquakes
Authors: Serebrennikov Sergey Petrovich , Dzhurik Vasiliy Ionovich , Eskin Aleksandr Yurievich , Bryzhak Evgeniy Vladimovich
Published: November 2016

The assessment approach is based on the analysis of main quantitative characteristics of strong ground motions required for the construction of earth dams in seismic zones. Methodologically, the approach to provide for appropriate zoning for hazardous industries involves conducting a process that consists of several stages typical for earth dams. The results of research are based on seismic hazard assessment for the facilities in Mongolia, Amur Region and Khabarovsk Territory.
Theory of digital crime
Authors: Ibraeva Bayan Mukushevna
Published: November 2016

Hackers seem to be the most mysterious people in the contemporary world. Where legal actions are helpless, hackers can intervene. However, not only hackers but state employees commit cyber crimes once they get power. Is it just a coincidence or authorities and hackers have lots of things in common? This article is trying to cast light on the reasons why digital crimes are committed.
A new look on the teaching profession through the analasys of modern educational standards
Authors: Shevtsova Maria Aleksandrovna
Published: November 2016

The article discusses the ways of problem solving in the sphere of pedagogical education to prepare teachers for lifelong professional self-development. The analysis and fulfillment of requirements of modern educational standards help to solve the problem of training future teachers based on system-activity approach, using personal experience of students and modern technologies. The professional teacher standard - is the main point in improving the quality of education in training teachers.
Features of formation of philosophy of Russia
Authors: Baranov Gennady Vladimirovich
Published: November 2016

In article the main content of problems and achievements of philosophy of Russia on initial stage of its history is researched; urgent achievements of the Russian philosophy in their value for modern humanitarian culture are characterized.
Teachers’ innovative activity in the alternative school
Authors: Frantseva Yulia Nikolaevna , Volkodav Tatiana Vladimirovna
Published: November 2016

The article considers the problem of implementing educational innovations in educational process on the example of the alternative schools in Toronto. The paper analyzes the structural factors and forms of teaching aimed at different ways of management of educational process. In such alternative schools, teachers and students can actively participate in the development of innovative courses and programs. The main distinguishing features of the alternative schools are: democratic practices with the participation of students and teachers as well as schools and small classes.
From Kleisli Categories to Commutative C*-algebras: Probabilistic Gelfand Duality
Authors: Furber Robert W. J. , Jacobs Bart P. F.
Published: November 2016

C*-algebras form rather general and rich mathematical structures that can be
studied with different morphisms (preserving multiplication, or not), and with
different properties (commutative, or not). These various options can be used
to incorporate various styles of computation (set-theoretic, probabilistic,
quantum) inside categories of C*-algebras. At first, this paper concentrates on
the commutative case and shows that there are functors from several Kleisli
categories, of monads that are relevant to model probabilistic computations, to
categories of C*-algebras. This yields a new probabilistic version of Gelfand
duality, involving the "Radon" monad on the category of compact Hausdorff
spaces. We then show that the state space functor from C*-algebras to
Eilenberg-Moore algebras of the Radon monad is full and faithful. This allows
us to obtain an appropriately commuting state-and-effect triangle for
C*-algebras.
Pure Nash Equilibria in Concurrent Deterministic Games
Authors: Bouyer Patricia , Brenguier Romain , Markey Nicolas , Ummels Michael
Published: November 2016

We study pure-strategy Nash equilibria in multi-player concurrent
deterministic games, for a variety of preference relations. We provide a novel
construction, called the suspect game, which transforms a multi-player
concurrent game into a two-player turn-based game which turns Nash equilibria
into winning strategies (for some objective that depends on the preference
relations of the players in the original game). We use that transformation to
design algorithms for computing Nash equilibria in finite games, which in most
cases have optimal worst-case complexity, for large classes of preference
relations. This includes the purely qualitative framework, where each player
has a single omega-regular objective that she wants to satisfy, but also the
larger class of semi-quantitative objectives, where each player has several
omega-regular objectives equipped with a preorder (for instance, a player may
want to satisfy all her objectives, or to maximise the number of objectives
that she achieves.)
Quantitative Languages Defined by Functional Automata
Authors: Filiot Emmanuel , Gentilini Raffaella , Raskin Jean-FranÃ§ois
Published: November 2016

A weighted automaton is functional if any two accepting runs on the same
finite word have the same value. In this paper, we investigate functional
weighted automata for four different measures: the sum, the mean, the
discounted sum of weights along edges and the ratio between rewards and costs.
On the positive side, we show that functionality is decidable for the four
measures. Furthermore, the existential and universal threshold problems, the
language inclusion problem and the equivalence problem are all decidable when
the weighted automata are functional. On the negative side, we also study the
quantitative extension of the realizability problem and show that it is
undecidable for sum, mean and ratio. We finally show how to decide whether the
language associated with a given functional automaton can be defined with a
deterministic one, for sum, mean and discounted sum. The results on
functionality and determinizability are expressed for the more general class of
functional group automata. This allows one to formulate within the same
framework new results related to discounted sum automata and known results on
sum and mean automata. Ratio automata do not fit within this general scheme and
different techniques are required to decide functionality.
Compositional Verification for Timed Systems Based on Automatic Invariant Generation
Authors: Astefanoaei Lacramioara , Rayana Souha Ben , Bensalem Saddek , Bozga Marius , Combaz Jacques
Published: November 2016

We propose a method for compositional verification to address the state space
explosion problem inherent to model-checking timed systems with a large number
of components. The main challenge is to obtain pertinent global timing
constraints from the timings in the components alone. To this end, we make use
of auxiliary clocks to automatically generate new invariants which capture the
constraints induced by the synchronisations between components. The method has
been implemented in the RTD-Finder tool and successfully experimented on
several benchmarks.
On the Axiomatizability of Impossible Futures
Authors: Chen Taolue , Fokkink Wan , van Glabbeek Rob
Published: November 2016

A general method is established to derive a ground-complete axiomatization
for a weak semantics from such an axiomatization for its concrete counterpart,
in the context of the process algebra BCCS. This transformation moreover
preserves omega-completeness. It is applicable to semantics at least as coarse
as impossible futures semantics. As an application, ground- and omega-complete
axiomatizations are derived for weak failures, completed trace and trace
semantics. We then present a finite, sound, ground-complete axiomatization for
the concrete impossible futures preorder, which implies a finite, sound,
ground-complete axiomatization for the weak impossible futures preorder. In
contrast, we prove that no finite, sound axiomatization for BCCS modulo
concrete and weak impossible futures equivalence is ground-complete. If the
alphabet of actions is infinite, then the aforementioned ground-complete
axiomatizations are shown to be omega-complete. If the alphabet is finite, we
prove that the inequational theories of BCCS modulo the concrete and weak
impossible futures preorder lack such a finite basis.
Positive fragments of coalgebraic logics
Authors: Balan Adriana , Kurz Alexander , Velebil Jiří
Published: November 2016

Positive modal logic was introduced in an influential 1995 paper of Dunn as
the positive fragment of standard modal logic. His completeness result consists
of an axiomatization that derives all modal formulas that are valid on all
Kripke frames and are built only from atomic propositions, conjunction,
disjunction, box and diamond. In this paper, we provide a coalgebraic analysis
of this theorem, which not only gives a conceptual proof based on duality
theory, but also generalizes Dunn's result from Kripke frames to coalgebras for
weak-pullback preserving functors. To facilitate this analysis we prove a
number of category theoretic results on functors on the categories
$\mathsf{Set}$ of sets and $\mathsf{Pos}$ of posets: Every functor
$\mathsf{Set} \to \mathsf{Pos}$ has a $\mathsf{Pos}$-enriched left Kan
extension $\mathsf{Pos} \to \mathsf{Pos}$. Functors arising in this way are
said to have a presentation in discrete arities. In the case that $\mathsf{Set}
\to \mathsf{Pos}$ is actually $\mathsf{Set}$-valued, we call the corresponding
left Kan extension $\mathsf{Pos} \to \mathsf{Pos}$ its posetification. A
$\mathsf{Set}$-functor preserves weak pullbacks if and only if its
posetification preserves exact squares. A $\mathsf{Pos}$-functor with a
presentation in discrete arities preserves surjections. The inclusion
$\mathsf{Set} \to \mathsf{Pos}$ is dense. A functor $\mathsf{Pos} \to
\mathsf{Pos}$ has a presentation in discrete arities if and only if it
preserves coinserters of `truncated nerves of posets'. A functor $\mathsf{Pos}
\to \mathsf{Pos}$ is a posetification if and only if it preserves coinserters
of truncated nerves of posets and discrete posets. A locally monotone
endofunctor of an ordered variety has a presentation by monotone operations and
equations if and only if it preserves $\mathsf{Pos}$-enriched sifted colimits.
Featherweight VeriFast
Authors: Jacobs Bart , Vogels Frédéric , Piessens Frank
Published: November 2016

VeriFast is a leading research prototype tool for the sound modular
verification of safety and correctness properties of single-threaded and
multithreaded C and Java programs. It has been used as a vehicle for
exploration and validation of novel program verification techniques and for
industrial case studies; it has served well at a number of program verification
competitions; and it has been used for teaching by multiple teachers
independent of the authors. However, until now, while VeriFast's operation has
been described informally in a number of publications, and specific
verification techniques have been formalized, a clear and precise exposition of
how VeriFast works has not yet appeared. In this article we present for the
first time a formal definition and soundness proof of a core subset of the
VeriFast program verification approach. The exposition aims to be both
accessible and rigorous: the text is based on lecture notes for a graduate
course on program verification, and it is backed by an executable
machine-readable definition and machine-checked soundness proof in Coq.
Expressive Path Queries on Graph with Data
Authors: Barcelo Pablo , Fontaine Gaelle , Lin Anthony Widjaja
Published: November 2016

Graph data models have recently become popular owing to their applications,
e.g., in social networks and the semantic web. Typical navigational query
languages over graph databases - such as Conjunctive Regular Path Queries
(CRPQs) - cannot express relevant properties of the interaction between the
underlying data and the topology. Two languages have been recently proposed to
overcome this problem: walk logic (WL) and regular expressions with memory
(REM). In this paper, we begin by investigating fundamental properties of WL
and REM, i.e., complexity of evaluation problems and expressive power. We first
show that the data complexity of WL is nonelementary, which rules out its
practicality. On the other hand, while REM has low data complexity, we point
out that many natural data/topology properties of graphs expressible in WL
cannot be expressed in REM. To this end, we propose register logic, an
extension of REM, which we show to be able to express many natural graph
properties expressible in WL, while at the same time preserving the
elementariness of data complexity of REMs. It is also incomparable to WL in
terms of expressive power.
Problems in number theory from busy beaver competition
Authors: Michel Pascal
Published: November 2016

By introducing the busy beaver competition of Turing machines, in 1962, Rado
defined noncomputable functions on positive integers. The study of these
functions and variants leads to many mathematical challenges. This article
takes up the following one: How can a small Turing machine manage to produce
very big numbers? It provides the following answer: mostly by simulating
Collatz-like functions, that are generalizations of the famous 3x+1 function.
These functions, like the 3x+1 function, lead to new unsolved problems in
number theory.
FO Model Checking of Interval Graphs
Authors: Ganian Robert , Hlineny Petr , Kral Daniel , Obdrzalek Jan , Schwartz Jarett , Teska Jakub
Published: November 2016

We study the computational complexity of the FO model checking problem on
interval graphs, i.e., intersection graphs of intervals on the real line. The
main positive result is that FO model checking and successor-invariant FO model
checking can be solved in time O(n log n) for n-vertex interval graphs with
representations containing only intervals with lengths from a prescribed finite
set. We complement this result by showing that the same is not true if the
lengths are restricted to any set that is dense in an open subset, e.g., in the
set $(1, 1 + \varepsilon)$.
Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
Authors: Latella Diego , Massink Mieke , De Vink Erik P
Published: November 2016

Labeled state-to-function transition systems, FuTS for short, are
characterized by transitions which relate states to functions of states over
general semirings, equipped with a rich set of higher-order operators. As such,
FuTS constitute a convenient modeling instrument to deal with process languages
and their quantitative extensions in particular. In this paper, the notion of
bisimulation induced by a FuTS is addressed from a coalgebraic point of view. A
correspondence result is established stating that FuTS-bisimilarity coincides
with behavioural equivalence of the associated functor. As generic examples,
the equivalences underlying substantial fragments of major examples of
quantitative process algebras are related to the bisimilarity of specific FuTS.
The examples range from a stochastic process language, PEPA, to a language for
Interactive Markov Chains, IML, a (discrete) timed process language, TPC, and a
language for Markov Automata, MAL. The equivalences underlying these languages
are related to the bisimilarity of their specific FuTS. By the correspondence
result coalgebraic justification of the equivalences of these calculi is
obtained. The specific selection of languages, besides covering a large variety
of process interaction models and modelling choices involving quantities,
allows us to show different classes of FuTS, namely so-called simple FuTS,
combined FuTS, nested FuTS, and general FuTS.
Logic and Branching Automata
Authors: Nicolas Bedon
Published: November 2016

In this paper we study the logical aspects of branching automata, as defined
by Lodaya and Weil. We first prove that the class of languages of finite N-free
posets recognized by branching automata is closed under complementation. Then
we define a logic, named P-MSO as it is a extension of monadic second-order
logic with Presburger arithmetic, and show that it is precisely as expressive
as branching automata. As a consequence of the effectiveness of the
construction of one formalism from the other, the P-MSO theory of the class of
all finite N-free posets is decidable.
Faster Existential FO Model Checking on Posets
Authors: Gajarský Jakub , Hliněný Petr , Obdržálek Jan , Ordyniak Sebastian
Published: November 2016

We prove that the model checking problem for the existential fragment of
first-order (FO) logic on partially ordered sets is fixed-parameter tractable
(FPT) with respect to the formula and the width of a poset (the maximum size of
an antichain). While there is a long line of research into FO model checking on
graphs, the study of this problem on posets has been initiated just recently by
Bova, Ganian and Szeider (CSL-LICS 2014), who proved that the existential
fragment of FO has an FPT algorithm for a poset of fixed width. We improve upon
their result in two ways: (1) the runtime of our algorithm is
O(f(|{\phi}|,w).n^2) on n-element posets of width w, compared to O(g(|{\phi}|).
n^{h(w)}) of Bova et al., and (2) our proofs are simpler and easier to follow.
We complement this result by showing that, under a certain
complexity-theoretical assumption, the existential FO model checking problem
does not have a polynomial kernel.
From nominal to higher-order rewriting and back again
Authors: Domínguez Jesús , Fernández Maribel
Published: November 2016

We present a translation function from nominal rewriting systems (NRSs) to
combinatory reduction systems (CRSs), transforming closed nominal rules and
ground nominal terms to CRSs rules and terms, respectively, while preserving
the rewriting relation. We also provide a reduction-preserving translation in
the other direction, from CRSs to NRSs, improving over a previously defined
translation. These tools, together with existing translations between CRSs and
other higher-order rewriting formalisms, open up the path for a transfer of
results between higher-order and nominal rewriting. In particular, techniques
and properties of the rewriting relation, such as termination, can be exported
from one formalism to the other.
Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion
Authors: Debois Søren , Hildebrandt Thomas , Slaats Tijs , Yoshida Nobuko
Published: November 2016

We present the first session typing system guaranteeing request-response
liveness properties for possibly non-terminating communicating processes. The
types augment the branch and select types of the standard binary session types
with a set of required responses, indicating that whenever a particular label
is selected, a set of other labels, its responses, must eventually also be
selected. We prove that these extended types are strictly more expressive than
standard session types. We provide a type system for a process calculus similar
to a subset of collaborative BPMN processes with internal (data-based) and
external (event-based) branching, message passing, bounded and unbounded
looping. We prove that this type system is sound, i.e., it guarantees
request-response liveness for dead-lock free processes. We exemplify the use of
the calculus and type system on a concrete example of an infinite state system.
Proof equivalence in MLL is PSPACE-complete
Authors: Heijltjes Willem , Houston Robin
Published: November 2016

MLL proof equivalence is the problem of deciding whether two proofs in
multiplicative linear logic are related by a series of inference permutations.
It is also known as the word problem for star-autonomous categories. Previous
work has shown the problem to be equivalent to a rewiring problem on proof
nets, which are not canonical for full MLL due to the presence of the two
units. Drawing from recent work on reconfiguration problems, in this paper it
is shown that MLL proof equivalence is PSPACE-complete, using a reduction from
Nondeterministic Constraint Logic. An important consequence of the result is
that the existence of a satisfactory notion of proof nets for MLL with units is
ruled out (under current complexity assumptions). The PSPACE-hardness result
extends to equivalence of normal forms in MELL without units, where the
weakening rule for the exponentials induces a similar rewiring problem.
Simulation Problems Over One-Counter Nets
Authors: Hofman Piotr , Lasota Slawomir , Mayr Richard , Totzke Patrick
Published: November 2016

One-counter nets (OCN) are finite automata equipped with a counter that can
store non-negative integer values, and that cannot be tested for zero.
Equivalently, these are exactly 1-dimensional vector addition systems with
states. We show that both strong and weak simulation preorder on OCN are
PSPACE-complete.
Generic algorithms for halting problem and optimal machines revisited
Authors: Bienvenu Laurent , Desfontaines Damien , Shen Alexander
Published: November 2016

The halting problem is undecidable --- but can it be solved for "most"
inputs? This natural question was considered in a number of papers, in
different settings. We revisit their results and show that most of them can be
easily proven in a natural framework of optimal machines (considered in
algorithmic information theory) using the notion of Kolmogorov complexity. We
also consider some related questions about this framework and about asymptotic
properties of the halting problem. In particular, we show that the fraction of
terminating programs cannot have a limit, and all limit points are Martin-L\"of
random reals. We then consider mass problems of finding an approximate solution
of halting problem and probabilistic algorithms for them, proving both positive
and negative results. We consider the fraction of terminating programs that
require a long time for termination, and describe this fraction using the busy
beaver function. We also consider approximate versions of separation problems,
and revisit Schnorr's results about optimal numberings showing how they can be
generalized.
Using higher-order contracts to model session types
Authors: Bernardi Giovanni , Hennessy Matthew
Published: November 2016

Session types are used to describe and structure interactions between
independent processes in distributed systems. Higher-order types are needed in
order to properly structure delegation of responsibility between processes.
In this paper we show that higher-order web-service contracts can be used to
provide a fully-abstract model of recursive higher-order session types. The
model is set-theoretic, in the sense that the meaning of a contract is given in
terms of the set of contracts with which it complies.
The proof of full-abstraction depends on a novel notion of the complement of
a contract. This in turn gives rise to an alternative to the type duality
commonly used in systems for type-checking session types. We believe that the
notion of complement captures more faithfully the behavioural intuition
underlying type duality.
No solvable lambda-value term left behind
Authors: García-Pérez Á. , Nogueira P.
Published: November 2016

In the lambda calculus a term is solvable iff it is operationally relevant.
Solvable terms are a superset of the terms that convert to a final result
called normal form. Unsolvable terms are operationally irrelevant and can be
equated without loss of consistency. There is a definition of solvability for
the lambda-value calculus, called v-solvability, but it is not synonymous with
operational relevance, some lambda-value normal forms are unsolvable, and
unsolvables cannot be consistently equated. We provide a definition of
solvability for the lambda-value calculus that does capture operational
relevance and such that a consistent proof-theory can be constructed where
unsolvables are equated attending to the number of arguments they take (their
"order" in the jargon). The intuition is that in lambda-value the different
sequentialisations of a computation can be distinguished operationally. We
prove a version of the Genericity Lemma stating that unsolvable terms are
generic and can be replaced by arbitrary terms of equal or greater order.
Non-Obfuscated Unprovable Programs & Many Resultant Subtleties
Authors: Case John , Ralston Michael
Published: November 2016

The \emph{International Obfuscated C Code Contest} was a programming contest
for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an
interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen
to be correct, but which can\emph{not} be proved correct in pre-assigned,
computably axiomatized, powerful, true theories {\bf T}. A point made by our
first theorem, then, is that, then, \emph{un}verifiable programs need
\emph{not} be obfuscated!
The first theorem and its proof is followed by a motivated, concrete example
based on a remark of Hilary Putnam.
The first theorem has some non-constructivity in its statement and proof, and
the second theorem implies some of the non-constructivity is inherent. That
result, then, brings up the question of whether there is an acceptable
programming system (numbering) for which some non-constructivity of the first
theorem disappears. The third theorem shows this is the case, but for a subtle
reason explained in the text. This latter theorem has a number of corollaries,
regarding its acceptable programming system, and providing some surprises and
subtleties about proving its program properties (including universality, and
the presence of the composition control structure). The next two theorems
provide acceptable systems with contrasting surprises regarding proving
universality in them. Finally the next and last theorem (the most difficult to
prove in the paper) provides an acceptable system with some positive and
negative surprises regarding verification of its true program properties: the
existence of the control structure composition is provable for it, but anything
about true I/O-program equivalence for syntactically unequal programs is not
provable.
Formalized linear algebra over Elementary Divisor Rings in Coq
Authors: Cano Guillaume , Cohen Cyril , Dénès Maxime , Mörtberg Anders , Siles Vincent
Published: November 2016

This paper presents a Coq formalization of linear algebra over elementary
divisor rings, that is, rings where every matrix is equivalent to a matrix in
Smith normal form. The main results are the formalization that these rings
support essential operations of linear algebra, the classification theorem of
finitely presented modules over such rings and the uniqueness of the Smith
normal form up to multiplication by units. We present formally verified
algorithms computing this normal form on a variety of coefficient structures
including Euclidean domains and constructive principal ideal domains. We also
study different ways to extend B\'ezout domains in order to be able to compute
the Smith normal form of matrices. The extensions we consider are: adequacy
(i.e. the existence of a gdco operation), Krull dimension $\leq 1$ and
well-founded strict divisibility.
Weighted Pushdown Systems with Indexed Weight Domains
Authors: Minamide Yasuhiko
Published: November 2016

The reachability analysis of weighted pushdown systems is a very powerful
technique in verification and analysis of recursive programs. Each transition
rule of a weighted pushdown system is associated with an element of a bounded
semiring representing the weight of the rule. However, we have realized that
the restriction of the boundedness is too strict and the formulation of
weighted pushdown systems is not general enough for some applications. To
generalize weighted pushdown systems, we first introduce the notion of stack
signatures that summarize the effect of a computation of a pushdown system and
formulate pushdown systems as automata over the monoid of stack signatures. We
then generalize weighted pushdown systems by introducing semirings indexed by
the monoid and weaken the boundedness to local boundedness.
Reasoning about Data Repetitions with Counter Systems
Authors: Demri Stephane , Figueira Diego , Praveen M
Published: November 2016

We study linear-time temporal logics interpreted over data words with
multiple attributes. We restrict the atomic formulas to equalities of attribute
values in successive positions and to repetitions of attribute values in the
future or past. We demonstrate correspondences between satisfiability problems
for logics and reachability-like decision problems for counter systems. We show
that allowing/disallowing atomic formulas expressing repetitions of values in
the past corresponds to the reachability/coverability problem in Petri nets.
This gives us 2EXPSPACE upper bounds for several satisfiability problems. We
prove matching lower bounds by reduction from a reachability problem for a
newly introduced class of counter systems. This new class is a succinct version
of vector addition systems with states in which counters are accessed via
pointers, a potentially useful feature in other contexts. We strengthen further
the correspondences between data logics and counter systems by characterizing
the complexity of fragments, extensions and variants of the logic. For
instance, we precisely characterize the relationship between the number of
attributes allowed in the logic and the number of counters needed in the
counter system.
Trauma Experience, Identity, and Narratives
Authors: Soesilo Aloysius
Published: November 2016

Peristiwa kekerasan dan mengerikan seperti konflik berdarah dan pembunuhan merupakan suaturealitas yang meninggalkan dampak permanen pada korban. Individu yang mengalami traumaakan terus menerus bergumul dengan makna kejadian yang telah dialami bahkan sesudah peristiwatrauma itu sendiri berlalu. Elemen kritikal bagi individu yang mengalami trauma adalah asesmensubyektif mengenai bagaimana mereka merasa terancam dan tak berdaya. Studi tentang traumasosial-psikologi menghadapkan kita pada kondisi mengenai kodrat manusia baik dari sisi terbaikmaupun terburuk.Makalah ini dimulai dengan bahasan mengenai apa yang menjadikan traumadan bagaimana trauma berpengaruh atas hidup individu yang mengalaminya. Sebagai fenomenyang berkaitan erat dengan stres, maka akan bermanfaat bila dampak trauma dipertimbangkan dariaspek diri (self), yang mana konsep self ini sendiri merupakan seperangkat faktor yang kompleks.Trauma akan menggoyangkan dan bahkan mengubah komponen struktural dan fungsional dariself. Dihadapkan dengan pengalaman trauma, individu harus memobilisasikan segenap sumber-sumber yang ada dalam diri maupun dalam lingkungannya sebagai jalan koping dengan situasihidupnya. Pembahasan tentang koping akan mencakup konseptualisasi yang lebih luas daripadaapa yang telah diusulkan oleh Lazarus. Perspektif yang lebih luas ini lebih bermanfaat bagi kitakhususnya bila kita mempelajari naratif sebagai upaya oleh individu untuk memahami danmemaknai apa yang telah menimpa diri mereka. Setiap orang memiliki motif untuk menemukanmakna, nilai-nilai (values) dan tujuan hidup, khususnya setelah mereka mengalami peristiwa yangmengancam kehidupan mereka, semua aspek ini muncul dalam naratif.
Program Manajemen Stres Kerja di Perusahaan: sebuah Petunjuk untuk Menerapkannya
Authors: Purnawati Susy
Published: November 2016

Job stress is an iceberg phenomen. A great number of unreported cases and there is no aplicativeprogram in Indonesia cause increase of job stress risk and its negative impact to productivity andcompany image. More complex job demand without appropriate work capacity and inharmonicrelationship in the work place could be the main sources of job stress. This paper is focused on jobstress management program guidance that applicable at company and physiologic stress responseand also in depth theoretical point of job stress management within psycho-physiology aspect. Theaim of this written paper is to increase awareness and understanding of the application of stressmanagement programs among occupational physician, industrial community and industrialpractices. Stress management programs in company not only post about the improvement ofworking conditions also focuses on an individual orientation. On aspects of working conditions, theimprovement should be referring to standard of occupational health and safety (OHS) -management program, while aspect of individual coping skills can be done with the training ofproblem focus technique. Several studies have shown that the program creates respond to the limbicsystem of brain which is integrated with the function of cortex frontals. In addition, it could createrespond to changes body’s homeostasis due to changes in the response of the limbic system to theHPA (hypothalamic - pituitary - adrenal) axis and SAM (symphato - Adreno - medullary) - axis.The effectiveness of the program can be measured by the subjective and objective parameters.
DESIRE AND PLEASURE IN THE BRANDED REALITY SHOW AS A DISCURSIVE PSYCHOANALYSIS
Authors: Wijaya Bambang Sukma
Published: November 2016

The study of branded reality show is still very limited, especially in the perspective of discursive psychoanalysis. In fact, the phenomenon of reality show is currently growing in the television industry, so brands are inspired to create similar programs. This paper aims to analyze the desire and pleasure of success are presented and disclosed by branded reality show ‘Diplomat Success Challenge’ on a national TV channel in Indonesia. Using discursive psychoanalysis method in the Lacanian perspective, author found that participants in the ‘Diplomat Success Challenge’ saw competitors (other participants) as ‘other’ in imaginary phase which is the object of desire in having the pleasure of success, while the audience used the praticipants as reflection of their desire and pleasure of success. There are two tendencies of the spectatorship style in responding to the discourse. In one hand the audiences tend to be more emphatic and figural, while on the other hand they tend to be more logic and systematic. In addition, the desire and pleasure of success in the ‘Diplomat Success Challenge’ becomes a powerful discourse that alienated negative issues related to the Diplomat as a tobacco product brand. Thus, the politics of reality through a discourse of success in the branded reality show has successfully infiltrated into the subconscious and control the public consciousness.