Miracle-dz/UniFAR-FTUs huggingface dataset:
Journal of Internet Banking and Commerce

Abstract Today, with the development in wireless and mobile technologies, Mobile Commerce (m-commerce) is expected to make substantial impact on the business landscape. The mobile cellular market is the fastest growing telecommunication market in terms of subscriber numbers and popularity in India. Mobile Commerce market in India is expected to grow at a CAGR of 71.06 percent by the year 2016. The substantial increase of the mobile users is linked with greater adoption for mobile-commerce in India. At present, Indian users indulge in mobile purchases for low value transactions such as entertainment services, games, and music downloads. Mobile commerce is quite popular in the developed countries but in India it is in nascent stage and yet to take off. This study captures users’ acceptance behaviour towards M-commerce by applying theory of planned behaviour (TPB) model developed by Ajzen (1991). Results indicate that attitude and perceived behavioural control have positive and significant impact on individual’s intention while subjective norm has a positive but not significant impact on intention. Further, intention is found to be significantly and positively related with behaviour.
Mouse satellite DNA, centromere structure, and sister chromatid pairing

The experiments described were directed toward understanding relationships between mouse satellite DNA, sister chromatid pairing, and centromere function. Electron microscopy of a large mouse L929 marker chromosome shows that each of its multiple constrictions is coincident with a site of sister chromatid contact and the presence of mouse satellite DNA. However, only one of these sites, the central one, possesses kinetochores. This observation suggests either that satellite DNA alone is not sufficient for kinetochore formation or that when one kinetochore forms, other potential sites are suppressed. In the second set of experiments, we show that highly extended chromosomes from Hoechst 33258-treated cells (Hilwig, I., and A. Gropp, 1973, Exp. Cell Res., 81:474-477) lack kinetochores. Kinetochores are not seen in Miller spreads of these chromosomes, and at least one kinetochore antigen is not associated with these chromosomes when they were subjected to immunofluorescent analysis using anti-kinetochore scleroderma serum. These data suggest that kinetochore formation at centromeric heterochromatin may require a higher order chromatin structure which is altered by Hoechst binding. Finally, when metaphase chromosomes are subjected to digestion by restriction enzymes that degrade the bulk of mouse satellite DNA, contact between sister chromatids appears to be disrupted. Electron microscopy of digested chromosomes shows that there is a significant loss of heterochromatin between the sister chromatids at paired sites. In addition, fluorescence microscopy using anti-kinetochore serum reveals a greater inter-kinetochore distance than in controls or chromosomes digested with enzymes that spare satellite. We conclude that the presence of mouse satellite DNA in these regions is necessary for maintenance of contact between the sister chromatids of mouse mitotic chromosomes.
Improving Performance of Dynamic Programming via Parallelism and Locality on Multicore Architectures

Dynamic programming (DP) is a popular technique which is used to solve combinatorial search and optimization problems. This paper focuses on one type of DP, which is called nonserial polyadic dynamic programming (NPDP). Owing to the nonuniform data dependencies of NPDP, it is difficult to exploit either parallelism or locality. Worse still, the emerging multi/many-core architectures with small on-chip memory make these issues more challenging. In this paper, we address the challenges of exploiting the fine grain parallelism and locality of NPDP on multicore architectures. We describe a latency-tolerant model and a percolation technique for programming on multicore architectures. On an algorithmic level, both parallelism and locality do benefit from a specific data dependence transformation of NPDP. Next, we propose a parallel pipelining algorithm by decomposing computation operators and percolating data through a memory hierarchy to create just-in-time locality. In order to predict the execution time, we formulate an analytical performance model of the parallel algorithm. The parallel pipelining algorithm achieves not only high scalability on the 160-core IBM Cyclops64, but portable performance as well, across the 8-core Sun Niagara and quad-cores Intel Clovertown.
Chapter 4 Model Reduction for Control Design for Distributed Parameter Systems

