cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Implementation of Vertical Handoff Algorithm between IEEE802.11 WLAN and CDMA Cellular Network
Creators: name: Narisetti, Mary
Publisher: name: Georgia State University
Year: 2006

description: Today's wireless users expect great things from tomorrow?s wireless networks. These expectations have been fueled by hype about what the next generations of wireless networks will offer. The rapid increase of wireless subscribers increases the quality of services anytime, anywhere, and by any-media becoming indispensable. Integration of various networks such as CDMA2000 and wireless LAN into IP-based networks is required in these kinds of services, which further requires a seamless vertical handoff to 4th generation wireless networks.  The proposed handoff algorithm between WLAN and CDMA2000 cellular network is implemented. The results of the simulation shows the behavior of the handoff and the time spent in WLAN or CDMA. The number of weak signal beacons determines whether a handoff is required or not. In this algorithm, traffic is classified into real-time and non real-time services.
iC2mpi: A Platform for Parallel Execution of Graph-Structured Iterative Computations
Creators: name: Botadra, Harnish
Publisher: name: Georgia State University
Year: 2006

description: Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, including directive-based approaches and parallelization platforms. These solutions have not always been successful, in part because many try to address all types of applications. We propose a platform for parallelization of a class of applications that have similar computational structure, namely graph-structured iterative applications. iC2mpi is a unique proof-of-concept prototype platform that provides relatively easy parallelization of existing sequential programs and facilitates experimentation with static partitioning and dynamic load balancing schemes. We demonstrate with various generic application graph topologies and an existing application, namely a time-stepped battlefield management simulation, that our platform can produce good performance with very little effort.
PagGRF11 Overexpression Promotes Stem Development and Dwarfing in Populus
Creators: name: Tian, Yanting
name: Zhao, Ye
name: Sun, Yuhan
name: El-Kassaby, Yousry A.
name: Song, Guoyong
name: Mi, Yueqi
name: Han, Juan
name: Li, Yun
Publisher: name: Multidisciplinary Digital Publishing Institute
Year: 2023

description: Poplar is not only an important woody plant, but also a model species for molecular plant studies. We identified PagGRF11 (pAxG07Gg0005700), a homolog of the Arabidopsis AtGRF1 (AT4G37740) and AtGRF2 (AT2G22840) gene. We transformed the poplar clone “84K” with PagGRF11, and the transgenic overexpressed plants (PagGRF11-OE) showed plant height reduction (dwarfing), stem diameter increase, internode shortening, and larger leaf area. The Arabidopsis overexpression line grf-oe (Overexpression of PagGRF11 in Arabidopsis), mutant line atgrf (a loss-of-function mutant of the AtGRF1 gene of Arabidopsis thaliana), and mutant trans-complementary line atgrf+oe (overexpression of PagGRF11 in mutant plants (atgrf)) also showed different leaf size phenotypes. Further, tissue sections revealed that increased xylem production was the main cause of stem thickening. Transcriptome differential expression analysis of PagGRF11 overexpressed and control plants showed that PagGRF11 promoted CCCH39(C3H39) expression. The expression profile of CCCH39 in different tissues showed that it was highly expressed in xylem. Yeast single hybrid and instantaneous double luciferase assay results showed that PagGRF11 directly transcribed and activated CCCH39 expression through interaction with cis-acting element GARE (TCTGTTG), thus promoting xylem development. This is the first finding that GRF positively regulates xylem development through CCCH39 expression activation and further suggests that PagGRF11 is a potential target for increasing wood yield.
The effect of book format and parent language dominance on shared book reading in bilingual families
Creators: name: Quirk, Erin
name: Byers-Heinlein, Krista
name: Brouillard, Melanie
Publisher: name: Open Science Framework
Year: 2022
Subjects: subject: First and Second Language Acquisition
subject: Linguistics
subject: FOS: Languages and literature
subject: Bilingual, Multilingual, and Multicultural Education
subject: Education
subject: Social and Behavioral Sciences
subject: Psychology
subject: FOS: Psychology

description: This online observational study will investigate shared reading between parents and children – an established predictor of children's language outcomes – in an understudied group, namely bilingual families with pre-school-aged children. We will analyze video recorded shared reading sessions to investigate the role of parents' language dominance and book format – traditional single-language and bilingual formats in French and English – on shared reading quantity and quality. We will also view the effect of parents' language dominance on shared reading quantity and quality across the different book formats. Finally, we will compare our findings with findings from another group of researchers conducting a similar study with Spanish-English bilinguals in the United States.
Installations & Experimental Printmaking - Book Review
Creators: name: Harding, Richard
Publisher: name: RMIT University
Year: 2024
Subjects: classificationCode: 360602
subject: Fine arts

