bluuebunny/crossref_metadata_2025 huggingface dataset:
Trzy kroki w stronę obrazów. Pierre Bonnard i percepcyjne opóźnienie.
Authors: Kiepuszewski Łukasz
Published: September 2018

The essay is an analysis of three interpretations of Pierre Bonnard’s paintings offered by Jean Clair, John Elderfield, and Yves-Alain Bois. Their approaches are crucial in the context of the revaluation Bonnard’s works and his place in the history of modern painting, which has been continuing since the 1980s. Today’s scholars have been interested mostly in his late works from 1920-1947. At that time the artist created a multidimensional pictorial synthesis which addressed the most advanced dilemmas which appeared in the first half of the 20th century. The critical opinions analyzed in the essay, referring to physiology and the psychology of perception, the cognitive conditions of visual perception, and specific philosophical traditions, stem from individual visual experience and demonstrate significant tensions. Taking the painting as a starting point triggers differences in interpretation not just at the level of theoretical discourse, but in respect to visualization itself. Bonnard’s works significantly program the process of visual perception – grasping the changing rhythm of relation between the center and periphery and moving toward fixations scattered in the visual field. The specific composition of paintings makes the spectator deconcentrate; it can be grasped in an act of perception which extends in time. Such  “delay” of perception means that Bonnard’s paintings are a challenge to the gestalt psychology which prevails in the analytical practice of art history. The unique quality of Bonnard’s works, based on the coexistence of the rhythms of organization and disorder,shows no superior coherence of the gestalt. They establish an “inconclusive” relation between the part and the whole, which results in continuing deference and delay of the integration of motifs and elements of the pictorial field. The discussed episode in Bonnard’s art’s reception confirms a belief that “he is not a painter for those in a hurry. The phenomenon of the perceptive delay seems to be significantly connected with the delay in discovering such qualities by art historians.
Wolność w sztuce średniowiecza
Authors: Berliner Rudolf
Published: September 2018

Wolność w sztuce średniowiecza
Jazyková kreativita při tvoření názvů nových prostředků činnosti
Authors: MATUROVÁ Markéta
Published: September 2018

Vývojové tendence současné české slovotvorby jsou lingvisty sledovány dlouhodobě a velmi zevrubně. Slovní zásoba jazyka je proměnlivá a rychle reaguje na dynamické změny ve společnosti. Důležitým faktorem je bezesporu i vliv cizích jazyků, dnes především angličtiny, která proniká do mnoha oblastí současné slovní zásoby. Některé studie se věnují utváření nových pojmenování na chatu, v e-mailové a SMS komunikaci (např. Svobodová 2005, Jandová 2006), jiné se zabývají komunikací na diskusních fórech (např. Lišková 2008, Chejnová 2009), pozornost lingvistů vzbuzují také neologismy na sociálních sítích. V této stati si budeme všímat relativně nových názvů prostředků činnosti, jež vznikly pro účely internetového obchodu Dedra.1 Naším záměrem je ukázat, byť na omezeném množství lexikálních jednotek, čím byly motivovány, které slovotvorné postupy se při vytváření pojmenování uplatnily a které slovotvorné prostředky byly přitom využity.
Szkice z dialektologii języka czeskiego 3. Czeska dialektologia od połowy XX w. i jej aktualne zadania
Authors: BOGOCZOVÁ Irena
Published: September 2018

Článek Česká dialektologie od pol. 20. stol. a její aktuální úkoly je přehledem toho, čím se zabývala česká dialektologie od konce 2. světové války po současnost. Autorka se zaměřuje na významné badatele a jejich díla, na základní úkoly (projekty), na vývoj českého dialektologického myšlení obecně. Okrajově se dotýká nové politické a společenské situace v poválečném Československu, která přinesla změny také na jazykové mapě této země. Z celostních (komplexních) prací autorka upozorňuje hlavně na Nástin české dialektologie Jaroslava Běliče a na kolektivní dílo Český jazykový atlas (díl I–VI). Výběr dílčích témat i literatury zohledňuje do jisté míry potřeby a preference polského bohemisty.
Jedem do Čechách: k nahrazování jmenných koncovek genitivu lokálem
Authors: HRDLIČKA Milan
Published: September 2018

Podoba češtiny v majoritním jinojazyčném prostředí zavisí na celé řadě jazykových i nejazykových faktorů. Společným rysem zahraničních realizací češtiny je jejich sbližování s místním dominantním jazykem. Rozlišují se tři základní důsledky jazykového kontaktu: přejímky, redukce a atrofické změny. Zahraniční vainty češtiny se vyznačují také poměrně častým nahrazováním jmenné koncovky genitivu lokálem, dochází k tomu hlavně v množném čísle. Tento jev má nářeční původ, příčinou může být i malá zvuková výraznost genitivního zakončení, které je nahrazováno foneticky zřetelnější koncovkou lokálu.
F1 query
Authors: Samwel Bart , Cieslewicz John , Handy Ben , Govig Jason , Venetis Petros , Yang Chanjun , Peters Keith , Shute Jeff , Tenedorio Daniel , Apte Himani , Weigel Felix , Wilhite David , Yang Jiacheng , Xu Jun , Li Jiexing , Yuan Zhan , Chasseur Craig , Zeng Qiang , Rae Ian , Biyani Anurag , Harn Andrew , Xia Yang , Gubichev Andrey , El-Helw Amr , Erling Orri , Yan Zhepeng , Yang Mohan , Wei Yiqun , Do Thanh , Zheng Colin , Graefe Goetz , Sardashti Somayeh , Aly Ahmed M. , Agrawal Divy , Gupta Ashish , Venkataraman Shiv
Published: September 2018

