Summer 2009 Vol. 11 No. 1

https://surface.syr.edu/ischool_news/1015/thumbnail.jp

Investigating the Effect of Familiarity with Target Document on Retrieval Success in Group Information Repositories

system they are not familiar with in order to retrieve a file they were told about (for example, a new member of an organization who has to fill out a form may be instructed to look for a template on the organization’s network drive). This individual may encounter difficulties finding the file or experience frustration during the process, as their incomplete knowledge of where the file is in the folder hierarchy or how to start looking for it may lead them to spend a lot of time looking in the wrong places or trying to ‘work out’ where the most likely location of the file might be. The purpose of this study is to investigate the factors influencing how successfully and effectively a user is able to retrieve a file from a shared information repository when they may not be fully aware of its contents or location. The re-finding context was a desktop hierarchical folder structure linked to a cloud-based group information repository (Dropbox). RQ1: How does familiarity with the retrieval target influence retrieval success and retrieval efficiency? o Hypothesis: Familiarity with the retrieval target is positively correlated with retrieval success and retrieval efficiency. RQ2: What are common characteristics of re-finding experiences in shared folders? In this study, an elicited personal information retrieval method (detailed in the Literature Review and Section 3.2) is used in conjunction with qualitative methods; as the quantitative data obtained on retrieval outcomes can be linked to the qualitative data gathered from the same participants, this procedure generates explanatory in addition to descriptive information.Bachelor of Scienc

Quantum calcium-ion interactions with EEG

Previous papers have developed a statistical mechanics of neocortical interactions (SMNI) fit to short-term memory and EEG data. Adaptive Simulated Annealing (ASA) has been developed to perform fits to such nonlinear stochastic systems. An N-dimensional path-integral algorithm for quantum systems, qPATHINT, has been developed from classical PATHINT. Both fold short-time propagators (distributions or wave functions) over long times. Previous papers applied qPATHINT to two systems, in neocortical interactions and financial options. \textbf{Objective}: In this paper the quantum path-integral for Calcium ions is used to derive a closed-form analytic solution at arbitrary time that is used to calculate interactions with classical-physics SMNI interactions among scales. Using fits of this SMNI model to EEG data, including these effects, will help determine if this is a reasonable approach. \textbf{Method}: Methods of mathematical-physics for optimization and for path integrals in classical and quantum spaces are used for this project. Studies using supercomputer resources tested various dimensions for their scaling limits. In this paper the quantum path-integral is used to derive a closed-form analytic solution at arbitrary time that is used to calculate interactions with classical-physics SMNI interactions among scales. \textbf{Results}: The mathematical-physics and computer parts of the study are successful, in that there is modest improvement of cost/objective functions used to fit EEG data using these models. \textbf{Conclusion}: This project points to directions for more detailed calculations using more EEG data and qPATHINT at each time slice to propagate quantum calcium waves, synchronized with PATHINT propagation of classical SMNI.Comment: published in Sc

Performance comparison of point and spatial access methods

In the past few years a large number of multidimensional point access methods, also called multiattribute index structures, has been suggested, all of them claiming good performance. Since no performance comparison of these structures under arbitrary (strongly correlated nonuniform, short "ugly") data distributions and under various types of queries has been performed, database researchers and designers were hesitant to use any of these new point access methods. As shown in a recent paper, such point access methods are not only important in traditional database applications. In new applications such as CAD/CIM and geographic or environmental information systems, access methods for spatial objects are needed. As recently shown such access methods are based on point access methods in terms of functionality and performance. Our performance comparison naturally consists of two parts. In part I we w i l l compare multidimensional point access methods, whereas in part I I spatial access methods for rectangles will be compared. In part I we present a survey and classification of existing point access methods. Then we carefully select the following four methods for implementation and performance comparison under seven different data files (distributions) and various types of queries: the 2-level grid file, the BANG file, the hB-tree and a new scheme, called the BUDDY hash tree. We were surprised to see one method to be the clear winner which was the BUDDY hash tree. It exhibits an at least 20 % better average performance than its competitors and is robust under ugly data and queries. In part I I we compare spatial access methods for rectangles. After presenting a survey and classification of existing spatial access methods we carefully selected the following four methods for implementation and performance comparison under six different data files (distributions) and various types of queries: the R-tree, the BANG file, PLOP hashing and the BUDDY hash tree. The result presented two winners: the BANG file and the BUDDY hash tree. This comparison is a first step towards a standardized testbed or benchmark. We offer our data and query files to each designer of a new point or spatial access method such that he can run his implementation in our testbed