description: Research Background
This article is aligned with the ongoing process of review and critique of publications that present themselves annually to the Print Council of Australia. Writers, curators and academics such as Anne Kirker, Francis E Parker and Tim Mosely have also contribute to this evolving procedure.

Significance
IMPRINT is the quarterly magazine published by the Print Council of Australia. Each edition contains news and information which is of vital interest to artists, curators, students and collectors. IMPRINT's readership is global and internationally renowned for its coverage of current print based exhibitions through reviews, critiques of current print media practice, profiles of contemporary artists, research material and technical experimentation.

This article critiques Alexia Tala's current publication on installations & experimental printmaking offering the reader the opportunity to further their understanding of unconventional modes of printmaking through aligning the book with past and current art practitioners both here in Australia and internationally. Artists such as Felix Gonzales -Torres and John Hitchcock are referenced.
Inferring the Structure of Signal Transduction Networks from Interactions between Cellular Components and Inferring Haplotypes from Informative SNPS
Creators: name: Westbrooks, Kelly
Publisher: name: Georgia State University
Year: 2006

description: Many problems in bioinformatics are inference problems, that is, the problem objective is to infer something based upon a limited amount of information. In this work we explore two different inference problems in bioinformatics. 	The first problem is inferring the structure of signal transduction networks from interactions between pairs of cellular components. We present two contributions towards the solution to this problem: an mixed integer program that produces and exact solution, and an implementation of an approximation algorithm in Java that was originally described by DasGupta et al. An exact solution is obtained for a problem instance consisting of real data. 	The second problem this thesis examines is the problem of inferring complete haplotypes from informative SNPs. In this work we describe two variations of the linear algebraic method for haplotype prediction and tag SNP selection: Two different variants of the algorithm are described and implemented, and the results summarized.
Power Line Communication and Sensing Using Time Series Forecasting
Creators: name: Huo, Yinjia
name: Prasad, Gautham
name: Lampe, Lutz
name: Leung, Victor Chung Ming, 1955-
Publisher: name: Multidisciplinary Digital Publishing Institute
Year: 2023

description: Smart electrical grids rely on data communication to support their operation and on sensing for diagnostics and maintenance. Usually, the roles of communication and sensing equipment are different, i.e., communication equipment does not participate in sensing tasks and vice versa. Power line communication (PLC) offers a cost-effective solution for joint communication and sensing for smart grids. This is because the high-frequency PLC signals used for data communication also reveal detailed information regarding the health of the power lines that they travel through. Traditional PLC-based power line or cable diagnostic solutions are dependent on prior knowledge of the cable type, network topology, and/or characteristics of the anomalies. In this paper, we develop a power line sensing technique that can detect various types of cable anomalies without any prior domain knowledge. To this end, we design a solution that first uses time-series forecasting to predict the PLC channel state information at any given point in time based on its historical data. Under the approximation that the prediction error follows a Gaussian distribution, we then perform chi-squared statistical test to build an anomaly detector which identifies the occurrence of a cable fault. We demonstrate the effectiveness and universality of our sensing solution via evaluations conducted using both synthetic and real-world data extracted from low- and medium-voltage distribution networks.
A Design and Analysis of Graphical Password
Creators: name: Suo, Xiaoyuan
Publisher: name: Georgia State University
Year: 2006

description: The most common computer authentication method is to use alphanumerical usernames and passwords. This method has been shown to have significant drawbacks. For example, users tend to pick passwords that can be easily guessed. On the other hand, if a password is hard to guess, then it is often hard to remember. To address this problem, some researchers have developed authentication methods that use pictures as passwords. In this paper, I conduct a comprehensive survey of the existing graphical password techniques. I classify these techniques into two categories: recognition-based and recall-based approaches. I discuss the strengths and limitations of each method and point out the future research directions in this area. I also developed three new techniques against the common problem exists in the present graphical password techniques. In this thesis, the scheme of each new technique will be proposed; the advantages of each technique will be discussed; and the future work will be anticipated.
A Characterization of Wireless Network Interface Card Active Scanning Algorithms
Creators: name: Gupta, Vaibhav
Publisher: name: Georgia State University
Year: 2006

description: In this thesis, we characterize the proprietary active scanning algorithm of several wireless network interface cards. Our experiments are the first of its kind to observe the complete scanning process as the wireless network interface cards probe all the channels in the 2.4GHz spectrum. We discuss the: 1) correlation of channel popularity during active scanning and access point channel deployment popularity; 2) number of probe request frames statistics on each channel; 3) channel probe order; and 4) dwell time. 

The knowledge gained from characterizing wireless network interface cards is important for the following reasons: 1) it helps one understand how active scanning is implemented in different hardware and software; 2) it can be useful in identifying a wireless rogue host; 3) it can help implement Active Scanning in network simulators; and 4) it can radically influence research in the familiar fields like link-layer handovers and effective deployment of access points.
An Enhanced Algorithm to Find Dominating Set Nodes in Ad Hoc Wireless Networks
Creators: name: Nanuvala, Naresh
Publisher: name: Georgia State University
Year: 2006