F1 Query is a stand-alone, federated query processing platform that executes SQL queries against data stored in different file-based formats as well as different storage systems at Google (e.g., Bigtable, Spanner, Google Spreadsheets, etc.). F1 Query eliminates the need to maintain the traditional distinction between different types of data processing workloads by simultaneously supporting: (i) OLTP-style point queries that affect only a few records; (ii) low-latency OLAP querying of large amounts of data; and (iii) large ETL pipelines. F1 Query has also significantly reduced the need for developing hard-coded data processing pipelines by enabling declarative queries integrated with custom business logic. F1 Query satisfies key requirements that are highly desirable within Google: (i) it provides a unified view over data that is fragmented and distributed over multiple data sources; (ii) it leverages datacenter resources for performant query processing with high throughput and low latency; (iii) it provides high scalability for large data sizes by increasing computational parallelism; and (iv) it is extensible and uses innovative approaches to integrate complex business logic in declarative query processing. This paper presents the end-to-end design of F1 Query. Evolved out of F1, the distributed database originally built to manage Google's advertising data, F1 Query has been in production for multiple years at Google and serves the querying needs of a large number of users and systems.
Real-time constrained cycle detection in large dynamic graphs
Authors: Qiu Xiafei , Cen Wubin , Qian Zhengping , Peng You , Zhang Ying , Lin Xuemin , Zhou Jingren
Published: September 2018

As graph data is prevalent for an increasing number of Internet applications, continuously monitoring structural patterns in dynamic graphs in order to generate real-time alerts and trigger prompt actions becomes critical for many applications. In this paper, we present a new system GraphS to efficiently detect constrained cycles in a dynamic graph, which is changing constantly, and return the satisfying cycles in real-time. A hot point based index is built and efficiently maintained for each query so as to greatly speed-up query time and achieve high system throughput. The GraphS system is developed at Alibaba to actively monitor various online fraudulent activities based on cycle detection. For a dynamic graph with hundreds of millions of edges and vertices, the system is capable to cope with a peak rate of tens of thousands of edge updates per second and find all the cycles with predefined constraints with a 99.9% latency of 20 milliseconds.
OctopusFS in action
Authors: Kakoulli Elena , Karmiris Nikolaos D. , Herodotou Herodotos
Published: September 2018

The continuous improvements in memory, storage devices, and network technologies of commodity hardware introduce new challenges and opportunities in tiered storage management. Whereas past work is exploiting storage tiers in pairs or for specific applications, OctopusFS---a novel distributed file system that is aware of the underlying storage media---offers a comprehensive solution to managing multiple storage tiers in a distributed setting. OctopusFS contains auto-mated data-driven policies for managing the placement and retrieval of data across the nodes and storage tiers of the cluster. It also exposes the network locations and storage tiers of the data in order to allow higher-level systems to make locality-aware and tier-aware decisions. This demonstration will showcase the web interface of OctopusFS, which enables users to (i) view detailed utilization information for the various storage tiers and nodes, (ii) browse the directory namespace and perform file-related actions, and (iii) execute caching-related operations while observing their performance impact on MapReduce and Spark workloads.
TRIPS
Authors: Li Huan , Lu Hua , Shi Feichao , Chen Gang , Chen Ke , Shou Lidan
Published: September 2018

The rapid accumulation of indoor positioning data is increasingly booming the interest in indoor mobility analyses. As a fundamental analysis, it is highly relevant to translate raw indoor positioning data into mobility semantics that describe what, where and when in a more concise and semantics-oriented way. Such a translation is challenging as multiple data sources are involved, raw indoor positioning data is of low quality, and translation results are hard to assess. We demonstrate a system
TRIPS
that streamlines the entire translation process by three functional components. The Configurator provides a standard but concise means to configure multiple input sources, including the indoor positioning data, indoor space information, and relevant contexts. The Translator cleans the indoor positioning data and exports reliable mobility semantics without manual interventions. The Viewer offers a suite of flexible operations to trace the input, output and intermediate data involved in the translation. Data analysts can interact with TRIPS to obtain the desired mobility semantics in a visual and convenient way.
A demonstration of PERC
Authors: Ke Xiangyu , Teo Michelle , Khan Arijit , Yalavarthi Vijaya Krishna
Published: September 2018

This paper demonstrates PERC --- our system for crowdsourced entity resolution with human errors. Entity Resolution (ER) is a critical step in data cleaning and analytics. Although many machine-based methods existed for ER task, crowdsourcing is becoming increasingly important since humans can provide more insightful information for complex tasks, e.g., clustering of images and natural language processing. However, human workers still make mistakes due to lack of domain expertise or seriousness, ambiguity, or even malicious intent. To this end, we present a system, called PERC (probabilistic entity resolution with crowd errors), which adopts an uncertain graph model to address the entity resolution problem with noisy crowd answers. Using our framework, the problem of ER becomes equivalent to finding the maximum-likelihood clustering. In particular, we propose a novel metric called "reliability" to measure the quality of a clustering, which takes into account both the connected-ness inside and across all clusters. PERC then automatically selects the next question to ask the crowd that maximally increases the "reliability" of the current clustering.

