cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Quality of service aware topology control for wireless ad hoc networks using smart antennas.
Creators: name: Rokonuzzaman, Sk. Mohammad
Publisher: name: Monash University
Year: 2017
Subjects: Uncategorized

description: Wireless ad hoc networks can suffer from capacity and scalability problems, especially when omni-directional antennas are used. Meeting the required Quality of Service (QoS) of the communications becomes a difficult task in such networks. To help alleviate these traditional problems of wireless ad hoc networks, this thesis presents the design and analysis of low level protocols and algorithms that intelligently use adaptive beamforming smart antennas to facilitate the provision of communications meeting QoS constraints of applications. The network model for which the protocols and algorithms in this thesis are designed is a cooperative, community wireless ad hoc network where nodes are in general fixed and there is no centrally owned infrastructure. This is an extension to the Suburban Ad-Hoc Network (SAHN). Though SAHN is a quasi-static network, much of the work of this thesis can be extended to include mobility. In this thesis medium access control, routing and topology control protocols and algorithms that are aware of QoS requirements of communications have been developed, simulated and evaluated. These protocols and algorithms take advantage of special characteristics of smart antennas. As a complete system, the new algorithms and protocols within a smart antenna equipped wireless ad hoc network, offers significant performance gains over traditional wireless networks.
Lipidation of brush polyethylene glycol polymers to extend plasma half-life and promote lymphatic uptake
Creators: name: ABDALLAH, MOHAMMAD SULTAN MOHAMMAD
Publisher: name: Monash University
Year: 2023
Subjects: classificationCode: 321404
subject: Pharmaceutical delivery technologies
classificationCode: 321405
subject: Pharmaceutical sciences

description: This thesis evaluated the properties of novel drug carriers linked to different fatty materials. This led to the association of the carriers with natural fat transporters including albumin and lipoproteins. Consequently, this association resulted in distinct uptake of the drug carriers by specific organs such as lymph nodes, and also different exposure of the drug carriers in blood. Collectively, this thesis suggests that these drug carriers might be utilised to deliver therapeutic molecules to certain organs such as lymph nodes to diagnose or treat diseases such as cancers and infections, which can maximise the efficacy of drugs and minimise their toxicity.
MS Gr. class. c. 1 47
Creators: name: Oxyrhynchus Papyri
Publisher: name: University of Oxford
Year: 2023
Subjects: classificationCode: 470316
subject: Latin and classical Greek languages

description: P.Herc. 26 col. 14. Philodemus, De dis 1
Drawing by Gennaro Casanova
Pervasive Services Engineering for SOAs
Creators: name: Abeywickrama, Dhaminda Buddhika
Publisher: name: Monash University
Year: 2017
Subjects: Uncategorized

description: Context information is of great importance for pervasive services to enhance their flexibility and adaptability to changing conditions and dynamic environments. However, context information is characterized by several qualities that make pervasive services challenging compared to conventional Web services. These are: a highly dynamic nature, real-time requirements, quality of context information and automation. Most existing approaches to representing pervasive services focus on the detailed design or implementation phases of the software life-cycle such as pervasive Web services. Little attention has been given to the early phase of design, such as architecture design, which is of a higher level and abstract in design. Building software architectural models of pervasive services provides service engineers with a better understanding of how these complex services interoperate and help uncover any errors during the early stages of the software life-cycle. This thesis proposes a novel approach based on behavioral modeling and analysis techniques for modeling pervasive software services and their compositions and verifying the process behavior of these models against specified system properties. This systematic, architecture-centric approach for engineering pervasive services integrates the benefits of principles such as model-driven architecture, aspect-oriented modeling, and formal behavioral modeling and analysis techniques using model checking. The approach of this thesis is explored using a real-world case study in intelligent transport. The research methodology of this thesis consists of three main stages. First, using the case study the use cases are extracted and a service specification for the system under consideration is defined using message sequence charts. Second, the architecture for the system is defined using a component configuration and an architecture model in Finite State Processes (FSP). Third, the architecture model synthesized is modularized by using aspect-oriented models in UML, and is automatically transformed into behavioural FSP. A custom tool - Aspectual FSP Generation - applying an effective pipeline of model-to-model and model-to-text transformations has been built to automate the correct separation of concerns of the crosscutting context-dependent functionality at both UML modeling and formal behavioral specification levels. The generated context-dependent adaptable behavior and the core service behavior for the pervasive services are rigorously verified using the LTSA model checker against specified system properties. An evaluation framework is presented to validate the custom tool developed, the context and adaptation dimensions of the customization approach, and the formal methods employed in this study. In summary, the primary contribution of this thesis is a novel, systematic architecture-centric approach for engineering pervasive services at the software architectural level.
Correlated X-ray/Ultraviolet/Optical Variability in NGC 6814
Creators: name: Troyer, Jon
name: Starkey, David
name: Cackett, Edward
name: Bentz, Misty
name: Goad, Michael
name: Horne, Keith
name: Seals, James
Publisher: name: arXiv
Year: 2015
Subjects: subject: Astrophysics of Galaxies (astro-ph.GA)
subject: High Energy Astrophysical Phenomena (astro-ph.HE)
subject: FOS: Physical sciences