description: A wireless ad hoc network is a collection of wireless mobile nodes forming a temporary network without the aid of any established infrastructure or centralized administration. A connection is achieved between two nodes through a single hop transmission if they are directly connected or multi-hop transmission if they are not.

The wireless networks face challenges to form an optimal routing protocol. Some approaches are based on a dominating set, which has all the nodes either in the set or within its neighborhood. The proposed algorithm is an enhancement of the distributed algorithm proposed by Wu and Li. The simulation results from the new algorithm are compared to results from Wu and Li?s algorithm. The simulation results show that the average dominating set of nodes decreased considerable after applying the new algorithm. The decrease in number of dominate set nodes is not very much noticeable in low density space.
Comparison of Methods Used for Aligning Protein Sequences
Creators: name: Madangopal, Sangeetha
Publisher: name: Georgia State University
Year: 2006

description: Comparing protein sequences is an essential procedure that has many applications in the field of bioinformatics. The recent advances in computational capabilities and algorithm design, simplified the comparison procedure of protein sequences from several databases. 
Various algorithms have emerged using state of the art approaches to match protein sequences based on structural and functional properties of the amino acids. The matching involves structural alignment, and this alignment may be global; comprising of the whole length of the protein, or local; comprising of the sub-sequences of the proteins. 
Families of related proteins are found by clustering sequence alignments. The frequency distributions of the amino acids within these different clusters define the sequence profile. The best alignment algorithm uses these profiles. In this thesis, we have studied different profile alignment algorithms where the cost function for comparing two profiles is changed. These are compared to the FFAS3 (Fold and Function Assignment) algorithm.
64 x 64 Bit Multiplier Using Pass Logic
Creators: name: Thankachan, Shibi
Publisher: name: Georgia State University
Year: 2006

description: Due to the rapid progress in the field of VLSI, improvements in speed, power and area are quite evident. Research and development in this field are motivated by growing markets of portable mobile devices such as personal multimedia players, cellular phones, digital camcorders and digital cameras. Among the recently popular logic families, pass transistor logic is promising for low power applications as compared to conventional static CMOS because of lower transistor count. This thesis proposes four novel designs for Booth encoder and selector logic using pass logic principles. These new designs are implemented and used to build a 64 x 64-bit multiplier. The proposed Booth encoder and selector logic are competitive with the existing and shows substantial reduction in transistor count. It also shows improvements in delay when compared to two of the three published works.
A Domain Based Approach to Crawl the Hidden Web
Creators: name: Pandya, Milan
Publisher: name: Georgia State University
Year: 2006

description: There is a lot of research work being performed on indexing the Web. More and more sophisticated Web crawlers are been designed to search and index the Web faster.  But all these traditional crawlers crawl only the part of Web we call ?Surface Web?. They are unable to crawl the hidden portion of the Web. These traditional crawlers retrieve contents only from surface Web pages which are just a set of Web pages linked by some hyperlinks and ignoring the hidden information. Hence, they ignore tremendous amount of information hidden behind these search forms in Web pages. Most of the published research has been done to detect such searchable forms and make a systematic search over these forms. Our approach here will be based on a Web crawler that analyzes search forms and fills tem with appropriate content to retrieve maximum relevant information from the database.
DCT Implementation on GPU
Creators: name: Tokdemir, Serpil
Publisher: name: Georgia State University
Year: 2006

description: There has been a great progress in the field of graphics processors. Since, there is no rise in the speed of the normal CPU processors; Designers are coming up with multi-core, parallel processors. Because of their popularity in parallel processing, GPUs are becoming more and more attractive for many applications. With the increasing demand in utilizing GPUs, there is a great need to develop operating systems that handle the GPU to full capacity. GPUs offer a very efficient environment for many image processing applications. This thesis explores the processing power of GPUs for digital image compression using Discrete cosine transform.
Scalable Proxy Architecture for Mobile and Peer-to-Peer Networks
Creators: name: Jayanthi, Praveena
Publisher: name: Georgia State University
Year: 2006

description: The growth of wireless telecommunications has stipulated the interest for anywhere-anytime computing. The synergy between networking and mobility will engender new collaborative applications with mobile devices on heterogeneous platforms. One such middleware is ?SYSTEM ON MOBILE DEVICES?, SYD developed by the Yamacraw Embedded Systems research team. This type of middleware is an opening step towards Peer-to-Peer mobile networks. This project envisioned collaborative applications among mobile devices and PDAs were used as servers. This thesis studies various existing architectures in mobile computing and their scalability issues. We also proposed new scalable flexible thick client proxy system FTCPS, an architecture suitable for mobile Peer-to-Peer networks. Our empirical study showed that FTCPS has low response time compared to other architectures.
Toward a Heuristic Model for Evaluating the Complexity of Computer Security Visualization Interface
Creators: name: Wang, Hsiu-Chung
Publisher: name: Georgia State University
Year: 2006