This demonstration highlights (1) a reliability-based next crowd-sourcing framework for crowdsourced ER, which does not require any user-defined threshold, and no apriori information about the error rate of the crowd workers, (2) it improves the ER quality by 15% and reduces the crowdsourcing cost by 50% compared to state-of-the-art methods, and (3) its GUI can interact with users to help them compare different crowdsourced ER algorithms, their intermediate ER results as they progress, and their selected next crowdsourcing questions in a user-friendly manner. Our demonstration video is at: https://www.youtube.com/watch?v=rQ7nu3b8zXY.
CDB
Authors: Li Guoliang , Chai Chengliang , Fan Ju , Weng Xueping , Li Jian , Zheng Yudian , Li Yuanbing , Yu Xiang , Zhang Xiaohang , Yuan Haitao
Published: September 2018

Crowd-powered database systems can leverage the crowd's ability to address machine-hard problems, e.g., data integration. Existing crowdsourcing systems adopt the traditional tree model to select a good query plan. However, the tree model can optimize the I/O cost but cannot optimize the monetary cost, latency and quality, which are three important optimization goals in crowdsourcing. To address this limitation, we demonstrate CDB, a crowd-powered database system. CDB proposes a new graph-based model that adopts a fine-grained tuple-level optimization model which significantly outperforms existing coarse-grained tree-based optimization models. Moreover, CDB provides a unified framework to simultaneously optimize the monetary cost, quality and latency. We have deployed CDB on well-known crowd-sourcing platforms and users can easily use our system to deploy their applications. We will demonstrate how to use CDB to address real-world applications, including web table integration and entity collection.
Maverick
Authors: Zhang Gensheng , Li Chengkai
Published: September 2018

This paper presents Maverick, a system for discovering exceptional facts about entities in knowledge graphs. Maverick is built upon a beam-search based algorithmic framework which we proposed in a research paper that is published in SIGMOD 2018. In this demonstration proposal, we showcase an end-to-end system that includes a user-facing portal and a cache server. In Maverick, an exceptional fact about an entity of interest is modeled as a context-subspace pair, in which the subspace is a set of attributes and the context is defined by a graph query pattern of which the entity is a match, together with other matching entities. The entity is exceptional among the entities in the context, with regard to the sub-space. The portal allows users to search entities in a knowledge graph and explores exceptional facts about the entities of interest. It presents exceptional facts to users in forms of natural language sentences and illustration charts, for better interpretability of the discovered exceptional facts. The cache server stores intermediate computation results, such as pattern evaluations, exceptionality calculations, and candidate patterns. It is built for sharing computation across entities, such that repetitive computation across entities can be avoided.
HYDRA
Authors: Sanghi Anupam , Sood Raghav , Singh Dharmendra , Haritsa Jayant R. , Tirthapura Srikanta
Published: September 2018

A core requirement of database engine testing is the ability to create synthetic versions of the customer's data warehouse at the vendor site. Prior work on synthetic data regeneration suffers from critical limitations with regard to (a) scaling to large data volumes, (b) handling complex query workloads, and (c) producing data on demand. In this demo, we present
HYDRA
, a workload-dependent dynamic data regenerator, that materially addresses these limitations. It introduces the concept of dynamic regeneration by constructing a minuscule memory-resident database summary that can on-the-fly regenerate databases of arbitrary size during query execution. Further, since the data is generated in memory, the velocity of generation can be closely regulated. Finally, to complement dynamic regeneration, Hydra also ensures that the process of summary construction is data-scale-free.
NLproveNAns
Authors: Deutch Daniel , Frost Nave , Gilad Amir , Haimovich Tomer
Published: September 2018

Natural language (NL) interfaces to databases allow users without technical background to query the database and get the results. Users of such systems may be surprised by the absence of certain expected results. To this end, we propose to demonstrate NLProveNAns, a system that allows non-expert users to view explanations for non-answers of interest. The explanations are shown in an intuitive manner, by highlighting parts of the original NL query that are intuitively "responsible" for the absence of the expected result. Our solution builds upon and combines recent advancements in Natural Language Interfaces to Databases and models for why-not provenance. In particular, the systems can provide explanations in one of two flavors corresponding to two different why-not provenance models: a short explanation based on the
frontier picky
model, and a detailed explanation based on the why-not
polynomial
model.
Discovering diversified paths in knowledge bases
Authors: Aebeloe Christian , Montoya Gabriela , Setty Vinay , Hose Katja
Published: September 2018

Vast amounts of world knowledge is now accessible through Knowledge Graphs (KGs) in RDF format and can be queried using SPARQL. Yet, finding paths between nodes in such graphs is not part of the official SPARQL 1.1 standard; only the simpler functionality of checking reachability is supported, i.e., assessing whether two nodes are connected based on certain conditions formalized as property paths but without providing information on how they are actually connected. To close this gap of functionality, we present J
edi
, a system that extends a popular SPARQL engine, Jena, with the ability to compute paths connecting entities in a KG. J
edi
shows the
k
most relevant results to the user where relevance is assessed as a trade-off between path length and diversification of the intermediate nodes in the path. Furthermore, our solution is not limited to a single property path pattern but supports queries containing multiple property path patterns. While J
edi
supports arbitrary KGs, for demonstration purposes some predefined KGs, such as YAGO and DBLP, will be used.
A collaborative framework for tweaking properties in a synthetic dataset
Authors: Zhang J. W. , Wang Yu , Tay Y. C.
Published: September 2018