Memory Encoding and Retrieval of Discourse Structure in Human Language Comprehension

An extensive amount of work has shown the way the working memory architecture supports language comprehension. However, while language comprehension inevitably takes place in a discourse context, less is known about how information related to discourse is organized and managed in working memory. The project particularly focuses on two known processes in the working memory involved in language comprehension, namely encoding and retrieval. I investigate the way discourse structure information guides retrieval and how the information affects the encoding process in real-time comprehension. To this end, I use two types of sentence structures that are minimally different in their discourse status. While both sentences in (1) contain the information that the waitress is “Kelly’s sister,” the discourse status of such information differs when it is contained in a restrictive relative clause (RRC) (1a) or an appositive relative clause (ARC) (1b). While the content inside an RRC (1a) is part of primary, essential information (i.e., main discourse information), it becomes secondary, and side-commentary (i.e., subordinate discourse information) when it is contained inside an ARC (1b). (1a) The waitress who is Kelly’s sister sat next to Bob. (1b) The waitress, who is Kelly’s sister, sat next to Bob. Given the contrast of main vs. subordinate discourse information status, I examine how this division affects the retrieval process and what effects this information results in during the encoding process. To address these questions, I make use of two of the well-established linguistic phenomena in the sentence processing literature to examine the contrast: number agreement attraction effect, and pronoun resolution. I conduct a series of experiments using behavioral measures such as reading times using a self-paced reading task and eye-gaze times implementing a visual world paradigm. The findings suggest that discourse structure information imposes a constraint on the memory retrieval process. Specifically, the active state of discourse question in the given discourse structure guides which linguistic entities can be targeted for retrieval. Furthermore, the results show that discourse structure information affects retrieval even when it is not necessarily used for governing the grammaticality of linguistic dependency. While the distinction in discourse status does not affect grammaticality for resolving the dependency, it impacts the ease of dependency resolution in real time. The results also suggest that the parser actively uses discourse structure information during the encoding process, to the extent that the overlap of this information between encoded linguistic representations leads to a competition, encoding interference effect.</p

Internet of Things. Information Processing in an Increasingly Connected World

This open access book constitutes the refereed post-conference proceedings of the First IFIP International Cross-Domain Conference on Internet of Things, IFIPIoT 2018, held at the 24th IFIP World Computer Congress, WCC 2018, in Poznan, Poland, in September 2018. The 12 full papers presented were carefully reviewed and selected from 24 submissions. Also included in this volume are 4 WCC 2018 plenary contributions, an invited talk and a position paper from the IFIP domain committee on IoT. The papers cover a wide range of topics from a technology to a business perspective and include among others hardware, software and management aspects, process innovation, privacy, power consumption, architecture, applications

Dynamic deployment of context-aware access control policies for constrained security devices

Securing the access to a server, guaranteeing a certain level of protection over an encrypted communication channel, executing particular counter measures when attacks are detected are examples of security requirements. Such requirements are identi ed based on organizational purposes and expectations in terms of resource access and availability and also on system vulnerabilities and threats. All these requirements belong to the so-called security policy. Deploying the policy means enforcing, i.e., con guring, those security components and mechanisms so that the system behavior be nally the one speci ed by the policy. The deployment issue becomes more di cult as the growing organizational requirements and expectations generally leave behind the integration of new security functionalities in the information system: the information system will not always embed the necessary security functionalities for the proper deployment of contextual security requirements. To overcome this issue, our solution is based on a central entity approach which takes in charge unmanaged contextual requirements and dynamically redeploys the policy when context changes are detected by this central entity. We also present an improvement over the OrBAC (Organization-Based Access Control) model. Up to now, a controller based on a contextual OrBAC policy is passive, in the sense that it assumes policy evaluation triggered by access requests. Therefore, it does not allow reasoning about policy state evolution when actions occur. The modi cations introduced by our work overcome this limitation and provide a proactive version of the model by integrating concepts from action speci cation languages