scholarly journals Complexity and learnability in the explanation of semantic universals of quantifiers

2019 ◽  
Author(s):  
Iris van de Pol ◽  
Shane Steinert-Threlkeld ◽  
Jakub Szymanik
Keyword(s):  
Exploratory Study ◽  
Kolmogorov Complexity ◽  
Natural Languages ◽  
Fine Grained ◽  
Important Challenge ◽  
Robust Result

Despite wide variation among natural languages, there are linguistic properties universal to all (or nearly all) languages. An important challenge is to explain why these linguistic universals hold. One explanation employs a learnability argument: semantic universals hold because expressions that satisfy them are easier to learn than those that do not. In an exploratory study we investigate the relation between learnability and complexity and whether the presence of semantic universals for quantifiers can also be explained by differences in complexity. We develop a novel application of (approximate) Kolmogorov complexity to measure fine-grained distinctions in complexity between different quantifiers. Our results indicate that the monotonicity universal can be explained by complexity while the conservativity universal cannot. For quantity we did not find a robust result. We also found that learnability and complexity pattern together in the monotonicity and conservativity cases that we consider, while that pattern is less robust in the quantity cases.

Ineffabilities of Making Music: An Exploratory Study

2006 ◽  
Vol 37 (1) ◽  
pp. 9-23 ◽  
Author(s):  
Daniel A. Schmicking
Keyword(s):  
Exploratory Study ◽  
Musical Instrument ◽  
Verbal Interaction ◽  
Embodied Perception ◽  
Fine Grained ◽  
Sensorimotor Knowledge ◽  
A Performance

Some facets of making music are explored by combining arguments of Raffman's cognitivist explanation of ineffability with Merleau-Ponty's view of embodied perception. Behnke's approach to a phenomenology of playing a musical instrument serves as a further source. Focusing on the skilled performer-listener, several types of ineffable knowledge of performing music are identified: gesture feeling ineffability—the performer's sensorimotor knowledge of the gestures necessary to produce instrumental sounds is not exhaustively communicable via language; gesture nuance ineffability—the performer is aware of nuances of instrumental gestures, e.g., micro-variations of intensity or duration of musical gestures, but cannot perceptually, and consequently conceptually, categorize those fine-grained variations; and ineffabilities of inter-subjectivity—the non-verbal interaction between performers that makes a performance a vibrant dialogue is similarly incommunicable. An attempt to identify some of the ineffable dimensions of this dialogue is proposed. Further ineffabilities relating the acoustical embedding of performing are identified.

scholarly journals Spotting The Elusive Prospect Customer: Exploratory Study Of A Web-Powered Customer Relationship Management Framework

2015 ◽  
Vol 31 (5) ◽  
pp. 1935 ◽  
Author(s):  
Myriam Ertz ◽  
Raoul Graf
Keyword(s):  
Customer Relationship Management ◽  
Exploratory Study ◽  
Web Mining ◽  
Opinion Mining ◽  
Relationship Management ◽  
Online Marketing ◽  
Customer Relationship ◽  
Homogeneous Groups ◽  
Fine Grained ◽  
Managerial Implications

Research on how Web-Mining (WM) optimizes marketing, is sparse. Especially absent, is research on WM usefulness for Customer Relationship Management (CRM). The purpose of this research, is to propose a Web Mining-enabled knowledge acquisition framework for analytical CRM. An exploratory study consisting of eleven in-depth interviews with marketing scholars and practitioners revealed that, WM methods and techniques - currently available to practitioners - are well-suited for identifying the profile of web prospects according to their browsing behaviour and to classify them into homogeneous groups. Besides, the nascent technologies regarding opinion mining, sentiment analysis or natural language parsing, and which underlie WM, seem sufficient to acquire knowledge pertaining to attitudinal and other more psychometrically-based characteristics about web prospects. Such tools enable to better understand the so-often termed elusive prospects, by crafting fine-grained online marketing strategies to acquire those would-be customers. The authors discuss the managerial implications that derive from these findings.