description: We present results of a 3-month combined X-ray/UV/optical monitoring campaign of the Seyfert 1 galaxy NGC 6814. The object was monitored by Swift from June through August 2012 in the X-ray and UV bands and by the Liverpool Telescope from May through July 2012 in B and V. The light curves are variable and significantly correlated between wavebands. Using cross-correlation analysis, we compute the time lag between the X-ray and lower energy bands. These lags are thought to be associated with the light travel time between the central X-ray emitting region and areas further out on the accretion disc. The computed lags support a thermal reprocessing scenario in which X-ray photons heat the disc and are reprocessed into lower energy photons. Additionally, we fit the lightcurves using CREAM, a Markov Chain Monte Carlo code for a standard disc. The best-fitting standard disc model yields unreasonably high super-Eddington accretion rates. Assuming more reasonable accretion rates would result in significantly under-predicted lags. If the majority of the reprocessing originates in the disc, then this implies the UV/optical emitting regions of the accretion disc are farther out than predicted by the standard thin disc model. Accounting for contributions from broad emission lines reduces the lags in B and V by approximately 25% (less than the uncertainty in the lag measurements), though additional contamination from the Balmer continuum may also contribute to the larger than expected lags. This discrepancy between the predicted and measured interband delays is now becoming common in AGN where wavelength-dependent lags are measured.
description: 11 pages, 8 figures, accepted for publication in MNRAS
Two, three, many body systems involving mesons. Multimeson condensates
Creators: name: Oset, E.
name: Bayar, M.
name: Dote, A.
name: Hyodo, T.
name: Khemchandani, P. K.
name: Liang, W. H.
name: Torres, A. Martinez
name: Oka, M.
name: Roca, L.
name: Uchino, T.
name: Xiao, C. W.
Publisher: name: arXiv
Year: 2015
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: Nuclear Theory (nucl-th)
subject: FOS: Physical sciences

description: In this talk we review results from studies with unconventional many hadron systems containing mesons: systems with two mesons and one baryon, three mesons, some novel systems with two baryons and one meson, and finally systems with many vector mesons, up to six, with their spins aligned forming states of increasing spin. We show that in many cases one has experimental counterparts for the states found, while in some other cases they remain as predictions, which we suggest to be searched in BESIII, Belle, LHCb, FAIR and other facilities.
description: 8 pages, 2 figures, Talk at the Jagiellonian Symposium on Fundamental and Applied Subatomic Physics, June 2015
From doodle to Google: Exacerbating old problems or causing new ones? The relationship between laptop usage and in-class student behavior
Creators: name: Borbone, Martin
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 2009
Subjects: IT in education
Student behavior
Laptops in classrooms
Classroom environment
Classroom research
Student attitudes
Multitasking in class

description: This study describes a survey of undergraduate and postgraduate students currently enrolled in the School of Information and Library Science at the University of North Carolina at Chapel Hill during the Spring semester 2009. The study investigates in-class laptop usage by students and what laptop activities students engage in during class.  The study examines student perceptions towards their own laptop usage and if such usage distracts, annoys, or bothers other students, and explores student perceptions as to how they may be distracted by such behaviors in class.  The study also examines varying degrees of laptop restrictions in class and how this affects student involvement with a class and the predisposition to participate in an elective course if they knew in advance that such restrictions were to be imposed.
Quotient elastic metrics on the manifold of arc-length parameterized plane loops
Creators: name: Tumpach, Alice Barbara
name: Preston, Stephen C.
Publisher: name: arXiv
Year: 2016
Subjects: subject: Differential Geometry (math.DG)
subject: FOS: Mathematics

description: We study the pull-back of the 2-parameter family of quotient elastic metrics introduced in Mio-Srivastava-Joshi on the space of arc-length parameterized loops. This point of view has the advantage of concentrating on the manifold of arc-length parameterized curves, which is a very natural manifold when the analysis of un-parameterized curves is concerned, pushing aside the tricky quotient procedure detailed in Lahiri-Robinson-Klassen of the preshape space of parameterized curves by the reparameterization (semi-)group. In order to study the problem of finding geodesics between two given arc-length parameterized loops under these quotient elastic metrics, we give a precise computation of the gradient of the energy functional in the smooth case as well as a discretization of it, and implement a path-straightening method. This allows us to have a better understanding of how the landscape of the energy functional varies with respect to the parameters.
The Content of Transfer Guidelines as a Measure of Book Rarity
Creators: name: Hagerty, Margaret
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 2013
Subjects: Special collections--Collection development
Special collections
Rare books