During the past decades, considerable advances have been made in the numerical simulation of controlled distributed parameter systems (DPS). In the opinion of this author, this numerical sophistication has not been matched by the theoretical understanding of the approximation processes involved. The aim of this chapter is to shed a little light on some of the system theoretic properties which determine the suitability of an approximation scheme for control design of DPS. At the same time, a new robust control design is proposed which leads to robust, low-order controllers. It is shown that, at least for the class of exponentially stabilizable and detectable state linear systems with bounded and finite-rank input and output operators, this design always leads to a low-order controller which stabilizes not only the original system but also a large class of perturbations. This robustly stabilizing controller also guarantees bounds on the main performance indices. The class of systems considered in this chapter is that of the exponentially stabilizable and detectable state linear systems Σ(A,B,C) on the Hilbert space Z, where A is the infinitesimal generator of the strongly continuous semigroup T (t) on Z, and the operators B and C are finite-rank and bounded; B ∈ L(Cm, Z), C ∈ L(Z, C). The basic properties required of a finite-dimensional controller for this system are:
Semantic Role Labeling of NomBank: A Maximum Entropy Approach

This paper describes our attempt at NomBank-based automatic Semantic Role Labeling (SRL). NomBank is a project at New York University to annotate the argument structures for common nouns in the Penn Treebank II corpus. We treat the NomBank SRL task as a classification problem and explore the possibility of adapting features previously shown useful in PropBank-based SRL systems. Various NomBank-specific features are explored. On test section 23, our best system achieves F1 score of 72.73 (69.14) when correct (automatic) syntactic parse trees are used. To our knowledge, this is the first reported automatic NomBank SRL system.
Support Vector Machine Classifiers as Applied to AVIRIS Data

Traditionally, classi ers model the underlying density of the various classes and then nd a separating surface. However density estimation in high-dimensional spaces su ers from the Hughes e ect (Hughes, 1968), (Landgrebe, 1999): For a xed amount of training data the classi cation accuracy as a function of number of bands reaches a maximum and then declines, because there is limited amount of training data to estimate the large number of parameters needed. Thus usually, a feature selection step is rst performed on the high-dimensional data to reduce its dimensionality.
Fuzzy Optimization of a Belt-conveyor Bridge

1. Abstract In the structural optimization of a ring-stiffened cylindrical shell the unknown variables are the shell thickness as well as the thickness and the number of flat rings. The shell diameter enables to realize a belt-conveyor structure inside of the shell. The uniformly distributed vertical load consists of dead and live load. The design constraints relate to the local shell buckling strength, to the panel ring buckling and to the deflection of the simply supported bridge. The cost function includes the material and fabrication costs. The fabrication cost function is formulated according to the fabrication sequence and includes also the cost of forming of shell elements into the cylindrical shape as well as the cost of cutting of the flat plate ring-stiffeners. As an alternative to safety factors one may try to describe the uncertain data via a non-probabilistic description of uncertainty, in particular the fuzzy-set based analysis. Several procedures are described and the optimum design level can be obtained either based on failure possibility or of membership value satisfaction. The fuzzy-based optimization becomes a sequential minimization of unconstrained convex scalar functions, from which a Pareto solution is obtained. A branch and bound procedure is associated with this algorithm to provide a discrete solution.
Extensive Central Nervous System Cryptococcal Disease Presenting as Immune Reconstitution Syndrome in a Patient with Advanced HIV: Report of a Case and Review of Management Dilemmas and Strategies

One of the complications of the use of antiretroviral therapy (ART), immune reconstitution inflammatory syndrome (IRIS), is particularly problematic in the management of cryptococcal meningitis. We present the case of a 35-year-old male with acquired immune deficiency syndrome diagnosed with extensive central nervous system (CNS) cryptococcal disease, including meningitis and multiple intracranial cysts, diagnosed eight weeks after the initiation of ART. The patient experienced a relapsing and remitting clinical course despite repeated courses of potent antifungal therapy and aggressive management of raised intracranial pressure. This review highlights therapeutic dilemmas and strategies in the management of CNS cryptococcosis complicated with IRIS and highlights gaps in available treatment guidelines.
A Note on Disjoint Arborescences

