Miracle-dz/UniFAR-FTUs huggingface dataset:
The Study on the Influence Mechanism of Website Features on Consumer Purchase Intention

The paper proposes a model that affects the consumers' purchase intention. The model is composed of four variables: the website features, the initial trust of consumers, the continued trust of consumers and consumers shopping intention. The results show that there is a causal relationship between these four variables, and the initial consumer trust and the continued trust play a mediation role in the relationship.
Organizational Communication in Telework: Towards Knowledge Management

Smooth communication through Face-to-face communication across hierarchy has been currently recognized as a critical method for organizational knowledge sharing and knowledge creation. However, these previous research findings are not applicable to telework environment which has much limited face-to-face communication compared with the traditional organization. Although knowledge creation researchers always emphasize on face-to-face communication, research in organizational communication in distributed environment such as telework, are very rare in this field. Further, this research has discussed KM in telework, based on only existing literature, and has not done any empirical analysis. To study knowledge management in telework, we investigate organizational communication in telework. This paper focuses on communication across organizational hierarchy. To achieve the aim of this research, we analyze teleworker’s job related communication data that is collected through log-sheets from two telework groups, and then investigate their communication patterns. Finally, based on our findings, we suggest some implications and hypotheses.
On Fréchet differentiability of Lipschitz maps between Banach spaces

A well-known open question is whether every countable collection of Lipschitz functions on a Banach space X with separable dual has a common point of Frechet differentiability. We show that the answer is positive for some infinite-dimensional X. Previously, even for collections consisting of two functions this has been known for finite-dimensional X only (although for one function the answer is known to be affirmative in full generality). Our aims are achieved by introducing a new class of null sets in Banach spaces (called F-null sets), whose definition involves both the notions of category and measure, and showing that the required differentiability holds almost everywhere with respect to it. We even obtain existence of Frechet derivatives of Lipschitz functions between certain infinite-dimensional Banach spaces; no such results have been known previously. Our main result states that a Lipschitz map between separable Banach spaces is Frechet differentiable F-almost everywhere provided that it is regularly Gateaux differentiable F-almost everywhere and the Gateaux derivatives stay within a norm separable space of operators. It is easy to see that Lipschitz maps of X to spaces with the Radon-Nikodym property are Gateaux differentiable F-almost everywhere. Moreover, Gateaux differentiability implies regular Gateaux differentiability with exception of another kind of negligible sets, so-called a-porous sets. The answer to the question is therefore positive in every space in which every r-porous set is F-null. We show that this holds for C(K) with K countable compact, the Tsirelson space and for all subspaces of co, but that it fails for Hilbert spaces.
No . 16 / 2012 Two spinorial drift-diffusion models for quantum electron transport in graphene

Two drift-diffusion models for the quantum transport of electrons in graphene, which account for the spin degree of freedom, are derived from a spinorial Wigner equation with relaxation-time or massand spin-conserving matrix collision operators using a Chapman-Enskog expansion around the thermal equilibrium. Explicit models are computed by assuming that both the semiclassical parameter and the scaled Fermi energy are sufficiently small. For one of the models, the global existence of weak solutions, entropy-dissipation properties, and the exponential long-time decay of the spin vector are proved. Finally, numerical simulations of a one-dimensional ballistic diode using both models are presented, showing the temporal behavior of the particle density and the components of the spin vector.
When May an Agent Act on Behalf of an ERISA Plan Participant or Beneficiary?

This article discusses when a pension or welfare plan governed by the Employee Retirement Income Security Act of 1974, as amended ("ERISA") may, and when it must, comply with directions of an attorney in fact under a state-law power of attorney or court-appointed guardians. ERISA and the regulations thereunder do not explicitly address the appointment of agents with respect to the exercise of any rights on behalf of an individual participant or beneficiary other than the ability of an agent to pursue benefit claims on behalf of the agent’s principal.This article argues that an ERISA plan must defer to any agent acting on behalf of a participant or beneficiary under a state-law power of attorney or guardianship to the extent the individual is unable to exercise those ERISA benefit rights so that the individual is not deprived of those rights. This is the case whether the disability is a result of the individual being a minor, being an illiterate, being physically disabled, or lacking mental capacity. Moreover, the applicable state relief laws to encourage the acceptance of such powers would also probably be applicable to ERISA plans because such provisions are needed for the effective administration of power of attorney state laws for a disabled participant that ERISA does not otherwise preempt. State law may authorize an individual to be the agent of an ERISA plan participant or beneficiary. This article discusses when ERISA permits such an individual, on behalf of the agent's principal, to: (1) pursue a benefit claim; (2) obtain plan or benefit information; (3) determine the time and form of benefit payment; (4) determine to whom the plan makes a benefit payment; (5) make beneficiary designations; (6) consent to the waiver of the principal’s right to a spousal survivor benefit; (7) assign benefit rights and thereby create a beneficiary; (8) determine the amount, if any, of the principal’s employee contributions to the plan; (9) obtain information about the principal’s investment options; or (10) determine how to invest the principal’s plan assets. The article also discusses when ERISA and the Health Insurance Portability and Accountability Act ("HIPAA") permit a state-law agent to (1) make healthcare decisions for the agent’s principal in ERISA healthcare plans, or (2) obtain information from a healthcare plan, or a healthcare reimbursement plan.
Improving corpus annotation productivity: a method and experiment with interactive tagging