description: This paper analyzes current transfer policies from selected institutions across the United States. The study was conducted to determine how selection criteria vary from place to place, and to ascertain which criteria appear most frequently in institutional transfer policies.
Results indicated that transfer policies vary widely, but do have some common characteristics beyond the ACRL Transfer Guidelines, including more precise statements of criteria regarding market value, general age, age according to geography, and physical and intrinsic characteristics.
MS Gr. class. c. 1 48
Creators: name: Oxyrhynchus Papyri
Publisher: name: University of Oxford
Year: 2023
Subjects: classificationCode: 470316
subject: Latin and classical Greek languages

description: P.Herc. 26 col. 9 B. Philodemus, De dis 1
Drawing by Gennaro Casanova
MS Gr. class. c. 1 49
Creators: name: Oxyrhynchus Papyri
Publisher: name: University of Oxford
Year: 2023
Subjects: classificationCode: 470316
subject: Latin and classical Greek languages

description: P.Herc. 26 col. 3. Philodemus, De dis 1
Drawing by Gennaro Casanova
The State of Preservation Metadata Practices in North Carolina Repositories
Creators: name: Eager, Claire
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 2003
Subjects: Metadata
Digital preservation
Digital libraries

description: Grand metadata schemas and detailed technology applications may well be ideal  for the effective preservation of digital images, but they may not be practical for  the vast majority of cultural heritage repositories. If resource-challenged  organizations do not receive assistance in scaling these efforts to meet their  available resources, hundreds of repositories may waste valuable assets on  ineffective measures, or they may do nothing at all. The aim of this study is to  determine where North Carolina repositories are in their efforts to digitize  collections; how they are incorporating preservation metadata, if at all; and to  solicit their assessment of the Metadata for the Administration and Preservation  of Digital Images (MAPDI) schema created by the North Carolina Exploring  Cultural Heritage Online Preservation Metadata Working Group. The  accompanying MAPDI database tool was expanded to include the capture of  collection-level Dublin Core discovery metadata as well as preservation  metadata. Results of the survey indicate that smaller repositories may be in need  of far greater assistance in their preservation efforts, and that they frequently  have to place practicality before perfect practice.
Development of evaluation techniques for heat tolerance in Kimchi cabbage through phenotyping
Creators: name: Choi, SH
name: Yoonah Jang, Minjae Kim
Publisher: name: World Vegetable Center
Year: 2024
Subjects: subject: HEAT RESISTANCE
subject: KIMCHI
subject: CLIMATE CHANGE
subject: PHENOTYPES
subject: GERMPLASM EVALUATION
subject: SELECTION
subject: Global warming
subject: Heat stress
subject: Kimchi cabbage
subject: Heat resistance
subject: Climate change
subject: Phenotyping
subject: Non-destructive evaluation
subject: High-temperature environment
subject: Phenospex device
subject: Physiological indices
subject: 3D leaf area
subject: Digital biomass
subject: NDVI average
subject: Plant height
subject: PSRI average
subject: Crop selection

description: Due to global warming, many crops are experiencing heat stress. One of the main ingredients of kimchi, which is a staple food for Koreans, is Kimchi cabbage, a crop sensitive to high temperatures. This study aims to select Kimchi cabbage varieties with strong heat resistance. We conducted an evaluation of heat resistance in response to climate change using a non-destructive method called phenotyping, targeting 20 varieties of Kimchi cabbage seedlings. Under normal conditions and artificially set high-temperature environments (40 degrees Celsius), we measured 66 physiological indices using the Phenospex device. We comprehensively analyzed indices such as 3D leaf area, digital biomass, NDVI average, plant height, and PSRI average to select varieties with strong heat resistance
Self-published books: Will they be preserved, or lost to the mists of time?
Creators: name: Ryan, Erin
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 2017
Subjects: Libraries--Self-publishing
Authors--Digital preservation
Self-publishing--History

description: This exploratory study describes the results of a survey of 39 self-published writers who were contacted through several North-Carolina-based writers’ groups. The survey was intended to determine background about the platforms and formats they used as well as the importance these writers placed on the preservation of their work, asking whether they had lost files or had tried to get their work into libraries. Follow-up interviews with four writers who took the survey feature their reflections on being an “indie author,” including their methods for finding an audience, how they learn information about self-publishing, and the challenges and benefits they have experienced from the process.  The study begins with a literature review that includes interviews with two librarians and a small publisher in North Carolina. The study concludes with a number of implications for further research, as well as a discussion of the major finding that publicity equals preservation.
Photovoltaic effect in individual asymmetrically contacted lead sulfide nanosheets
Creators: name: Dogan, Sedat
name: Bielewicz, Thomas
name: Lebedeva, Vera
name: Klinke, Christian
Publisher: name: arXiv
Year: 2015
Subjects: subject: Materials Science (cond-mat.mtrl-sci)
subject: FOS: Physical sciences