description: Computer security visualization has gained much attention in the research community in the past few years. However, the advancement in security visualization research has been hampered by the lack of standardization in visualization design, centralized datasets, and evaluation methods. We propose a new heuristic model for evaluating the complexity of computer security visualizations. This complexity evaluation method is designed to evaluate the efficiency of performing visual search in security visualizations in terms of measuring critical memory capacity load needed to perform such tasks. Our method is based on research in cognitive psychology along with characteristics found in a majority of the security visualizations. The main goal for developing this complexity evaluation method is to guide computer security visualization design and compare different visualization designs. Finally, we compare several well known computer security visualization systems. The proposed method has the potential to be extended to other areas of information visualization.
An Agent Based Transaction Manager for Multidatabase Systems
Creators: name: Madiraju, Sugandhi
Publisher: name: Georgia State University
Year: 2006

description: A multidatabase system (MDBMS) is a facility that allows users to access data located in multiple autonomous database management systems (DBMSs) at different sites. To ensure global atomicity for multidatabase transactions, a reliable global atomic commitment protocol is a possible solution. In this protocol a centralized transaction manager (TM) receives global transactions, submits subtransactions to the appropriate sites via AGENTS. An AGENT is a component of MDBS that runs on each site; AGENTS after receiving subtransactions from the transaction manager perform the transaction and send the results back to TM. We have presented a unique proof-of-concept, a JAVA application for an Agent Based Transaction Manager that preserves global atomicity. It provides a user friendly interface through which reliable atomic commitment protocol for global transaction execution in multidatabase environment can be visualized. We demonstrated with three different test case scenarios how the protocol works. This is useful in further research in this area where atomicity of transactions can be verified for protocol correctness.
QOS Multimedia Multicast Routing: A Component Based Primal Dual Approach
Creators: name: Hussain, Faheem
Publisher: name: Georgia State University
Year: 2006

description: The QoS Steiner Tree Problem asks for the most cost efficient way to multicast multimedia to a heterogeneous collection of users with different data consumption rates. We assume that the cost of using a link is not constant but rather depends on the maximum bandwidth routed through the link. Formally, given a graph with costs
on the edges, a source node and a set of terminal nodes, each one with a bandwidth
requirement, the goal is to find a Steiner tree containing the source, and the cheapest
assignment of bandwidth to each of its edges so that each source-to-terminal path in
the tree has bandwidth at least as large as the bandwidth required by the terminal.
Our main contributions are: (1) New flow-based integer linear program formulation
for the problem; (2) First implementation of 4.311 primal-dual constant factor approximation
algorithm; (3) an extensive experimental study of the new heuristics and
of several previously proposed algorithms.
Structure Learning of a Behavior Network for Context Dependent Adaptability
Creators: name: Li, Ou
Publisher: name: Georgia State University
Year: 2006

description: One mechanism for an intelligent agent to adapt to substantial environmental changes is to change its decision making structure. Pervious work in this area has developed a context-dependent behavior selection architecture that uses structure change, i.e., changing the mutual inhibition structures of a behavior network, as the main mechanism to generate different behavior patterns according to different behavioral contexts. Given the important of network structure, this work investigates how the structure of a behavior network can be learned. We developed a structure learning method based on generic algorithm and applied it to a model crayfish that needs to survive in a simulated environment. The model crayfish is controlled by a mutual inhibition behavior network, whose structures are learned using the GA-based algorithm for different environment configurations. The results show that it is possible to learn robust and consistent network structures allowing intelligent agents to behave adaptively in a particular environment.
Robot-In-The-Loop Simulation to Support Multi-Robot System Development: A Dynamic Team Formation Example
Creators: name: Azarnasab, Ehsan
Publisher: name: Georgia State University
Year: 2007

description: Modeling and simulation provides a powerful technology for engineers and managers to understand, design, and evaluate a system under development. Traditionally, simulation is only used in early stages of a system
design. However, with the advances of hardware and software technology, it is now possible to extend simulation to late stages for supporting a full life cycle simulation-based development. Robot-in-the-loop simulation, where real robots work together with virtual ones, has been developed to support such a development process to bridge the gap between simulation
and reality.
An Energy-Efficient Distributed Algorithm for k-Coverage Problem in Wireless Sensor Networks
Creators: name: Vu, Chinh
Publisher: name: Georgia State University
Year: 2007