Researchers and developers use benchmarks to compare their algorithms and products. For database systems, a benchmark must have a dataset
D.
To be application-specific, this dataset
D
should be empirical. However, a real
D
may be too small, or too large, for the benchmarking experiments. Therefore,
D
must first be scaled to the desired size.

Previous related work typically extracts a set of properties Π = {
π
1
, . . . , π

n

} from
D,
then use Π to generate the synthetic D~. Π may thus ensure D~ is similar to
D.
This approach of having some monolithic software enforce properties π
1
, . . . , π

n

becomes increasingly intractable as
n
increases. Our demonstration will present ASPECT, a framework that takes a different approach.

With ASPECT, there is a tool
So
to first scale the dataset size. The resulting D~ can then be tweaked by tools
T
1
, . . . ,

T
n

, where

T
k

enforces

π
k

in D~.

At the demonstration, a visitor has a choice of (i)
D
, (ii) size scaler
S
0
,
(iii) the subset of properties to enforce, and (iv) the order of applying the tools for the chosen properties. The visitor can then see the enforcement error for each

π
k

and the running time for each

T
k
.

A video of the demonstration is presented here: http://scaler.d2.comp.nus.edu.sg/
CYADB
Authors: Shang Zechao , Brackenbury Will , Elmore Aaron J. , Franklin Michael J.
Published: September 2018

Data completeness is becoming a significant roadblock in data quality. Existing research in this area currently handles the certainty of a query by ignoring the incomplete part and approximating missing attributes on partially complete tuples, but leaves open the question of how the missing data affect the quality of the results. This is particularly challenging when entire tuples are absent, which can affect query certainty in ways that are not immediately obvious. To aid this, we propose
cyadb
, a database that "covers your ask" by assessing the quality of a query answer when data are missing.
cyadb
is a human-in-the-loop system, in which the data owner utilizes his or her domain knowledge of data to specify aspects of the missing data, such as where it might be missing ("where"), how many data points are missing ("how many"), and how large the missing data points could be in comparison to the provided data ("how big"). Using this,
cyadb
calculates the query's missing sensitivity, the maximal size of the effect that the missing data could have on the given query. Additionally,
cyadb
provides concrete examples of missing data that match the missing sensitivity to help the user interactively refine the provided domain knowledge.
Dfanalyzer
Authors: Silva Vítor , de Oliveira Daniel , Valduriez Patrick , Mattoso Marta
Published: September 2018

We present DfAnalyzer, a tool that enables monitoring, debugging, steering, and analysis of dataflows while being generated by scientific applications. It works by capturing strategic domain data, registering provenance and execution data to enable queries at runtime. DfAnalyzer provides lightweight dataflow monitoring components to be invoked by high performance applications. It can be plugged in scientific code scripts, or Spark applications, in the same way users already plug visualization library components. During this demo, we will show how DfAnalyzer captures the dataflow, provenance, as well as how it provides runtime data analyses of applications. We will also encourage attendees to use DfAnalyzer for their own applications.
Efficient adaptive detection of complex event patterns
Authors: Kolchinsky Ilya , Schuster Assaf
Published: September 2018

Complex event processing (CEP) is widely employed to detect occurrences of predefined combinations (patterns) of events in massive data streams. As new events are accepted, they are matched using some type of evaluation structure, commonly optimized according to the statistical properties of the data items in the input stream. However, in many real-life scenarios the data characteristics are never known in advance or are subject to frequent on-the-fly changes. To modify the evaluation structure as a reaction to such changes, adaptation mechanisms are employed. These mechanisms typically function by monitoring a set of properties and applying a new evaluation plan when significant deviation from the initial values is observed. This strategy often leads to missing important input changes or it may incur substantial computational overhead by over-adapting.

In this paper, we present an efficient and precise method for dynamically deciding whether and how the evaluation structure should be reoptimized. This method is based on a small set of constraints to be satisfied by the monitored values, defined such that a better evaluation plan is guaranteed if any of the constraints is violated. To the best of our knowledge, our proposed mechanism is the first to provably avoid false positives on reoptimization decisions. We formally prove this claim and demonstrate how our method can be applied on known algorithms for evaluation plan generation. Our extensive experimental evaluation on real-world datasets confirms the superiority of our strategy over existing methods in terms of performance and accuracy.
Robustness metrics for relational query execution plans
Authors: Wolf Florian , Brendle Michael , May Norman , Willems Paul R. , Sattler Kai-Uwe , Grossniklaus Michael
Published: September 2018

The quality of query execution plans in database systems determines how fast a query can be executed. It has been shown that conventional query optimization still selects sub-optimal or even bad execution plans, due to errors in the cardinality estimation. Although cardinality estimation errors are an evident problem, they are in general not considered in the selection of query execution plans. In this paper, we present three novel metrics for the robustness of relational query execution plans w.r.t. cardinality estimation errors. We also present a novel plan selection strategy that takes both, estimated cost and estimated robustness into account, when choosing a plan for execution. Finally, we share the results of our experimental comparison between robust and conventional plan selection on real world and synthetic benchmarks, showing a speedup of at most factor 3.49.
Explaining repaired data with CFDs
Authors: Rammelaere Joeri , Geerts Floris
Published: September 2018