description: Solution-processable, two-dimensional semiconductors are promising optoelectronic materials which could find application in low-cost solar cells. Lead sulfide nanocrystals raised attention since the effective band gap can be adapted over a wide range by electronic confinement and observed multi-exciton generation promises higher efficiencies. We report on the influence of the contact metal work function on the properties of transistors based on individual two-dimensional lead sulfide nanosheets. Using palladium we observed mobilities of up to 31 cm2/Vs. Furthermore, we demonstrate that asymmetrically contacted nanosheets show photovoltaic effect and that the nanosheets' height has a decisive impact on the device performance. Nanosheets with a thickness 5.4 nm contacted with platinum and titanium show a power conversion efficiency of up to 0.94 % (EQE 75.70 %). The results underline the high hopes put on such materials.
Metric learning and scale estimation in high dimensional machine learning problems with an application to generic object recognition
Creators: name: Zaidi, Nayyar Abbas
Publisher: name: Monash University
Year: 2017
Subjects: Uncategorized

description: A typical machine learning algorithm takes advantage of training data to discover patterns among observed variables. For example, a learning algorithm can predict the label of a test data point by measuring its similarity with the training data points. Since the data is constituted of features which are not necessarily related by any evident relation, the notion of similarity is not trivially defined. When measuring similarity, one should not necessarily treat all features as being equally important. The problem of learning in high-dimensional machine learning data is actually the problem of estimating the relative importance of the features. The relevance determination tunes a data-dependent similarity measure. Most machine learning algorithms either implicitly or explicitly learn this similarity measure on which their performance is critically dependent. In this thesis, various metric learning techniques are analyzed and systematically studied under a unified framework to highlight the criticality of data-dependent distance metric in machine learning. The metric learning algorithms are categorized as naive, semi-naive, complete and high-level metric learning, under a common distance measurement framework. The connection of feature selection, feature weighting, feature partitioning, kernel tuning, etc. with metric learning is discussed and it is shown that they are all in fact forms of metric learning. Novel naive, semi-naive, complete and high-level metric learning algorithms are proposed to improve classification performance. Also, it has been shown that the realm of metric learning is not limited to k-nearest neighbor classification, and that a metric optimized in the k-nearest neighbor setting is likely to be effective and applicable in other kernel-based frameworks, for example Support Vector Machines (SVM) and Gaussian Processes (GP).
MS Gr. class. c. 1 50
Creators: name: Oxyrhynchus Papyri
Publisher: name: University of Oxford
Year: 2023
Subjects: classificationCode: 470316
subject: Latin and classical Greek languages

description: P.Herc. 26 col. 20. Philodemus, De dis 1
Drawing by Gennaro Casanova
SuperGraph Visualization
Creators: name: Rodrigues, Jose
name: Traina, Agma
name: Faloutsos, Christos
name: Traina, Caetano
Publisher: name: arXiv
Year: 2015
Subjects: subject: Social and Information Networks (cs.SI)
subject: Physics and Society (physics.soc-ph)
subject: FOS: Computer and information sciences
subject: FOS: Physical sciences

description: Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle large graphs with hundred thousand nodes and possibly million edges. Such graphs bring two challenges: interactive visualization demands prohibitive processing power and, even if we could interactively update the visualization, the user would be overwhelmed by the excessive number of graphical items. To cope with this problem, we propose a formal innovation on the use of graph hierarchies that leads to GMine system. GMine promotes scalability using a hierarchy of graph partitions, promotes concomitant presentation for the graph hierarchy and for the original graph, and extends analytical possibilities with the integration of the graph partitions in an interactive environment.
description: 9 pages, appears in Proceedings of the IEEE International Symposium on Multimedia, 2006 as SuperGraph Visualization In: 8th IEEE International Symposium on Multimedia 227-234 IEEE Press
My Kingdom for a (Digital) Horse: Perceptions of Virtual Property Rights in Second Life
Creators: name: Peterson, Sarah K.
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 2008
Subjects: Copyright Copyright--Internet
Second Life (Game)
Digital Millennium Copyright Act
Multi-user Virtual Environments

description: Massively Multiplayer Online Games (MMOGs), such as World of Warcraft and Second  Life, create virtual worlds in which players build relationships, establish communities,  and win, create, or purchase property. As MMOGs have evolved, their virtual economies  have developed into major financial forces, and intellectual property rights have become  an increasingly pressing issue. In the academic literature, the intellectual property rights  of MMOG players have been widely discussed from legal, economic, and philosophical  perspectives. However, no research has yet been done on players' attitudes toward  copyright problems in virtual worlds. As a means to investigate these attitudes, this  research looks at 880 posts in nine threads on the Second Life community forums. For the  most part, the intellectual property topics addressed in the academic literature are not  those that concern the players posting on the Second Life forums.
Supplementary Methods and Figures from Modelling the impact of the Omicron BA.5 subvariant in New Zealand
Creators: name: Lustig, Audrey
name: Vattiato, Giorgia
name: Maclaren, Oliver
name: Watson, Leighton M.
name: Datta, Samik
name: Plank, Michael J.
Publisher: name: The Royal Society
Year: 2023
Subjects: subject: Computational Biology
subject: 10202 Biological Mathematics
subject: FOS: Mathematics