description: Wireless sensor networks (WSNs) have recently achieved a great deal of attention due to its numerous attractive applications in many different fields. Sensors and WSNs possesses a number of special characteristics that make them very promising in many applications, but also put on them lots of constraints that make issues in sensor network particularly difficult. These issues may include topology control, routing, coverage, security, and data management.  In this thesis, we focus our attention on the coverage problem. Firstly, we define the Sensor Energy-efficient Scheduling for k-coverage (SESK) problem. We then solve it by proposing a novel, completely localized and distributed scheduling approach, naming Distributed Energy-efficient Scheduling for k-coverage (DESK) such that the energy consumption among all the sensors is balanced, and the network lifetime is maximized while still satisfying the k-coverage requirement. Finally, in related work section we conduct an extensive survey of the existing work in literature that focuses on with the coverage problem.
Codex Melbourne - Spatialised Performance System. Composed by Richard Barrett
Creators: name: Harvey, Lawrence
name: Hannam, Jeffrey
Publisher: name: RMIT University
Year: 2024
Subjects: classificationCode: 330105
subject: Architectural science and technology
classificationCode: 360304
subject: Music performance

description: Spatial sound concerts using large-scale sound diffusion systems (up to 32 loudspeakers) are a unique form of public performance. The practice has complex technical, technological, aesthetic, perceptual and artistic requirements to seamlessly deliver concert programs. Only a small number of international electroacoustic studios regularly conduct public concerts at this scale. As preparation for a major performance at Huddersfield Contemporary Music Festival, SIAL Sound Studios and Elision Ensemble collaborated on a spatialised performance of Codex by Richard Barrett, in the Iwaki Studios, ABC Southbank Melbourne. This performance used a real-time version of our spatial sound diffusion system, to control up to 8 channels of instrumental sound over 8 speakers. The performance revealed the need for further work, in particular the need for a more robust system where 3D spatial sound trajectories could be pre-defined then easily modified during rehearsals. The number of sound operators and their roles was expanded from 2 to 3, and further work was needed on speaker locations, and a robust technique for speaker location initialization and signal path management. Additional workshops and recordings were carried out for a 4 channel microphone technique that would capture the local spatial sound field of a performer (sound immediately round a musician) to be scaled over a larger area. Pre-performance research and development was supported by the ARC, LP0882872, while the concert was broadcast live-to-air on 'New Music Up Late' on ABC Classic FM, 10:30pm, 26 March 2011. With Elision Ensemble; ARC Linkage Grant; also see http://www.abc.net.au/classic/content/2011/12/10/3382380.htm
An Automated XML-Based Webform Management System
Creators: name: Phoungphol, Piyaphol
Publisher: name: Georgia State University
Year: 2007

description: In a web application, "webform" plays an important role in providing interactions between users and a server. To develop a webform in conventional method, developers have to create many files including HTML-JavaScript, SQL script, and many server-side programs to process to data.

In this thesis, we propose a new language, Webform Language (WFL). WFL can considerably decrease developing time of webform by describing it in XML and a parser will automatically generate all necessary files. In addition, we give an option for user to describe a webform in another language, called Simple Webform Language (SWFL). The syntax of a SWFL is simple and similar to the ?CREATE TABLE? statement in SQL. When a parser parse webform description in SWFL, it translated the description to WFL first, and then processed it by as normal WFL.
Distributed Algorithms for Improving Wireless Sensor Network Lifetime with Adjustable Sensing Range
Creators: name: Aung, Aung
Publisher: name: Georgia State University
Year: 2007

description: Wireless sensor networks are made up of a large number of sensors deployed randomly in an ad-hoc manner in the area/target to be monitored. Due to their weight and size limitations, the energy conservation is the most critical issue. Energy saving in a wireless sensor network can be achieved by scheduling a subset of sensor nodes to activate and allowing others to go into low power sleep mode, or adjusting the transmission or sensing range of wireless sensor nodes. 
In this thesis, we focus on improving the lifetime of wireless sensor networks using both smart scheduling and adjusting sensing ranges. Firstly, we conduct a survey on existing works in literature and then we define the sensor network lifetime problem with range assignment. We then propose two completely localized and distributed scheduling algorithms with adjustable sensing range. These algorithms are the enhancement of distributed algorithms for fixed sensing range proposed in the literature. The simulation results show that there is almost 20 percent improvement of network lifetime when compare with the previous approaches.
Protein Secondary Structure Prediction Using Support Vector Machines, Nueral Networks and Genetic Algorithms
Creators: name: Reyaz-Ahmed, Anjum
Publisher: name: Georgia State University
Year: 2007