Recently Kamiyama, Katoh, and Takizawa have shown a theorem on packing arc-disjoint arborescences that is a proper extension of Edmonds' theorem on disjoint spanning branchings. We show a further extension of their theorem, which makes clear an essential rôle of a reachability condition played in the theorem. The right concept required for the further extension is " convexity " instead of " reachability. "
Novel approaches to low leakage and area efficient VLSI design

The development of digital integrated circuits is challenged by higher power consumption. The combination of higher clock speeds, greater functional integration, and smaller process geometries has contributed to significant growth in power density. Scaling improves transistor density and functionality on a chip. Scaling helps to increase speed and frequency of operation and hence higher performance. As voltages scale downward with the geometries threshold voltages must also decrease to gain the performance advantages of the new technology but leakage current increases exponentially. Thinner gate oxides have led to an increase in gate leakage current. Today leakage power has become an increasingly important issue in processor hardware and software design. With the main component of leakage, the sub-threshold current, exponentially increasing with decreasing device dimensions, leakage commands an ever increasing share in the processor power consumption. In 65 nm and below technologies, leakage accounts for 30-40% of processor power. According to the International Technology Roadmap for Semiconductors (ITRS) [1], leakage power dissipation may eventually dominate total power consumption as technology feature sizes shrink. While there are several process technology and circuit-level solutions to reduce leakage in processors, we propose novel approaches for reducing both leakage and dynamic power with minimum possible area and delay trade off.
A comparative study of three-implant supported fixed dentures and two-implant retained overdentures in edentulous mandible: Treatment efficacy and patient satisfaction

KUANG-HAN CHANG: A Comparative Study of Three-implant Supported Fixed Dentures and Two-implant Retained Overdentures in Edentulous Mandible: Treatment Efficacy and Patient Satisfaction (Under the direction of Lyndon Cooper) The mandibular two-implant overdentures have been shown to be a highly successful treatment. However, for patients who desire a fixed prosthesis, overdentures may not satisfy their needs. This prospective study is aimed to compare (1) prosthetic outcome, (2) patient satisfaction, and (3) survival rates of Astra Tech implants between two-implant overdentures (2IOD) and three-implant fixed dentures (3IFD). Twenty complete edentulous patients were randomly and equally assigned to two groups. The implants were immediate loaded with a relined denture right after denture delivery and implant surgery. Ball attachments were inserted at 8 weeks and 3IFD delivered at 16 weeks. Patient satisfaction and panoramic radiographic survey were investigated at 6 and 12 months. Both treatments had significant and positive effect in patient satisfaction and quality of life. None of the fifty implants had failed at 6 months follow-up; therefore, implant survival rate was 100%. Prosthetic complications were generally few and easily manageable.
Compassion is partially selfless: Public self-concept accessibility following compassion and threat

ABSTRACT Drawing from the largely separate literatures on compassion and the self-concept, we hypothesized that compassion would lead to literal selflessness in the form of reduced cognitive accessibility of the public self-concept. Across two studies, we found preliminary support for this hypothesis. Study 1 (N = 154) found that a compassion induction, relative to control conditions, reduced accessibility of the public self, but did not impact accessibility of the true self. Study 2 (N = 172) employed methodological refinements and found that compassion reduced accessibility of the public self, but only when preceded by a threat manipulation. These studies’ implications and possible explanations for their apparent inconsistencies in findings are discussed. Taken together, these studies provide partial support for a unique causal link between compassion and reduced cognitive accessibility of the public self.
ВЗАЄМОЗВ’ЯЗОК ВИКОРИСТАННЯ СОЦІАЛЬНИХ МЕРЕЖ З ПСИХОЛОГІЧНИМ БЛАГОПОЛУЧЧЯМ ПІДЛІТКІВ