Many popular data cleaning approaches are rule-based: Constraints are formulated in a logical framework, and data is considered dirty if constraints are violated. These constraints are often discovered from data, but to ascertain their validity, user verification is necessary. Since the full set of discovered constraints is typically too large for manual inspection, recent research integrates user feedback into the discovery process. We propose a different approach that employs user interaction
only at the start
of the algorithm: a user manually cleans a small set of dirty tuples, and we infer the constraint underlying those repairs, called an
explanation
. We make use of conditional functional dependencies (CFDs) as the constraint formalism. We introduce XP
lode
, an on-demand algorithm which discovers the best explanation for a given repair. Guided by this explanation, data can then be cleaned using state-of-the-art CFD-based cleaning algorithms. Experiments on synthetic and real-world datasets show that the best explanation can typically be inferred using a limited number of modifications. Moreover, XP
lode
is substantially faster than discovering all CFDs that hold on a dataset, and is robust to noise in the modifications.
Vocalizing large time series efficiently
Authors: Trummer Immanuel , Bryan Mark , Narasimha Ramya
Published: September 2018

We vocalize query results for time series data. We describe a holistic approach that integrates query evaluation and vocalization. In particular, we generate only those parts of the query result that are relevant for voice output.

We exploit the fact that voice output has to be concise and simple to be understandable for listeners. Hence, the problem of generating voice output reduces to choosing between several coarse-grained alternatives. To make that choice, it is sufficient to evaluate the time series at a few carefully chosen locations. We use techniques from the area of optimal experimental design to choose optimal sampling points. Our algorithm is iterative and generates in each iteration a set of promising voice description candidates. We consider multiple metrics when generating voice descriptions, including the accuracy of description as well as its complexity and length. Then, we choose a near-optimal batch of sampling points to refine our choice between promising candidates.

We compare this algorithm experimentally against several baselines, demonstrating superior performance in terms of execution time and output quality. We also conducted a user study, showing that it enables users to execute simple exploratory data analysis via voice descriptions alone. We also compare against visual interfaces and sonification (i.e., non-speech sound) interfaces in terms of user performance.
A unified approach to route planning for shared mobility
Authors: Tong Yongxin , Zeng Yuxiang , Zhou Zimu , Chen Lei , Ye Jieping , Xu Ke
Published: September 2018

There has been a dramatic growth of shared mobility applications such as ride-sharing, food delivery and crowdsourced parcel delivery. Shared mobility refers to transportation services that are shared among users, where a central issue is
route planning
. Given a set of workers and requests, route planning finds for each worker a route,
i.e.
, a sequence of locations to pick up and drop off passengers/parcels that arrive from time to time, with different optimization objectives. Previous studies lack practicability due to their conflicted objectives and inefficiency in inserting a new request into a route, a basic operation called
insertion
. In this paper, we present a unified formulation of route planning called URPSM. It has a well-defined parameterized objective function which eliminates the contradicted objectives in previous studies and enables flexible multi-objective route planning for shared mobility. We prove the problem is NP-hard and there is no polynomial-time algorithm with constant competitive ratio for the URPSM problem and its variants. In response, we devise an effective and efficient solution to address the URPSM problem approximately. We design a novel dynamic programming (DP) algorithm to accelerate the insertion operation from cubic or quadric time in previous work to only linear time. On basis of the DP algorithm, we propose a greedy based solution to the URPSM problem. Experimental results on real datasets show that our solution outperforms the state-of-the-arts by 1.2 to 12.8 times in effectiveness, and also runs 2.6 to 20.7 times faster.
Exploiting coroutines to attack the "killer nanoseconds"
Authors: Jonathan Christopher , Minhas Umar Farooq , Hunter James , Levandoski Justin , Nishanov Gor
Published: September 2018

Database systems use many pointer-based data structures, including hash tables and B+-trees, which require extensive "pointer-chasing." Each pointer dereference, e.g., during a hash probe or a B+-tree traversal, can result in a CPU cache miss, stalling the CPU. Recent work has shown that CPU stalls due to main memory accesses are a significant source of overhead, even for cache-conscious data structures, and has proposed techniques to reduce this overhead, by hiding memory-stall latency. In this work, we compare and contrast the state-of-the-art approaches to reduce CPU stalls due to cache misses for pointer-intensive data structures. We present an in-depth experimental evaluation and a detailed analysis using four popular data structures: hash table, binary search, Masstree, and Bw-tree. Our focus is on understanding the practicality of using coroutines to improve throughput of such data structures. The implementation, experiments, and analysis presented in this paper promote a deeper understanding of how to exploit coroutines-based approaches to build highly efficient systems.
The tao of inference in privacy-protected databases
Authors: Bindschaedler Vincent , Grubbs Paul , Cash David , Ristenpart Thomas , Shmatikov Vitaly
Published: September 2018

To protect database confidentiality even in the face of full compromise while supporting standard functionality, recent academic proposals and commercial products rely on a mix of encryption schemes. The recommendation is to apply strong, semantically secure encryption to the "sensitive" columns and protect other columns with property-revealing encryption (PRE) that supports operations such as sorting.

We design, implement, and evaluate a new methodology for inferring data stored in such encrypted databases. The cornerstone is the
multinomial attack
, a new inference technique that is analytically optimal and empirically outperforms prior heuristic attacks against PRE-encrypted data. We also extend the multinomial attack to take advantage of correlations across multiple columns. This recovers PRE-encrypted data with sufficient accuracy to then apply machine learning and record linkage methods to infer columns protected by semantically secure encryption or redaction.