scholarly journals Efficient verification of parallel matrix multiplication in public cloud: the MapReduce case

2020 ◽  
Vol 7 (1) ◽  
Author(s):  
Ramtin Bagheri ◽  
Morteza Amini ◽  
Somayeh Dolatnezhad Samarin
Keyword(s):  
Matrix Multiplication ◽  
Tree Structure ◽  
Construction Time ◽  
Merkle Tree ◽  
Fine Grained ◽  
Proof Construction ◽  
Verification Time ◽  
Important Challenge ◽  
Processing Techniques ◽  
Efficient Verification

Abstract With the advent of cloud-based parallel processing techniques, services such as MapReduce have been considered by many businesses and researchers for different applications of big data computation including matrix multiplication, which has drawn much attention in recent years. However, securing the computation result integrity in such systems is an important challenge, since public clouds can be vulnerable against the misbehavior of their owners (especially for economic purposes) and external attackers. In this paper, we propose an efficient approach using Merkle tree structure to verify the computation results of matrix multiplication in MapReduce systems while enduring an acceptable overhead, which makes it suitable in terms of scalability. Using the Merkle tree structure, we record fine-grained computation results in the tree nodes to make strong commitments for workers; they submit a commitment value to the verifier which is then used to challenge their computation results’ integrity using elected input data as verification samples. Evaluation outcomes show significant improvements comparing with the state-of-the-art technique; in case of 300*300 matrices, 73% reduction in generated proof size, 61% reduction in the proof construction time, and 95% reduction in the verification time.

scholarly journals The effect of stress on memory for temporal context: an exploratory study

2021 ◽  
Author(s):  
Nicole D. Montijn ◽  
Lotte Gerritsen ◽  
Iris. M. Engelhard
Keyword(s):  
Exploratory Study ◽  
Learning Strategy ◽  
Temporal Structure ◽  
Temporal Context ◽  
Event Sequence ◽  
Fine Grained ◽  
Strategy Shift ◽  
Virtual Time ◽  
Sequence Memory ◽  
Extreme Performance

ABSTRACTTrauma memories can appear dissociated from their original temporal context, and are often relived as they occur in the here-and-now. Potentially these temporal distortions already occur during encoding of the aversive experience as a consequence of stress. Here, 86 participants were subjected to either a stress or control induction, after which they learned the temporal structure of four virtual days. In these virtual days, time was scaled and participants could use clock cues to construe the passage of time within a day. We examined whether stress causes a shift in the learning strategy from one based on virtual time to one based on event sequence. Our results do not show a discernible impact of stress on memory for temporal context, in terms of both sequence memory and more fine-grained representations of time. The stress groups showed more extreme performance trajectories, either good or poor, across all measures. However, as time estimations were overall quite poor it is unclear to what extent this reflected a true strategy shift. Future avenues of research that can build on these findings are discussed.

scholarly journals How Far are We from Effective Context Modeling? An Exploratory Study on Semantic Parsing in Context

2020 ◽  
Author(s):  
Qian Liu ◽  
Bei Chen ◽  
Jiaqi Guo ◽  
Jian-Guang Lou ◽  
Bin Zhou ◽  
...  
Keyword(s):  
Exploratory Study ◽  
State Of The Art ◽  
Context Modeling ◽  
Semantic Parsing ◽  
World Semantic ◽  
Research Directions ◽  
Fine Grained ◽  
Modeling Methods ◽  
Cross Domain ◽  
Shed Light

Recently semantic parsing in context has received a considerable attention, which is challenging since there are complex contextual phenomena. Previous works verified their proposed methods in limited scenarios, which motivates us to conduct an exploratory study on context modeling methods under real-world semantic parsing in context. We present a grammar-based decoding semantic parser and adapt typical context modeling methods on top of it. We evaluate 13 context modeling methods on two large complex cross-domain datasets, and our best model achieves state-of-the-art performances on both datasets with significant improvements. Furthermore, we summarize the most frequent contextual phenomena, with a fine-grained analysis on representative models, which may shed light on potential research directions. Our code is available at https://github.com/microsoft/ContextualSP.