The article is devoted to the methodological and conceptual foundations of the future study of the degree of influence of social networks on the psychological health of modern adolescents in connection with their personal characteristics of virtual communication. The relevance of the study is due to the development of modern technologies, in particular gadgets, through which the person is constantly online, resulting in a growing share of virtual communication in the total amount of social interactions of the individual. The use of social networks has both negative and positive sides. The main advantage of communication in social networks is to keep in touch with friends, relatives at a distance. The negative side of social networks is that they are becoming a large-scale platform for threats, harassment and cyberbullying. Communication in social networks is a relatively new phenomenon, so the exact effect on mental health and emotional well-being of young people is currently unclear. However, recent studies have raised serious concerns about the possible harmful effects on the psychological well-being of young people. This kind of communication does not unite people, often having an adverse effect on mental health, personal development and self-esteem of adolescents. These individual characteristics are markers of psychological distress, which, in turn, determine the level of mental health. We assume that the level of pathological involvement in social networks by adolescents may be associated with subclinical depression, anxiety, feeling of loneliness, a feeling of constant tension and a subjective experience of stress.
Applications of RCU

The RCU synchronization mechanism has been the subject of a fair amount of research over the past few years. This paper takes a look at RCU from a application-oriented perspective and surveys the usage of RCU in real-world systems. The first part of this work deals with the Linux RCU API while the second part discusses user-level implementations. In addition, this paper contrasts the advantages and drawbacks of using RCU, helping system developers in the choice of the proper synchronization primitives. 1. A SHORT INTRODUCTION TO RCU The purpose of this section is to familiarize the reader with the theoretic foundations of RCU which are required to understand the rest of this paper. After a brief overview of the main properties of RCU, we will introduce the concept of grace periods which is of crucial importance to RCU. The sections ends with a short example. RCU (read-copy-update) is a synchronization mechanism that allows readers to unconditionally make forward progress, even in the presence of updaters. Because of this property, RCU differs greatly from conventional mutual exclusion synchronization techniques such as read-write locks in which write operations cause a blockade of all readers [3]. RCU thus allows concurrency between multiple readers and a single updater (multiple updaters must be serialized with other mechanisms such as spinlocks). Conceptually, the fundamental idea of RCU is to maintain multiple versions of objects and ensure that each version remains intact as long as there are readers that hold references to it and use the data contained in that version of the object [10]. RCU also provides efficient mechanisms to publish new versions of an object and for detecting when old versions can safely be freed. The main objective of RCU is to supply low-overhead read-side primitives in order to make read operations as fast as possible. In addition, readers must not adhere to complicated locking protocols and can avoid precautions such as disabling interrupts. A RCU implementation must ensure that a version of a data structure is not destroyed as long as there exist threads with read access to it. Of course, the question that now arises is how RCU can determine that no more readers are accessing a given version of a data object in order to free the associated memory. The answer is best described using a graphical representation (see Figure 1). In this graphic, a Client 1 Module Client 2
BER performance improvement for secure wireless communication systems based on CSK- STBC techniques

There has been a growing interest in the use of chaotic techniques for enabling secure communication in recent years. This need has been motivated by the emergence of a number of wireless services which require the channel to provide very low bit error rates (BER) along with information security. This paper investigates the feasibility of using chaotic communications over Multiple-Input Multiple-Output (MIMO) channels by combining chaos modulation with a suitable Space Time Block Code (STBC). It is well known that the use of Chaotic Modulation techniques can enhance communication security. However, the performance of systems using Chaos modulation has been observed to be inferior in BER performance as compared to conventional communication schemes. In order to overcome this limitation, we have proposed the use of a combination of Chaotic modulation and Alamouti Space Time Block Code. We have studied the performance of Chaos Shift Keying (CSK) with 2×1 Alamouti scheme for different chaotic maps over Additive White Gaussian Noise (AWGN) and Rayleigh fading channels. Our simulations indicate that the use of the Alamouti schemes can allow service providers to enhance security without degrading the BER performance while communicating over these channels.
1 3 M ay 2 00 3 Spectral element simulations of buoyancy-driven flow