description: Bioinformatics techniques to protein secondary structure prediction mostly depend on the information available in amino acid sequence. Support vector machines (SVM) have shown strong generalization ability in a number of application areas, including protein structure prediction.   In this study, a new sliding window scheme is introduced with multiple windows to form the protein data for training and testing SVM. Orthogonal encoding scheme coupled with BLOSUM62 matrix is used to make the prediction. First the prediction of binary classifiers using multiple windows is compared with single window scheme, the results shows single window not to be good in all cases. Two new classifiers are introduced for effective tertiary classification. This new classifiers use neural networks and genetic algorithms to optimize the accuracy of the tertiary classifier. The accuracy level of the new architectures are determined and compared with other studies. The tertiary architecture is better than most available techniques.
An Analysis of the MOS under Conditions of Delay, Jitter and Packet Loss and an Analysis of the Impact of Introducing Piggybacking and Reed Solomon FEC for VOIP
Creators: name: Ribadeneira, Alexander
Publisher: name: Georgia State University
Year: 2007

description: Voice over IP (VoIP) is a real time application that allows transmitting voice through the Internet network. Recently there has been amazing progress in this field, mainly due to the development of voice codecs that react appropriately under conditions of packet loss, and the improvement of intelligent jitter buffers that perform better under conditions of variable inter packet delay. In addition, there are other factors that indirectly benefited VoIP. Today, computer networks are faster due to the advances in hardware and breakthrough algorithms. As a result, the quality of VoIP calls has improved considerably. However, the quality of VoIP calls under extreme conditions of packet loss still remains a major problem that needs to be addressed for the next generation of VoIP services. This thesis concentrates in making an analysis of the effects that network impairments, such as: delay, jitter, and packet loss have in the quality of VoIP calls and approaches to solve this problem. Finally, we analyze the impact of introducing forward error correction (FEC) Piggybacking and Reed Solomon codes for VoIP. To measure the mean opinion score of VoIP calls we develop an application based on the E-Model, and utilize perceptual evaluation of speech quality (PESQ).
Motivations and Trade-Offs for Sustainability in Family Forestry and Tourism Firms: A Cross-National Survey
Creators: name: Nikolakis, William
name: Olaru, Doina
name: Roco, Lisandro
name: Reyes, René
Publisher: name: Multidisciplinary Digital Publishing Institute
Year: 2022

description: Family firms are the foundation of economies across the world. Yet, little is understood about what motivates sustainability in these firms, particularly in developing economies. In this study, we examine family forestry and tourism firms in Chile and India and use a novel stated-choice method to understand preferences for sustainability and the trade-offs with profit maximization, law and regulation, and family relations (among others). There were heterogeneous preferences across the sample, with respondents favoring financial outcomes and viewing regulation negatively. Respondents preferred positive environmental impacts, and this was significantly favored by tourism firms. Forestry firms were particularly focused on maintaining satisfactory family relationships, where there was stronger family involvement in the firm’s management decisions. Indian respondents were more likely to prefer the expansion option in the choice study (financial outcomes), while Chileans preferred the eco-labeling choice (sustainability), suggesting more supportive sustainability norms in Chile. Chileans were more likely to exceed legal compliance in their choice selection and favored positive environmental impacts more. Overall, tourism firms were larger in terms of revenues and favored the eco-labeling choice with positive environmental impacts but with minimal regulations, while forestry favored expansion. These differences may be driven by the resources available to tourism firms for supporting sustainability measures and the importance of sustainability to their business models. Policies to support sustainability among family firms must account for their heterogeneity and must provide supports and incentives rather than regulations to facilitate sustainability.
A Physical Estimation based Continuous Monitoring Scheme for Wireless Sensor Networks
Creators: name: Deshmukh, Wiwek
Publisher: name: Georgia State University
Year: 2007

description: Data estimation is emerging as a powerful strategy for energy conservation in sensor networks. In this thesis is reported a technique, called Data Estimation using Physical Method (DEPM), that efficiently conserves battery power in an environment that may take a variety of complex manifestations in real situations. The methodology can be ported easily with minor changes to address a multitude of tasks by altering the parameters of the algorithm and ported on any platform. The technique aims at conserving energy in the limited energy supply source that runs a sensor network by enabling a large number of sensors to go to sleep and having a minimal set of active sensors that may gather data and communicate the same to a base station. DEPM rests on solving a set of linear inhomogeneous algebraic equations which are set up using well-established physical laws. The present technique is powerful enough to yield data estimation at an arbitrary number of point-locations, and provides for easy experimental verification of the estimated data by using only a few extra sensors.
Supplementary document for Efficient nano-photonic antennas based on dark states in quantum emitter rings - 5518600.pdf
Creators: name: Moreno-Cardoner, Maria
name: Holzinger, Rapahel
name: Ritsch, Helmut
Publisher: name: Optica Publishing Group
Year: 2025
Subjects: Uncategorized

description: Simplified model based on an effective dipole to replace the ring
A Domain-Specific Conceptual Query System
Creators: name: Shen, Xiuyun
Publisher: name: Georgia State University
Year: 2007