description: Supplementary Methods and Figures
MS Gr. class. c. 1 51
Creators: name: Oxyrhynchus Papyri
Publisher: name: University of Oxford
Year: 2023
Subjects: classificationCode: 470316
subject: Latin and classical Greek languages

description: P.Herc. 26 col. 2. Philodemus, De dis 1
Drawing by Gennaro Casanova
Data mining with incremental learning inspired dynamic tree structures
Creators: name: Ahmad, Norashikin
Publisher: name: Monash University
Year: 2017
Subjects: Uncategorized

description: Artificial learning models such as artificial neural networks have been used for discovering patterns that are hidden in the data and to solve problems in many application areas. Despite the successful implementation of the models, artificial learning models differ from human learning in several key aspects. One significant property of human learning is that human learning is incremental where the acquisition of knowledge happens gradually and / or in stages and is a lifelong process. Some aspects of learning may also be the result of genome modification over generations. Nevertheless, many of the existing artificial models do not take into account these incremental and dynamic aspects of human learning. Traditional artificial neural network models consider a data set as static and once the learning is completed cannot acquire new learning and adapt. In many models, the structures are not flexible to adapt, thus limiting the models capability in working with changing data or dynamic situations. This thesis addresses the problem of incorporating incremental learning in artificial learning models and highlights its value and utility. In particular, this research attempts to develop a data mining model which is inspired by human ability to learn incrementally. This research has resulted in the development of a new model based on a dynamic self-organizing map called Growing Self-organizing Map (GSOM) which has shown to be effective in mining large volumes of data. The GSOM and its Attribute Cluster Relationship model (ACR model) have been utilized as a potential technique to achieve incremental learning in this research. The new model is based on the building of a concept tree that facilitates knowledge discovery through visualization and analysis of hierarchical structures. Apart from having an ability to learn incrementally, similar to the GSOM algorithm, the granularity of the concept tree can be controlled using the spread factor parameter. This feature allows an analyst to choose the depth of analysis of the clusters as desired. In addition, the conceptual profiles obtained from the dynamic concept tree in the model provide means to acquire knowledge as well as to monitor incremental changes to the data over time. The experimental results demonstrate that the model is able to acquire knowledge incrementally while preserving the previous knowledge. During the development of the model, an automatic cluster identification technique for the GSOM has been proposed and demonstrated. This method helps in faster and more accurate analysis of the clusters and also allows possible or unknown clusters to be discovered. In addition, the investigation on the effect of the spread factor value towards cluster separation in the GSOM has also been carried out. This contributes to the study of the GSOM algorithm, specifically, the spread factor effect in formation and separation of the clusters in the GSOM maps whereby quantitative results are provided.
Medical data signature extraction using modified TF-IDF in DataBridge project
Creators: name: Hu, Wei
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 2016
Subjects: Information science

description: This project is a part of the DataBridge project, where we try to find similar datasets among a large number of medical datasets stored in the DataBridge server using key words extraction and similarity algorithms. In this project, a sample of 1,000 datasets were randomly chosen from the 18,000 datasets corpus. Modified TF-IDF was used in the sample data to generate key words for the 1,000 datasets and similarity analysis was followed. According to the results, we find that the key words extraction works fine in calculating similarities between different datasets.
On the Erigone family and the $z_2$ secular resonance
Creators: name: Carruba, Valerio
name: Aljbaae, Safwan
name: Winter, Othon C.
Publisher: name: arXiv
Year: 2015
Subjects: subject: Earth and Planetary Astrophysics (astro-ph.EP)
subject: FOS: Physical sciences

description: The Erigone family is a C-type group in the inner main belt. Its age has been estimated by several researchers to be less then 300 My, so it is a relatively young cluster. Yarko-YORP Monte Carlo methods to study the chronology of the Erigone family confirm results obtained by other groups. The Erigone family, however, is also characterized by its interaction with the $z_2$ secular resonance. While less than 15% of its members are currently in librating states of this resonance, the number of objects, members of the dynamical group, in resonant states is high enough to allow to use the study of dynamics inside the $z_2$ resonance to set constraints on the family age. Like the $ν_{6}$ and $z_1$ secular resonances, the $z_2$ resonance is characterized by one stable equilibrium point at $σ= 180^{\circ}$ in the $z_2$ resonance plane $(σ, \frac{dσ}{dt})$, where $σ$ is the resonant angle of the $z_2$ resonance. Diffusion in this plane occurs on timescales of $\simeq 12$ My, which sets a lower limit on the Erigone family age. Finally, the minimum time needed to reach a steady-state population of $z_2$ librators is about 90 My, which allows to impose another, independent constraint on the group age.
description: This paper has 11 pages, 12 figures, and 1 table. Accepted for publication in MNRAS
Generalized Persistence Diagrams
Creators: name: Patel, Amit
Publisher: name: arXiv
Year: 2016
Subjects: subject: Algebraic Topology (math.AT)
subject: FOS: Mathematics