We evaluate our methodology on medical, census, and union-membership datasets, showing for the first time how to infer full database records. For PRE-encrypted attributes such as demographics and ZIP codes, our attack outperforms the best prior heuristic by a factor of 16. Unlike any prior technique, we also infer attributes, such as incomes and medical diagnoses, protected by strong encryption. For example, when we infer that a patient in a hospital-discharge dataset has a mental health or substance abuse condition, this prediction is 97% accurate.
Building Objective Thoughts: Stumpf, Twardowski and the Late Husserl on Psychic Products
Authors: Taieb Hamid
Published: September 2018

Some Austro-German philosophers considered thoughts to be mind-dependent entities, that is, psychic products. Yet these authors also attributed “objectivity” to thoughts: distinct thinking subjects can have mental acts with “qualitatively” the same content. Moreover, thoughts, once built, can exist beyond the life of their inventor, “embodied” in “documents”. At the beginning of the 20th century, the notion of “psychic product” was at the centre of the debates on psychologism; a hundred years later, it is rather at the margins of the history of philosophy. While Twardowski’s theory of products has been frequently studied, those of Stumpf and the late Husserl have been much less discussed. A presentation of the Austro-German debates about psychic products is all the more important since these discussions might be of direct interest for contemporary philosophy of mind and epistemology. This paper examines the Austro-German notion of psychic products in Stumpf, Twardowski, and the later Husserl.
Trudinger–Moser Inequalities in Fractional Sobolev–Slobodeckij Spaces and Multiplicity of Weak Solutions to the Fractional-Laplacian Equation
Authors: Zhang Caifeng
Published: September 2018

In line with the Trudinger–Moser inequality in the fractional Sobolev–Slobodeckij space due to [S. Iula, A note on the Moser–Trudinger inequality in Sobolev–Slobodeckij spaces in dimension one, Atti Accad. Naz. Lincei Rend. Lincei Mat. Appl. 28 2017, 4, 871–884] and [E. Parini and B. Ruf, On the Moser–Trudinger inequality in fractional Sobolev–Slobodeckij spaces, Atti Accad. Naz. Lincei Rend. Lincei Mat. Appl. 29 2018, 2, 315–319], we establish a new version of the Trudinger–Moser inequality in

W

s
,
p

⁢

(

ℝ
N

)

{W^{s,p}(\mathbb{R}^{N})}

. Define

∥
u
∥

1
,
τ

=

(

[
u
]

W

s
,
p

⁢

(

ℝ
N

)

p

+

τ
⁢

∥
u
∥

p
p

)

1
p

 

for any 
⁢
τ

>
0

.

\lVert u\rVert_{1,\tau}=\bigl{(}[u]^{p}_{W^{s,p}(\mathbb{R}^{N})}+\tau\lVert u% \rVert_{p}^{p}\bigr{)}^{\frac{1}{p}}\quad\text{for any }\tau>0.

There holds

sup

u
∈

W

s
,
p

⁢

(

ℝ
N

)

,

∥
u
∥

1
,
τ

≤
1

⁡

∫

ℝ
N

Φ

N
,
s

⁢

(

α
⁢

|
u
|

N

N
-
s

)

<

+
∞

,

\sup_{u\in W^{s,p}(\mathbb{R}^{N}),\lVert u\rVert_{1,\tau}\leq 1}\int_{\mathbb% {R}^{N}}\Phi_{N,s}\bigl{(}\alpha\lvert u\rvert^{\frac{N}{N-s}}\bigr{)}<+\infty,

where

s
∈

(
0
,
1
)

{s\in(0,1)}

,

s
⁢
p

=
N

{sp=N}

,

α
∈

[
0
,

α
*

)

{\alpha\in[0,\alpha_{*})}

and

Φ

N
,
s

⁢

(
t
)

=

e
t

-

∑

i
=
0

j
p

-
2

t
j

j
!

.

\Phi_{N,s}(t)=e^{t}-\sum_{i=0}^{j_{p}-2}\frac{t^{j}}{j!}.

Applying this result, we establish sufficient conditions for the existence of weak solutions to the following quasilinear nonhomogeneous fractional-Laplacian equation:

(

-
Δ

)

p
s

⁢
u
⁢

(
x
)

+

V
⁢

(
x
)

⁢

|

u
⁢

(
x
)

|

p
-
2

⁢
u
⁢

(
x
)

=

f
⁢

(
x
,
u
)

+

ε
⁢
h
⁢

(
x
)

 

in 
⁢

ℝ
N

,

(-\Delta)_{p}^{s}u(x)+V(x)\lvert u(x)\rvert^{p-2}u(x)=f(x,u)+\varepsilon h(x)% \quad\text{in }\mathbb{R}^{N},

where

V
⁢

(
x
)

{V(x)}

has a positive lower bound,

f
⁢

(
x
,
t
)

{f(x,t)}

behaves like

e

α
⁢

|
t
|

N
/

(

N
-
s

)

{e^{\alpha\lvert t\rvert^{N/(N-s)}}}

,

h
∈

(

W

s
,
p

⁢

(

ℝ
N

)

)

*

{h\in(W^{s,p}(\mathbb{R}^{N}))^{*}}

and

ε
>
0

{\varepsilon>0}

. Moreover, we also derive a weak solution with negative energy.
Loop Type Subcontinua of Positive Solutions for Indefinite Concave-Convex Problems
Authors: Kaufmann Uriel , Ramos Quoirin Humberto , Umezu Kenichiro
Published: September 2018