scholarly journals Research on Ciphertext-Policy Attribute-Based Encryption with Attribute Level User Revocation in Cloud Storage

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Guangbo Wang ◽  
Jianhua Wang
Keyword(s):  
Access Control ◽  
Cloud Storage ◽  
Control Policy ◽  
Attribute Level ◽  
Fine Grained ◽  
Computational Load ◽  
Diffie Hellman ◽  
Attribute Based Encryption ◽  
Important Challenge ◽  
Ciphertext Policy

Attribute-based encryption (ABE) scheme is more and more widely used in the cloud storage, which can achieve fine-grained access control. However, it is an important challenge to solve dynamic user and attribute revocation in the original scheme. In order to solve this problem, this paper proposes a ciphertext-policy ABE (CP-ABE) scheme which can achieve attribute level user attribution. In this scheme, if some attribute is revoked, then the ciphertext corresponding to this attribute will be updated so that only the individuals whose attributes meet the access control policy and have not been revoked will be able to carry out the key updating and decrypt the ciphertext successfully. This scheme is proved selective-structure secure based on the q-Parallel Bilinear Diffie-Hellman Exponent (BDHE) assumption in the standard model. Finally, the performance analysis and experimental verification have been carried out in this paper, and the experimental results show that, compared with the existing revocation schemes, although our scheme increases the computational load of storage service provider (CSP) in order to achieve the attribute revocation, it does not need the participation of attribute authority (AA), which reduces the computational load of AA. Moreover, the user does not need any additional parameters to achieve the attribute revocation except for the private key, thus saving the storage space greatly.

scholarly journals Privacy-Preserving Attribute-Based Keyword Search with Traceability and Revocation for Cloud-Assisted IoT

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Kai Zhang ◽  
Yanping Li ◽  
Laifeng Lu
Keyword(s):  
Keyword Search ◽  
Rapid Development ◽  
Security Analysis ◽  
Privacy Preserving ◽  
User Privacy ◽  
Fine Grained ◽  
Important Challenge ◽  
Efficient Construction ◽  
Access Policies ◽  
Search Control

With the rapid development of cloud computing and Internet of Things (IoT) technology, it is becoming increasingly popular for source-limited devices to outsource the massive IoT data to the cloud. How to protect data security and user privacy is an important challenge in the cloud-assisted IoT environment. Attribute-based keyword search (ABKS) has been regarded as a promising solution to ensure data confidentiality and fine-grained search control for cloud-assisted IoT. However, due to the fact that multiple users may have the same retrieval permission in ABKS, malicious users may sell their private keys on the Internet without fear of being caught. In addition, most of existing ABKS schemes do not protect the access policy which may contain privacy information. Towards this end, we present a privacy-preserving ABKS that simultaneously supports policy hiding, malicious user traceability, and revocation. Formal security analysis shows that our scheme can not only guarantee the confidentiality of keywords and access policies but also realize the traceability of malicious users. Furthermore, we provide another more efficient construction for public tracing.

Application of an image management system in microscopy

1992 ◽  
Vol 50 (2) ◽  
pp. 1052-1053
Author(s):  
Richard S. Chemock
Keyword(s):  
Data Storage ◽  
Cost Savings ◽  
Image Data ◽  
Analytical Techniques ◽  
Operational Mode ◽  
Fine Grained ◽  
Image Recording ◽  
Primary Output ◽  
Capacity Data ◽  
Image Management System