Corpus linguistic and language technological research needs empirical corpus data with nearly correct annotation and high volume to enable advances in language modelling and theorising. Recent work on improving corpus annotation accuracy presents semiautomatic methods to correct some of the analysis errors in available annotated corpora, while leaving the remaining errors undetected in the annotated corpus. We review recent advances in linguistics-based partial tagging and parsing, and regard the achieved analysis performance as sufficient for reconsidering a previously proposed method: combining nearly correct but partial automatic analysis with a minimal amount of human postediting (disambiguation) to achieve nearly correct corpus annotation accuracy at a competitive annotation speed. We report a pilot experiment with morphological (part-of-speech) annotation using a partial linguistic tagger of a kind previously reported with a very attractive precision-recall ratio, and observe that a desired level of annotation accuracy can be reached by using human disambiguation for less than 10\% of the words in the corpus.
Interobserver reproducibility of the assessment of severity of complaints, grip strength, and pressure pain threshold in patients with lateral epicondylitis.

OBJECTIVE To evaluate the interobserver reproducibility of the assessment of severity of complaints, grip strength, and pressure pain threshold in patients with lateral epicondylitis in primary care. DESIGN Two physiotherapists assessed independently, and in randomized order, the severity of complaints scored on an 11-point numeric rating scale, pain-free grip strength, maximum grip strength, and pressure pain threshold. SETTING Primary care center in the Netherlands. PARTICIPANTS Fifty patients were assessed by both physiotherapists. INTERVENTIONS Not applicable. MAIN OUTCOME MEASURES Intraclass correlation coefficients (ICCs) and 95% confidence intervals (CIs) were calculated to assess interobserver reliability. The Bland and Altman method was used to assess interobserver agreement, which included calculation of the mean difference between the observers (d), the 95% CI for d, the standard deviation of the differences, and the 95% limits of agreement. Finally, the smallest detectable difference (SDD) was calculated. RESULTS The ICC for the severity of complaints was.90. The ICCs for the pain-free grip strength and maximum grip strength were.97 and.98, respectively. The pressure pain threshold showed a lower reliability (ICC=.77). The interobserver agreement for all outcome measures was good, but systematic differences in assessment between the physiotherapists were found for the maximum grip strength and pressure pain threshold. For pressure pain threshold, the SDD was clearly larger than the predefined acceptable difference of 10% of the total range of measurement. CONCLUSIONS The interobserver reliability of severity of complaints and grip strength was excellent, whereas the pressure pain threshold showed unsatisfactory reliability. Grip strength and overall assessment of the severity of complaints are useful and reliable measures for the assessment of lateral epicondylitis. Pain-free grip strength, in particular, is relatively easy to perform and has been shown to be associated with other measures of functional disability in patients with lateral epicondylitis. We, therefore, recommend the use of pain-free grip strength in both research and clinical practice.
Radiant Vector Flow Method for ArbitrarilyOriented Scene Text Detection

Text detection and recognition is a hot topic for researchers in the field of image processing. It gives attention to Content based Image Retrieval community in order to fill the semantic gap between low level and high level features. Several methods have been developed for text detection and extraction that achieve reasonable accuracy for natural scene text as well as multi-oriented text. However, it is noted that most of the methods use classifier and large number of training samples to improve the text detection accuracy. The multi-orientation problem can be solved using the connected component analysis method. Since the images are high contrast images, the classifier with connected component analysis based feature training work well for achieving better accuracy. It cannot be used directly for text detection in video because of low contrast and complex background which causes problem such as disconnections and loss of shapes. The deciding classifier and geometrical features of the components is not that much easy in this case. To overcome from this problem our proposed research uses radiant Vector Flow and Grouping based Method for Arbitrarily Oriented Scene text Detection method. The GVF of edge pixels in the Sobel edge map of the input frame is explored to identify the dominant edge pixels which represent the text components. These extracts edge components method corresponding to dominant pixels in the Sobel edge map, which we call Text Candidates (TC) of the text lines. Experimental results on different datasets including arbitrarily oriented text data, horizontal and non-horizontal text data, Hua’s data and ICDAR-03 data.
Viral DNA carried by human immunodeficiency virus type 1 virions