This paper is divided in two parts. In the first part, a brief review of a spectral element method for the numerical solution of the incompressible Navier-Stokes equations is given. The method is then extended to compute buoyant flows described by the Boussi-nesq approximation. Free convection in closed two-dimensional cavities are computed and the results are in very good agreement with the available reference solutions. INTRODUCTION At the previous conference (Wasberg et al., 2001) we presented a method for the numerical solution of the incompressible Navier-Stokes equations by spectral element methods. In this contribution we will present the current status of this development effort, in particular new developments to enable computation of buoyancy-driven flows described by the Boussinesq approximation. We will first give a review of the status of the basic Navier-Stokes solver. Then we describe the Boussinesq model and discuss its numerical implementation. Simulations of free-convection flows in closed two-dimensional cavities show very good agreement with available reference solutions.
Illegal immigration and enforcement along the U.S.-Mexico border; an overview

Illegal Mexico-U.S. migration has increased dramatically in recent decades. In this article, Pia Orrenius evaluates the causes of this migration and gives an overview of the enforcement and policy responses to date. Orrenius assesses the effectiveness of border enforcement by looking at developments in the smuggling industry, such a smuggler use rates and fees, as well as changes in border-crossing sites. The findings suggest early attempts at enforcement fueled an increase in the demand of and supply of smugglers, with no rise in prices. Only the most recent enforcement initiatives, most significantly Operations Hold-the-Line and Gatekeeper, have been successful in reversing the thirty-year decline in smugglers' fees and moving migrants to remote crossing points. Risks have risen along with smugglers' fees, as reflected in an increasing number of crossing-related deaths since 1995. Orrenius concludes that Mexican and U.S. policymakers should consider a bilateral labor and migration agreement.
Image Retrieval Using Boosting Algorithm

This project uses an offline learning algorithm to get a highly efficient classifier for online image retrieval. The boosting algorithm is adopted for the learning process. It chooses a small number (10 in this project) of highly selective features from a very large feature set (there are totally over 45,000 features in the set in this project) and combine them together to get a strong classifier for retrieval. The computation of such strong classifier is very fast so that it can be applied to image retrieval on a very large dataset.
The Far-Ultraviolet Spectrum of NGC 4151 as Observed with the Hopkins Ultraviolet Telescope on Astro-2

We observed NGC 4151 on six separate occasions at intervals of 1 to 3 days using the Hopkins Ultraviolet Telescope during the flight of Astro-2 aboard the space shuttle Endeavour in 1995 March. The far-UV spectra cover the spectral range from the interstellar cutoff at 912 to 1840 Å with a resolution of 2-4 Å. The mean spectrum, representing 4752 s of integration time, has a signal-to-noise ratio of approximately 30, and it shows profound differences compared to that obtained during the flight of Astro-1 in 1990 December. The continuum, 5.3 × 10-13 erg cm-2 s-1 Å-1 at 1455 Å, is 5 times brighter, the brightest UV flux ever observed for NGC 4151. All high-ionization absorption lines have strengthened considerably—S VI λλ933, 945, C III λ977, O VI λλ1032, 1038, N V λλ1239, 1243, Si IV λλ1394, 1403, and C IV λλ1548, 1551. The Lyman series absorption lines have also increased in strength, with the bulk of the absorption requiring a neutral hydrogen column density of 5 × 1017 cm-2 covering only 78% of the UV source with an effective Doppler parameter of 350 km s-1. However, up to 5 × 1020 cm-2 of neutral hydrogen that fully covers the source could be present in gas with a thermal Doppler parameter of 20 km s-1. Single-zone photoionization models of warm absorbing gas are unable to account for both the X-ray absorbing material and the UV-absorbing gas, largely because of the wide range of ionization states present in the UV and the X-ray.