description: We generalize the persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer to the setting of constructible persistence modules valued in a symmetric monoidal category. We call this the type A persistence diagram of a persistence module. If the category is also abelian, then we define a second type B persistence diagram. In addition, we show that both diagrams are stable to all sufficiently small perturbations of the module.
An architectural framework for analyzing computer system security
Creators: name: Creado, Orhio Mark
Publisher: name: Monash University
Year: 2017
Subjects: Uncategorized

description: Computing systems are complex machines comprised of many disparate components working together to fulfill a higher purpose. While most systems can remain functional irrespective of minor errors in any one component, these minor errors can also be the source for much larger devious exploitation. Despite rapid advances in technology, many of the core operating aspects pertaining to computing systems have remained virtually unchanged, and this includes the underlying architecture. If various components can work independently, and various components can be compromised, logic entails that the overall security of the system is only as secure as each of its underlying components. This renders the existing operational infrastructure of modern computing systems flawed in their underlying design. With evolving technology comes newer measures of circumventing system security. So the question remains as to how can any architectural design account for this changing operating environment? While perfect security will always remain a fallacy, this thesis aims at presenting an architecture, termed as the ICS architecture, which entails two very important concepts. First, borrowing from the fields of biology and anthropology, a computing system is considered as a singular entity solely responsible for its own operations and well being - a knowledge of which it must always possess. Second, as the fundamental unit of all biological life is a cell, all digital systems must execute code. Collectively, these blocks of code work together to achieve a desired output. Thereby the most fundamental unit of operation within a computing system is established as a Block of Code. This thesis derives and asserts the ICS architecture in four stages. First, computing systems are represented as a set of independent components, irrespective of complexity or functionality. Second, a more applicable definition for the term ’Security’, within a computing system, is defined as a combination of independent characteristics. Third, each characteristic is defined as a set of properties applicable to a Block of Code, asserted for validity using first order logic, and enforced via a framework of monitors. And fourth, an integrated architecture is defined based on the prior three stages in order to alleviate the responsibility of system security from any one component within the computing system. This allows for attaining a higher level of security, is capable of handling change, and ensures security through architectural design rather than through obscurity.
MS Gr. class. c. 1 52
Creators: name: Oxyrhynchus Papyri
Publisher: name: University of Oxford
Year: 2023
Subjects: classificationCode: 470316
subject: Latin and classical Greek languages

description: P.Herc. 26 col. 4. Philodemus, De dis 1
Drawing by Gennaro Casanova
What do we know about cosmography
Creators: name: Zhang, Ming-Jian
name: Li, Hong
name: Xia, Jun-Qing
Publisher: name: arXiv
Year: 2016
Subjects: subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: FOS: Physical sciences

description: In the present paper, we investigate the cosmographic problem using the bias-variance trade-off. We find that both the z-redshift and the $y=z/(1+z)$-redshift can present a small bias estimation. It means that the cosmography can describe the supernova data more accurately. Minimizing risk, it suggests that cosmography up to the second order is the best approximation. Forecasting the constraint from future measurements, we find that future supernova and redshift drift can significantly improve the constraint, thus having the potential to solve the cosmographic problem. We also exploit the values of cosmography on the deceleration parameter and equation of state of dark energy $w(z)$. We find that supernova cosmography cannot give stable estimations on them. However, much useful information was obtained, such as that the cosmography favors a complicated dark energy with varying $w(z)$, and the derivative $dw/dz<0$ for low redshift. The cosmography is helpful to model the dark energy.
description: 12 pages, 10 figures, 1 table, accepted by EPJC
MS Gr. class. c. 1 53
Creators: name: Oxyrhynchus Papyri
Publisher: name: University of Oxford
Year: 2023
Subjects: classificationCode: 470316
subject: Latin and classical Greek languages

description: P.Herc. 26 col. 1. Philodemus, De dis 1
Drawing by Gennaro Casanova
The Differences Between Users' Queries Using Different Search Engine Interfaces
Creators: name: Langley, Ashley Richardson
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 2002
Subjects: Internet search engines
User information-seeking behavior
Online searching

description: This paper describes a research study done to detect differences in queries constructed in the traditional Google interface and the advanced search Google interface. Sixteen undergraduates at The University of North Carolina at Chapel Hill participated in this study. Study participants were asked to complete a questionnaire of demographic information and then search for answers to four questions using either the traditional Google interface or the advanced Google interface. This research indicated that users who use the advanced Google screen may construct queries with more terms. Additionally they use more Boolean logic and other search modifiers. More research needs to be done to substantiate this research due to the small sample size used.
Algebraic aspects of the chromatic polynomial
Creators: name: Morgan, Kerri Jo-Anne
Publisher: name: Monash University
Year: 2017
Subjects: Uncategorized