A fundamental step in the replication of retroviruses is the reverse transcription of the viral RNA genome into a double-stranded DNA provirus. Retroviruses are believed to carry genomic information only as RNA, and synthesis of DNA is thought to start only after virus entry into the infected cell. We report here that infectious mature human immunodeficiency virus type 1 virions contain viral DNA of heterogeneous size. This heterogeneity seems to result from random stops of reverse transcription during minus- and plus-strand synthesis. The DNA carried by human immunodeficiency virus type 1 virions presumably originates from reverse transcription which takes place prior to or during formation of the mature virus particle.
Are there right hemisphere contributions to visually-guided movement? Manipulating left hand reaction time advantages in dextrals

Many studies have argued for distinct but complementary contributions from each hemisphere in the control of movements to visual targets. Investigators have attempted to extend observations from patients with unilateral left- and right-hemisphere damage, to those using neurologically-intact participants, by assuming that each hand has privileged access to the contralateral hemisphere. Previous attempts to illustrate right hemispheric contributions to the control of aiming have focussed on increasing the spatial demands of an aiming task, to attenuate the typical right hand advantages, to try to enhance a left hand reaction time advantage in right-handed participants. These early attempts have not been successful. The present study circumnavigates some of the theoretical and methodological difficulties of some of the earlier experiments, by using three different tasks linked directly to specialized functions of the right hemisphere: bisecting, the gap effect, and visuospatial localization. None of these tasks were effective in reducing the magnitude of left hand reaction time advantages in right handers. Results are discussed in terms of alternatives to right hemispheric functional explanations of the effect, the one-dimensional nature of our target arrays, power and precision given the size of the left hand RT effect, and the utility of examining the proportions of participants who show these effects, rather than exclusive reliance on measures of central tendency and their associated null hypothesis significance tests.
Satellite selection based on WDOP concept and convex geometry

Positioning accuracy is typically evaluated assuming that measurement errors are identically Gaussian distributed zero-mean and uncorrelated. For these conditions, Geometrical Dilution Of Precision (GDOP) alone is typically used as a satellite selection criterion. However, this is an idealization that leads to suboptimal results. Under this assumption, a satellite selection method based on convex geometry theory was proposed by the authors elsewhere. A modification of the mentioned satellite selection algorithm is proposed here, where the impact of different measurement errors is considered for the selection computation.
Support for comprehensive reuse

Reuse of products, processes and other knowledge will be the key to enable the software industry to achieve the dramatic improvement in productivity and quality required to satisfy anticipated growing demands. Although experience shows that certain kinds of reuse can be successful, general success has been elusive. A software life-cycle technology that allows comprehensive reuse of all kinds of software-related experience could provide the means of achieving the desired order-of-magnitude improvements. In this paper, we introduce a comprehensive framework of models, model-based characterisation schemes, and support mechanisms for better understanding, evaluating, planning and supporting all aspects of reuse.
Large-Scale TCP Packet Flow Analysis for Common Protocols Using Apache TM Hadoop

Data is commonly exchanged between hosts over the Internet using the Transmission Control Protocol (TCP) and Internet Protocol (IP) protocols. TCP, built on top of IP, associates each piece of data (packet) sent between two unique applications on different hosts with an ongoing connection, or flow, between these hosts. This paper presents an overview of TCP flows, a methodology for detecting flows given a large network traffic trace file, and the results of analyzing a 20GB trace. This analysis provides information about the average duration of a flow, average number of packets sent during a flow, average number of bytes sent during a flow, average idle time during a flow, and average throughput during a flow. These results are further categorized by known application protocols, and an analysis of the different characteristics of each protocol is given.
Implementation of a Human-Like Bot in a First Person Shooter : Second Place Bot at BotPrize 2008