We establish the existence of loop type subcontinua of nonnegative solutions for a class of concave-convex type elliptic equations with indefinite weights, under Dirichlet and Neumann boundary conditions. Our approach depends on local and global bifurcation analysis from the zero solution in a nonregular setting, since the nonlinearities considered are not differentiable at zero, so that the standard bifurcation theory does not apply. To overcome this difficulty, we combine a regularization scheme with a priori bounds, and Whyburn’s topological method. Furthermore, via a continuity argument we prove a positivity property for subcontinua of nonnegative solutions. These results are based on a positivity theorem for the associated concave problem proved by us, and extend previous results established in the powerlike case.
Labor supply, income distribution, and tax progressivity in a search model
Authors: Fu Zhiming , Wu Liang , Zhuang Ziguan
Published: September 2018

We develop a search model with risk-averse households to study the impact of tax progressivity on labor supply and income inequality across education groups. Labor supply responses are considered along both intensive and extensive margins. Our quantitative results are consistent with those of the existing empirical literature. First, we find that a decline in tax progressivity associated with the Tax Reform Act of 1986 has a significant impact on the aggregate labor supply with approximately 61 percent occurred along the extensive margin. Second, households differ in their labor and income responses to tax reform. A decline in tax progressivity changes the income composition of each household by affecting labor supplies and asset holdings. This leads to an increase in income inequality. Therefore, the tax share paid by the most educated group rises due to an increase in capital income after tax reforms are instituted.
Normal elements of noncommutative Iwasawa algebras over SL3(ℤ_
p
)
Authors: Han Dong , Wei Feng
Published: September 2018

Let p be a prime integer and let

ℤ
p

{\mathbb{Z}_{p}}

be the ring of
p-adic integers. By a purely computational approach we prove that each nonzero normal
element of a noncommutative Iwasawa algebra over the special linear group

SL
3

⁢

(

ℤ
p

)

{\mathrm{SL}_{3}(\mathbb{Z}_{p})}

is a unit.
This gives a positive answer to an open question in
[F. Wei and D. Bian,
Erratum: Normal elements of completed group algebras
over

SL
n

⁢

(

ℤ
p

)

\mathrm{SL}_{n}(\mathbb{Z}_{p})

[mr2747414],
Internat. J. Algebra Comput. 23 2013, 1, 215]
and makes up for an earlier mistake in
[F. Wei and D. Bian,
Normal elements of completed group algebras over

SL
n

⁢

(

ℤ
p

)

\mathrm{SL}_{n}(\mathbb{Z}_{p})

,
Internat. J. Algebra Comput. 20 2010, 8, 1021–1039]
simultaneously.
Awareness of bicycle light use of young adults
Authors: Chow Ronald , Hollenberg Drew , Viehweger Jaclyn , LaPierre Sydney , Pettit Trevor , Hui Harrison , Dzulynsky Raissa
Published: September 2018

Helmet use amongst bicyclists has been well documented in recent literature. Helmet use is not the only measure cyclists can take to reduce their chance of crashes. Many places, in addition to mandating helmet use by law for youths, also require bicycle lights to be used under low-light conditions (i.e. during sunrise, during sunset and at night). The aim of this study was to investigate the awareness of bicycle light use amongst young adults, with respect to the legalities and also utility of lights while cycling. An anonymous survey was developed and circulated to young adults in Canada, Ireland and the United States of America. A total of 112 individuals completed the survey. Only 13% of individuals had an unsatisfactory knowledge of bicycle light use. As knowledge is the first step towards advocating for new measures, young adults seem well -versed with respect to bicycle light use and may be able to be targeted to increase bicycle light use. Frequency of commute was related to the knowledge of bicycle light use; those who commuted more regularly were more knowledgeable. This study, however, was composed primarily of young adults residing in Canada. Future studies could investigate knowledge among young adults who reside in a region that more regularly commutes using a bicycle, to see whether this trend holds.
Feenreste: Zur latenten Feenhaftigkeit hofferner Frauenfiguren in
Diu Crône
Heinrichs von dem Türlin
Authors: Wiesinger Michaela
Published: September 2018

Es ist eine anerkannte Forschungsmeinung, dass im höfischen Roman in der Figur der Fee Reste keltischer Mythen bewahrt worden sind. In mittelhochdeutschen Texten ist das jedoch nur noch in sehr abgeschwächter Form sichtbar, da andersweltliche Frauenfiguren in höfischen Romanen meist in den Artushof integriert werden und damit ihr antagonistisches Potential und auch ihre Handlungsmacht verlieren. Entgegen der etablierten These, dass diese Integration unumkehrbar vonstattengeht, möchte dieser Aufsatz die Frage stellen, ob das in Texten, die mit mythischen Residuen spielen und sich durch eine Allgegenwärtigkeit des Wunderbaren auszeichnen, wirklich der Fall ist. Am Beispiel der Crône soll gezeigt werden, dass die Anderweltlichkeit der Frauenfiguren durch die Nähe zum Artushof nicht völlig aufgelöst, sondern lediglich in die Latenz verdrängt wird und unter bestimmten Bedingungen wieder reaktiviert werden kann. Armin Schulz folgend, wird die These aufgestellt, dass die Fee als Erzählfunktion viel stärker die Zeichnung der Frauenfiguren in der Crône prägt, als vordergründig ersichtlich ist.
Research on the Spatial Reconstruction of University Libraries: A Case Study of Liu Xiao Ling Tong Book Pavilion of Yunnan Normal University
Authors: Chen Xin , Liu Yingxi
Published: September 2018