One of the most common tasks in a typical analysis lab is the recording of images. Many analytical techniques (TEM, SEM, and metallography for example) produce images as their primary output. Until recently, the most common method of recording images was by using film. Current PS/2R systems offer very large capacity data storage devices and high resolution displays, making it practical to work with analytical images on PS/2s, thereby sidestepping the traditional film and darkroom steps. This change in operational mode offers many benefits: cost savings, throughput, archiving and searching capabilities as well as direct incorporation of the image data into reports.The conventional way to record images involves film, either sheet film (with its associated wet chemistry) for TEM or PolaroidR film for SEM and light microscopy. Although film is inconvenient, it does have the highest quality of all available image recording techniques. The fine grained film used for TEM has a resolution that would exceed a 4096x4096x16 bit digital image.

Use of fractals to describe microstructures of porous thick-film platinum electrodes

1992 ◽  
Vol 50 (1) ◽  
pp. 314-315
Author(s):  
Steven D. Toteda
Keyword(s):  
Fractal Dimension ◽  
Power Plants ◽  
Electrical Response ◽  
Cubic Phase ◽  
Platinum Electrodes ◽  
Fine Grained ◽  
Impedance Response ◽  
Platinum Particles ◽  
Energy Surfaces ◽  
Highly Porous

Zirconia oxygen sensors, in such applications as power plants and automobiles, generally utilize platinum electrodes for the catalytic reaction of dissociating O2 at the surface. The microstructure of the platinum electrode defines the resulting electrical response. The electrode must be porous enough to allow the oxygen to reach the zirconia surface while still remaining electrically continuous. At low sintering temperatures, the platinum is highly porous and fine grained. The platinum particles sinter together as the firing temperatures are increased. As the sintering temperatures are raised even further, the surface of the platinum begins to facet with lower energy surfaces. These microstructural changes can be seen in Figures 1 and 2, but the goal of the work is to characterize the microstructure by its fractal dimension and then relate the fractal dimension to the electrical response. The sensors were fabricated from zirconia powder stabilized in the cubic phase with 8 mol% percent yttria. Each substrate was sintered for 14 hours at 1200°C. The resulting zirconia pellets, 13mm in diameter and 2mm in thickness, were roughly 97 to 98 percent of theoretical density. The Engelhard #6082 platinum paste was applied to the zirconia disks after they were mechanically polished ( diamond). The electrodes were then sintered at temperatures ranging from 600°C to 1000°C. Each sensor was tested to determine the impedance response from 1Hz to 5,000Hz. These frequencies correspond to the electrode at the test temperature of 600°C.

Amorphous silica coating on α-alumina particles

1995 ◽  
Vol 53 ◽  
pp. 210-211
Author(s):  
J. W. Mellowes ◽  
C. M. Chun ◽  
I. A. Aksay
Keyword(s):  
Amorphous Silica ◽  
Heterogeneous Nucleation ◽  
Homogeneous Nucleation ◽  
Silica Coating ◽  
Full Density ◽  
Optimal Conditions ◽  
Fine Grained ◽  
Alumina Particles ◽  
Complete Mullitization ◽  
Powder Compacts

Mullite (3Al2O32SiO2) can be fabricated by transient viscous sintering using composite particles which consist of inner cores of a-alumina and outer coatings of amorphous silica. Powder compacts prepared with these particles are sintered to almost full density at relatively low temperatures (~1300°C) and converted to dense, fine-grained mullite at higher temperatures (>1500°C) by reaction between the alumina core and the silica coating. In order to achieve complete mullitization, optimal conditions for coating alumina particles with amorphous silica must be achieved. Formation of amorphous silica can occur in solution (homogeneous nucleation) or on the surface of alumina (heterogeneous nucleation) depending on the degree of supersaturation of the solvent in which the particles are immersed. Successful coating of silica on alumina occurs when heterogeneous nucleation is promoted and homogeneous nucleation is suppressed. Therefore, one key to successful coating is an understanding of the factors such as pH and concentration that control silica nucleation in aqueous solutions. In the current work, we use TEM to determine the optimal conditions of this processing.

Sign in / Sign up

Export Citation Format

Share Document