description: The chromatic polynomial P(G, λ) gives the number of proper colourings of a graph G in at most λ colours. Although there has been considerable interest in the chromatic polynomial, there has been little research into its algebraic theory. This thesis considers some algebraic properties of the chromatic polynomial: factorisation and the Galois groups of chromatic polynomials. If P(G, λ) = P(H1, λ)P(H2, λ)/P(Kr , λ), then G is said to have a chromatic factorisation of order r with chromatic factors H1 and H2. It is known that the chromatic polynomial of any clique-separable graph, that is, a graph containing a separating r-clique, has a chromatic factorisation. Two graphs are said to be chromatically equivalent if they have the same chromatic polynomial. A graph is said to be strongly non-clique-separable if it is not chromatically equivalent to any clique-separable graph. We show that there exist strongly non-clique-separable graphs that have chromatic factorisations and identify all chromatic polynomials of degree ≤ 10 of these graphs. We introduce the notion of a certificate of factorisation which is used to explain these factorisations. We find an upper bound of n^2*2^(n^2/2) for the lengths of these certificates, and much smaller certificates for all chromatic factorisations of graphs of order ≤ 9. We also give an infinite family of strongly non-clique-separable graphs that have chromatic factorisations and a certificate of factorisation for these graphs. We show that every H1 (excluding K3) with χ(H1) ≥ 3, even when H1 contains no triangles, is the chromatic factor of some chromatic factorisation of order 3 and give a certificate of factorisation for this chromatic factorisation. We then consider chromatic equivalence and give a way to find infinitely many pairs of chromatically equivalent graphs where exactly one of the pair is clique-separable. We find the Galois groups of all chromatic polynomials of strongly non-clique-separable graphs of order ≤ 10 and θ-graphs of order ≤ 19. Two graphs are said to be Galois equivalent if their chromatic polynomials have the same Galois group. We identify some operations on graphs that give a graph that is Galois equivalent to the original graph. We give cases where P(G′, λ) = P(G, λ) + P(Q, λ) where G and G′ are Galois equivalent and P(Q, λ) has the trivial Galois group. Although such a G and G′ can easily be found when P(G, λ) and P(G′, λ) have the trivial group, we give two families of graphs that satisfy this expression where the Galois groups are S2 and D(5). The family of graphs that has chromatic polynomials with Galois group D(5) is particularly interesting as most chromatic polynomials of degree ≤ 10 have symmetric Galois groups and occurrences of nonsymmetric groups are quite rare. We give infinite families of Galois equivalent graphs with chromatic polynomials with Galois groups A(3), D(4) and C(4). One of these graphs has the chromatic polynomial of lowest degree with Galois group A(3).
MS Gr. class. c. 1 54
Creators: name: Oxyrhynchus Papyri
Publisher: name: University of Oxford
Year: 2023
Subjects: classificationCode: 470316
subject: Latin and classical Greek languages

description: P.Herc. 26 col. 22. Philodemus, De dis 1
Drawing by Gennaro Casanova
Young Adult Fantasy Fiction in Recent Years: A Selective Annotated Bibliography
Creators: name: Fitzgerald, Meghan A.
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 2008
Subjects: Fantasy fiction--Bibliography
Young adult fiction--Bibliography

description: This selective annotated bibliography recommends and evaluates young adult fantasy fiction published between 2001 and 2008, with an emphasis on the last three years of that range. It presents the list of books in six subgenre categories. The scope of this work extends to monograph novels in non-graphic formats intended for audiences between grades 6 and 12, inclusively. This bibliography is primarily a resource for librarians, media specialists, teachers, and others who engage in the selection of books and in readers' advisory for young adults. The fantasy genre for this audience is a popular and rapidly-growing one, and this document is intended to aid in the navigation of this field of literature, as well as to provide an updated and focused look at recent fantasy that has not yet had many years to be tested and establish a place (or not) in pre-existing collections.
Correlation inequalities for Tutte polynomials
Creators: name: Mani, Arun Prasath
Publisher: name: Monash University
Year: 2017
Subjects: Uncategorized

description: The Tutte polynomial of a graph or a matroid is a polynomial in two variables x, y, and is of central importance in the study of combinatorial counting problems.
Awards: Winner of the Mollie Holman Doctoral Medal for Excellence, Faculty of Information Technology, 2010.
MS Gr. class. c. 1 55
Creators: name: Oxyrhynchus Papyri
Publisher: name: University of Oxford
Year: 2023
Subjects: classificationCode: 470316
subject: Latin and classical Greek languages

description: P.Herc. 26 col. 21. Philodemus, De dis 1
Drawing by Gennaro Casanova
An Examination of the Risks Associated with Widespread Deployment of Current Biometric Technologies for Data Security
Creators: name: Pippin, Joseph A., Jr.
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 2005
Subjects: Computer Security Biometrics
Biometrics
Information Policy Records Management
Information Security Biometrics
Biometrics Risks
Computer Security Internet Security Measures