With the spatial culture theory as the basis and from the perspective of cultural heritage, this paper elucidates the construction of the Liu Xiao Ling Tong Book Pavilion of Yunnan Normal University (which may also be interpreted as a Traditional Culture Commons), introduces modern library concepts such as ‘celebrity charm’, featured resources and space reconstruction, as well as provides enlightenment to the library cycle with Chinese wisdom and experience. This paper applies participant observation method, interviewing method and textual analysis method with the data collection period from September 2015 to December 2016. Through library space reconstruction and the inheritance of certain outstanding features of Chinese culture, the Liu Xiao Ling Tong Book Pavilion has had an influence among university faculty and students, the university library circle in China and even the entire education circle, while also complemented and improved the applicability of the spatial culture theory in the library circumstance.
The efficacy and safety of enoxaparin: a meta-analysis
Authors: Hai-long Wang , Xiao-hua Pang , Jian-jun Yang
Published: September 2018

The efficacy and safety of enoxaparin (ENOX) in percutaneous coronary intervention (PCI) for ST-elevation myocardial infarction (STEMI) remains unaddressed. The primary endpoint evaluated was myocardial infarction (MI) or death. The secondary endpoint was defined as major bleeding complications. Studies comparing the differences in the efficacy and safety of ENOX versus unfractionated heparin (UFH) in PCI for the treatment of STEMI were evaluated. We presented the odds ratios for individual studies and performed heterogeneity, quality assessment, and publication bias analysis. This meta-analysis examined four randomized controlled trials (RCTs), and 5585 patients were included (2334 ENOX patients and 3251 UFH patients). The follow-up period of the endpoints was 30 or 90 days. Compared with UFH, ENOX significantly reduced the incidence of MI (OR, 0.74; P<0.01) and death (OR, 0.74; P<0.03), while there was no significant difference between the two treatments on major bleeding (OR,0.81; P=0.33). The findings from this meta-analysis suggested that the efficacy and safety of ENOX in the treatment of STEMI patients undergoing PCI were significantly better than patients treated with UFH. According to this meta-analysis, ENOX is the preferred anticoagulant for STEMI patients receiving PCI compared to UFH.
Crystal structure of aqua-bis(1,5-dimethyl-2-phenyl-4-(((E)-4-pyridylmethylene)amino)pyrazolidin-3-one-κN)-(nitrato-κO)-(nitrato-κ2
O,O′)zinc(II), C34H34N10O9Zn
Authors: Pang Haixia , Zou Xiaoqing , Xu Baoming , Zhang Hong
Published: September 2018

C34H34N10O9Zn, monoclinic, P1̄ (no. 2), a = 10.1188(13) Å, b = 12.9297(16) Å, c = 15.0668(19) Å, α = 88.032(2)°, β = 75.277(2)°, γ = 72.888(2)°, V = 1820.4(4) Å3, Z = 2, R
gt(F) = 0.0668, wR
ref(F
2) = 0.1406, T = 298(2) K.
A variable selection approach in the multivariate linear model: an application to LC-MS metabolomics data
Authors: Perrot-Dockès Marie , Lévy-Leduc Céline , Chiquet Julien , Sansonnet Laure , Brégère Margaux , Étienne Marie-Pierre , Robin Stéphane , Genta-Jouve Grégory
Published: September 2018

Omic data are characterized by the presence of strong dependence structures that result either from data acquisition or from some underlying biological processes. Applying statistical procedures that do not adjust the variable selection step to the dependence pattern may result in a loss of power and the selection of spurious variables. The goal of this paper is to propose a variable selection procedure within the multivariate linear model framework that accounts for the dependence between the multiple responses. We shall focus on a specific type of dependence which consists in assuming that the responses of a given individual can be modelled as a time series. We propose a novel Lasso-based approach within the framework of the multivariate linear model taking into account the dependence structure by using different types of stationary processes covariance structures for the random error matrix. Our numerical experiments show that including the estimation of the covariance matrix of the random error matrix in the Lasso criterion dramatically improves the variable selection performance. Our approach is successfully applied to an untargeted LC-MS (Liquid Chromatography-Mass Spectrometry) data set made of African copals samples. Our methodology is implemented in the R package MultiVarSel which is available from the Comprehensive R Archive Network (CRAN).
Reducing measurement uncertainties of high-pressure gas flow calibrations by using reference values based on multiple independent traceability chains
Authors: van der Grinten Jos , Foulon Henri , Gunnarsson Arnthor , Mickan Bodo
Published: September 2018

This paper describes the recently updated realization of the harmonized cubic metre for natural gas. It is a procedure based on an intercomparison, that combines the mutually independent traceability chains of four primary laboratories in the field of high-pressure gas flow measurement. The reference value, also called harmonized cubic metre, is the weighted average of at least two laboratories with weighing factors that are inversely proportional to the squared uncertainties of the calibration results. This results in lower uncertainties for the laboratories as long as the stochastic contributions (Type A) to the overall measurement uncertainties are significantly smaller than the uncertainties arising from the traceability chain (Type B). This condition is fulfilled in practice as traceability uncertainties are at least a factor ten greater than the other uncertainty sources. When evaluating the data of intercomparisons, curve fitting is used for the representation of the calibration data. A polynomial equation of maximum four degrees, expressed in the logarithm of the flow Reynolds number, proves to be the optimum choice for fitting the calibration curve of the turbine gasmeters.