description: This thesis presents the architecture and implementation of a query system resulted from a domain-specific conceptual data modeling and querying methodology. The query system is built for a high level conceptual query language that supports dynamically user-defined domain-specific functions and application-specific functions. It is DBMS-independent and can be translated to SQL and OQL through a normal form. Currently, it has been implemented in neuroscience domain and can be applied to any other domain.
A Distributed Approach to Crawl Domain Specific Hidden Web
Creators: name: Desai, Lovekeshkumar
Publisher: name: Georgia State University
Year: 2007

description: A large amount of on-line information resides on the invisible web - web pages generated dynamically from databases and other data sources hidden from current crawlers which retrieve content only from the publicly indexable Web. Specially, they ignore the tremendous amount of high quality content "hidden" behind search forms, and pages that require authorization or prior registration in large searchable electronic databases. To extracting data from the hidden web, it is necessary to find the search forms and fill them with appropriate information to retrieve maximum relevant information. To fulfill the complex challenges that arise when attempting to search hidden web i.e. lots of analysis of search forms as well as retrieved information also, it becomes eminent to design and implement a distributed web crawler that runs on a network of workstations to extract data from hidden web. We describe the software architecture of the distributed and scalable system and also present a number of novel techniques that went into its design and implementation to extract maximum relevant data from hidden web for achieving high performance.
Informative SNP Selection and Validation
Creators: name: Mohan Babu, Diana
Publisher: name: Georgia State University
Year: 2007

description: The search for genetic regions associated with complex diseases, such as cancer or Alzheimer's disease, is an important challenge that may lead to better diagnosis and treatment. The existence of millions of DNA variations, primarily single nucleotide polymorphisms (SNPs), may allow the fine dissection of such associations. However, studies seeking disease association are limited by the cost of genotyping SNPs. Therefore, it is essential to find a small subset of informative SNPs (tag SNPs) that may be used as good representatives of the rest of the SNPs. Several informative SNP selection methods have been developed. Our experiments compare favorably to all the prediction and statistical methods by selecting the least number of informative SNPs.  We proposed algorithms for faster prediction which yielded acceptable trade off. We validated our results using the k-fold test and its many variations.
Fuzzy Mouse Cursor Control System for Computer Users with Spinal Cord Injuries
Creators: name: Surdilovic, Tihomir
Publisher: name: Georgia State University
Year: 2006

description: People with severe motor-impairments due to Spinal Cord Injury (SCI) or Spinal Cord Dysfunction (SCD), often experience difficulty with accurate and efficient control of pointing devices (Keates et al., 02). Usually this leads to their limited integration to society as well as limited unassisted control over the environment. The questions ?How can someone with severe motor-impairments perform mouse pointer control as accurately and efficiently as an able-bodied person?? and ?How can these interactions be advanced through use of Computational Intelligence (CI)?? are the driving forces behind the research described in this paper. Through this research, a novel fuzzy mouse cursor control system (FMCCS) is developed. The goal of this system is to simplify and improve efficiency of cursor control and its interactions on the computer screen by applying fuzzy logic in its decision-making to make disabled Internet users use the networked computer conveniently and easily. The FMCCS core consists of several fuzzy control functions, which define different user interactions with the system. The development of novel cursor control system is based on utilization of motor functions that are still available to most complete paraplegics, having capability of limited vision and breathing control. One of the biggest obstacles of developing human computer interfaces for disabled people focusing primarily on eyesight and breath control is user?s limited strength, stamina, and reaction time. Within the FMCCS developed in this research, these limitations are minimized through the use of a novel pneumatic input device and intelligent control algorithms for soft data analysis, fuzzy logic and user feedback assistance during operation. The new system is developed using a reliable and cheap sensory system and available computing techniques. Initial experiments with healthy and SCI subjects have clearly demonstrated benefits and promising performance of the new system: the FMCCS is accessible for people with severe SCI; it is adaptable to user specific capabilities and wishes; it is easy to learn and operate; point-to-point movement is responsive, precise and fast. The integrated sophisticated interaction features, good movement control without strain and clinical risks, as well the fact that quadriplegics, whose breathing is assisted by a respirator machine, still possess enough control to use the new system with ease, provide a promising framework for future FMCCS applications. The most motivating leverage for further FMCCS development is however, the positive feedback from persons who tested the first system prototype.
Bodily Algorithms Workshop
Creators: name: Anderson, Charles
name: Schork, Tim
name: Obarzanek, Gideon
Publisher: name: RMIT University
Year: 2024
Subjects: classificationCode: 330199
subject: Architecture not elsewhere classified
classificationCode: 360403
subject: Drama, theatre and performance studies