description: Biometric technologies have been under development for years. Finger, face, and iris scanners are already in place in both high and low security environments. Over the next decade, many companies are preparing to deploy biometric scanners in everything from cars and pocketbooks to corporate offices and ATMs. The proliferation of a technology that is currently unregulated, non-standardized, and uses questionably secured databases to hold unique, non-secret, and irreplaceable personal identifiers - whether fingerprint, iris, facial scan, or some other - is a risky proposition. This paper looks at the myriad complications and caveats of biometric technology, and should serve to caution anyone, especially decision makers and influencers who manage data access and those who may consider implementing or authorizing the use of biometrics in their data environment.
Iterates of holomorphic self-maps on pseudoconvex domains of finite and infinite type in $\mathbb C^n$
Creators: name: Khanh, Tran Vu
name: Van Thu, Ninh
Publisher: name: arXiv
Year: 2015
Subjects: subject: Complex Variables (math.CV)
subject: FOS: Mathematics

description: We prove here the Wolff-Denjoy-type theorem for a very large class of pseudoconvex domains in $\mathbb C^n$ that may contain many classes of pseudoconvex domains of finite type and infinite type.
Diffusion and sustainability of information and communications technologies in community-based non-profit organisations: an exploratory study of Victoria and Tuscany
Creators: name: Denison, Thomas Frank
Publisher: name: Monash University
Year: 2017
Subjects: Uncategorized

description: Worldwide, governments and representatives of the community sector believe that the adoption of ICT by community-sector organisations is important because it contributes to the achievement of mission, strategic and business objectives, and benefits the communities those organisations serve. However, despite the fact that many organisations have developed innovative ICT applications, most experience problems in taking up ICT (Burt & Taylor 1999, Surman 2001, DCITA 2005b). This thesis explores the conditions for success and barriers to the take-up and effective use of information and communications technology (ICT), specifically websites and online services, by community-based non-profit organisations, using a study of seventeen organisations based in rural and regional Victoria in Australia, and Tuscany in Italy. In particular, it examines the structural barriers and the inter-organisational relationships that act to facilitate the take-up, or otherwise, of technology by community sector non-profit organisations. The study adopts a grounded theory approach, based on a two-stage data analysis: using the LIAISE framework for the take-up of ICT (Schauder et al. 2005), to identify the factors or conditions that contribute to the development of effective, sustainable websites; and social network analysis to explore the extent to which organisational networks enable the achievement of those conditions. The broad aims of this approach are to enable the evaluation of the existing LIAISE framework and to develop it as a more dynamic systems model capable of serving as a guide to policy and action. The study finds that although the LIAISE framework provides a good taxonomy of the factors important to the take-up of ICT by community-based non-profit organisations, it has weaknesses in that it does not explicitly identify user literacy as a factor, nor does it sufficiently emphasise the importance of an organisation’s external relationships, which provide an essential means of accessing required information and resources such as technical skills, and of enhancing core internal skills such as the ability to develop strategic plans. A new model is proposed to address these weaknesses: ALLIANCE (Applications; Literacy; user Literacy; Infrastructure; Access; Networks; Computing support; and Evaluation).
Automatic symmetry detection and dynamic symmetry breaking for constraint programming
Creators: name: Mears, Christopher David
Publisher: name: Monash University
Year: 2017
Subjects: Uncategorized

description: Constraint satisfaction and optimisation problems occur frequently in industry and are usually computationally expensive to solve. Constraint programming is a technique for solving these difficult problems using specialised algorithms and search heuristics. The presence of symmetries in constraint problems provides an opportunity to reduce the computational effort required to solve these problems. To exploit symmetries, a problem must first be analysed to determine what symmetries are present and then the search algorithm must be modified to use the known symmetries. In this thesis we provide contributions to both the research areas of automatically detecting symmetries and of exploiting them to improve search performance. The automatic detection of symmetries in constraint problems has been studied for some time, but existing methods can handle realistically-sized problems only by sacrificing the number and kinds of symmetry they can find. We contribute to this area in two parts. First, we present a method of automatically detecting the symmetries of a constraint problem that is capable of finding many small problems in a practical amount of time, and prove its correctness. Second, we use this method as the foundation of a framework for finding the symmetries in entire classes of problems. Symmetry detection on classes of problems has been little studied; our approach greatly improves the practicality of automatic symmetry detection as the symmetries found apply to many problem instances, small and large. The exploitation of symmetries for improving search has been the subject of research for many years, but there is yet to be a method that is easy to use and that gives good performance under different search heuristics. We present a method of symmetry breaking, Lightweight Dynamic Symmetry Breaking (LDSB), that seeks to fill this void. We describe how LDSB focuses on common symmetries to maximise performance, and show experimentally that it performs consistently and is competitive with other dynamic symmetry breaking methods. Finally, we show how LDSB can be extended to much more general search techniques. When considered together, these contributions form the components of an automatic system for detecting the symmetries of a problem class, and exploiting those symmetries when solving different instances of that class.