A first person shooter game is a game genre where fun in the game resorts to the skill of the opponents. In particular, when the opponents are bots, adjustment of their skill levels as well as implementation of their human-likeness are important research issues that many research groups have been studying recently in order to make bots more interesting to play with. This led to a contest called BotPrize 2008 held in December 2008 where bots and human players competed with each other for human-likeness. In this paper, we analyze play video clips of all bots participated in this contest, including our bot ranked 2nd in terms of human-likeness, and derive five factors related to bot’s human-likeness. In addition, we further improve our bot considering these five factors and conduct an experiment comparing our original bot, the one submitted to the contest, and the improved one. Experimental results confirm the effectiveness of our improvements, showing that the human-likeness of the improved one has risen significantly. Keywords—FPS, Unreal Tournament, Human-likeness, Believability, Bot
Tracking people in presence of occlusion

Tracking humans is a diicult problem because of the non-rigid nature of the human body, and the frequent occlusion encountered among people. We present a framework to track multiple people in a xed camera situation. Our framework deals implicitly with occlusion, and is able to correctly label people during occlusion. We rst segment a person into classes of similar color using the Expectation Maximization algorithm. Then we use a maximum a posteriori probability approach to track these classes from frame to frame. The system deals well with partial and complete occlusion. Results are presented for an indoor sequence in an ooce environment.
Gemini: maintenance support environment based on code clone analysis

Maintaining software systems is becoming a more complex and difficult task, as the scale becomes larger. It is generally said that code cloning is one of the factors that make software maintenance difficult. A code clone is a code portion in source files that is identical or similar to another. If some faults are found in a code clone, it is necessary to correct the faults in its all code clones. However for large scale software, it is very difficult to correct them completely. We develop a maintenance support environment, called Gemini, which visualizes the code clone information from a code clone detection tool, CCFinder. Using Gemini, we can specify a set of distinctive code clones through the GUI (scatter plot and metrics graph about code clones), and refer the fragments of source code corresponding to the clone on the plot or graph.
Backstepping controller design for nonlinear stochastic systems under a risk-sensitive cost criterion

Develops a methodology for recursive construction of optimal and near-optimal controllers for strict-feedback stochastic nonlinear systems under a risk-sensitive cost function criterion. The design procedure follows the integrator backstepping methodology, and the controllers obtained guarantee any desired level of long-term average cost, for a given risk-sensitivity parameter /spl theta/. Furthermore, they lead to closed-loop system trajectories that are bounded in probability, and in some cases asymptotically stable in the large. These results also generalize to nonlinear systems with strongly stabilizable zero dynamics.
Garbage Collection: Managing a Stable Heap

Modern database systems use transactions to achieve a high degree of fault-tolerance. Many modern pro gramming languages and systems provide garbage collected heap storage, which frees the programmer from the job of explicitly deallocating storage. In this paper we describe integrated garbage collection and recovery algorithms for managing a stable heap in which accessible objects survive both system crashes and media failures. A garbage collector typically both moves and modifies objects which can lead to problems when the heap is stable because a system crash after the start of collection but before enough of the reorganized heap reaches the disk can leave the disk in an inconsistent state. Furthermore, collection has to be coordinated with the recovery system. We present a collection algorithm and recovery system that solves these problems.
Design of the active split offset casters based omni-directional vehicle in high acceleration condition

Up to now, most of studies about omni-directional vehicles have been focusing on omni-directional maneuverability. In contrast, this research would investigate deeply the operation of an omni-directional mobile robot that is able to move with high acceleration. In order to fulfill that goal, the vehicle utilizes the structure of Active Split Offset Casters (ASOC). This paper is mainly focused on hardware design and control algorithm to achieve high acceleration while preserving the vehicle's isotropy and optimum controllability.
Spread Betweenness Centrality : The Power of Quasi-Shortest Paths

Betweenness centrality metrics usually underestimate the importance of nodes that are close to shortest paths but do not exactly fall on them. In this paper, we reevaluate the importance of such nodes and propose the spread betweenness centrality, a novel metric that assigns weights to paths (and, consequently, to nodes on these paths) according to how close they are to shortest paths. The paths that are just slightly longer than the shortest one are defined as quasi-shortest paths, and they are able to increase or to decrease the importance of a node according to how often the node falls on them. We compare the proposed metric with the traditional, distance-scaled, and random walk betweenness centralities using four network datasets with distinct characteristics. The results show that the proposed metric, besides better assessing the topological role of a node, is also more stable than the other metrics; this means that network dynamics affect less our metric than others. Such a property could help avoid, for instance, the waste of resources caused when data follow only the shortest paths and reduce associated costs.