description: Devised and hosted by Charles Anderson, Tim Schork & Gideon Obarzanek, Bodily Algorithms invited participants to explore space through rule-based systems and interactive modelling. Working from a series of rules and everyday objects, participants created a performance connecting the ordered and the unpredictable.Bodily Algorithms is a work made by Charles Anderson and Tim Schork as part of their on-going collaborative project titled Punto in Aria. This project seeks to explore and test computational design tools, dynamic modeling and generative systems as means through which time based processes and complex systems can be engaged with and responded to. Experimenting with rule based systems, interactive and performative modes of modeling the project generates a range of spatial propositions across scales and design disciplines. A particular focus for this project is a reconsideration of the contemporary city and its space/time of 'performance'. Both theatre buildings and public spaces continue to be constructed in cities around the world but by-and-large they remain passive receptacles for performance, reinforcing officially sanctioned social practices and disciplining the collective body into well behaved citizens that consume culture rather than actively co-create it. This project asks what is the space of performance in the 21st century - an age of media spectacles, social networking media, virtual and 'off-world' existences, fluid technologies and uncontainable prosthetically enhanced bodies? Though design propositions for buildings, civic spaces and 'other' physical and virtual spaces we will perhaps discover 'new strategies for experiencing performance as a more dynamic, creative and communal spatial event.'
Variable Stiffness Ankle Foot Orthotic
Creators: name: Fishel, John C.
name: Berger, Elijah K.
name: Durnil, Reece I.
name: Kerkhoff, Abigail R.
Publisher: name: Unknown
Year: 2025
Subjects: subject: Mechanical engineers
subject: Electrical engineering
subject: mobility disability
subject: foot drop
subject: ankle foot orthotic
subject: AFO
subject: stiffness
subject: stability

description: Approximately 12.2% of U.S. adults have some form of mobility disability. A common symptom
of these disabilities is foot drop, which causes the foot to drag during gait. This symptom is
commonly found in individuals with cerebral palsy, spina bifida, or other neuromuscular
dysfunctions. These patients are typically prescribed ankle foot orthotics (AFOs) to improve
their gait. AFOs typically consist of a foot plate and a calf band (with a Velcro closure),
connected by one or multiple struts. These struts are designed to provide the user either stability
or push-off power, which is determined by the strut stiffness. Previous work has been done to
vary the stiffness of the AFOs through the user’s gait cycle by the use of bulky/heavy series
elastic actuators and battery packs. The proposed device modulates stiffness and eliminates the
trade-off between stability and push-off power during the gait cycle. This was accomplished by
redesigning the AFO to use two static struts and one dynamic strut. The dynamic strut rotates
through multiple calculated positions, with each position providing different stiffnesses during
the gait cycle. A microcontroller collects pressure sensor data from the insoles of the orthotic,
determining the gait phase of the user. This data is used to adjust the dynamic strut’s orientation
to achieve the desired stiffness. The overall design achieves both stability and push-off power,
creating a more desirable AFO for patients.
AMMP-EXTN: A User Privacy and Collaboration Control Framework for a Multi-User Collaboratory Virtual Reality System
Creators: name: Ma, Wenjun
Publisher: name: Georgia State University
Year: 2007

description: In this thesis, we propose a new design of privacy and session control for improving a collaborative molecular modeling CVR system AMMP-VIS [1]. The design mainly addresses the issue of competing user interests and privacy protection coordination. Based on our investigation of AMMP-VIS, we propose a four-level access control structure for collaborative sessions and dynamic action priority specification for manipulations on shared molecular models. Our design allows a single user to participate in multiple simultaneous sessions. Moreover, a messaging system with text chatting and system broadcasting functionality is included. A 2D user interface [2] for easy command invocation is developed in Python. Two other key aspects of system implementation, the collaboration Central deployment and the 2D GUI for control are also discussed. Finally, we describe our system evaluation plan which is based on an improved cognitive walkthrough and heuristic evaluation as well as statistical usage data.
Genotype/Haplotype Tagging Methods and their Validation
Creators: name: Zhang, Jun
Publisher: name: Georgia State University
Year: 2007

description: This study focuses how the MLR-tagging for statistical covering, i.e. either maximizing average R2 for certain number of requested tags or minimizing number of tags such that for any non-tag SNP there exists a highly correlated (squared correlation R2 > 0.8) tag SNP. We compare with tagger, a software for selecting tags in hapMap project. MLR-tagging needs less number of tags than tagger in all 6 cases of the given test sets except 2. Meanwhile, Biologists can detect or collect data only from a small set. So, this will bring a problem for scientists that the estimates accuracy of tag SNPs when constructing the complete human haplotype map. This study investigates how the MLR-tagging for statistically coverage performs under unbias study. The experiment results shows MLR-tagging still select small amount of SNPs very well even without observing the entire SNP in the sample.