Miracle-dz/UniFAR-FTUs huggingface dataset:
The long-term influence of collaboration on citation patterns

This study assesses the long-term impact of collaboration in terms of the extent to which collaborators cite each other’s works and cite the same publications as each other. The results are based on coauthorship of academic articles during 1990–2010. Although the number of citations to, and common references with, collaborators both increase as the number of collaborators increases over time, these differ between collaborators. For example, many authors do not cite their collaborators and many collaborators do not cite any of the same references as each other. In contrast, many authors cite their collaborators extensively and many collaborators have many of the same references as each other. The extent of citing collaborators and citing the same references as cited by collaborators varies with the impact of the collaborators. These widely different properties may reflect some collaborators working in completely different research areas, others working in the same broad research area, and still others working within a narrow research area. Alternatively, some collaborators may learn from or monitor each other while others do not.
Automatic term recognition based on statistics of compound nouns and their components

In this paper, we propose a new approach to enhance automatic recognition systems for domain-specific terms. The approach is based on the statistics about the relation between a compound noun and its constituents that are simple nouns. More precisely, we focus on how many nouns adjoin the noun in question to form compound nouns. We propose several scoring methods based on this approach and experimentally evaluate them on the NTCIR1 TMREC test collection. The results are very promising, especially in low and high recall.
E‐learning: organizational requirements for successful feedback learning

Purpose – Feedback learning transforms social knowledge into individual knowledge. In this process, tension arises because the current knowledge impedes the assimilation of new learning. Therefore, the feedback requires what Schumpeter refers to as “creative destruction”: discarding, or at least setting aside, the institutional order to enact variations that allow intuitive insights and actions to surface and be pursued. This paper examines the relative importance and significance of “technological systems” on feedback and the effects on the creation of relational capital.Design/methodology/approach – In this paper, the literature is reviewed to identify relevant measures and present a structural equation model, which is validated through an empirical investigation of 151 SMEs in the Spanish technological and information systems sector.Findings – The results indicate that “the creative destruction” depends on the technology system of the company. Furthermore, if the creative destruction is a prior step in.
Recent advances on support vector machines research

Abstract Support vector machines (SVMs), with their roots in Statistical Learning Theory (SLT) and optimization methods, have become powerful tools for problem solution in machine learning. SVMs reduce most machine learning problems to optimization problems and optimization lies at the heart of SVMs. Lots of SVM algorithms involve solving not only convex problems, such as linear programming, quadratic programming, second order cone programming, semi-definite programming, but also non-convex and more general optimization problems, such as integer programming, semi-infinite programming, bi-level programming and so on. The purpose of this paper is to understand SVM from the optimization point of view, review several representative optimization models in SVMs, their applications in economics, in order to promote the research interests in both optimization-based SVMs theory and economics applications. This paper starts with summarizing and explaining the nature of SVMs. It then proceeds to discuss optimization.
Measuring Television Message Complexity as Available Processing Resources: Dimensions of Information and Cognitive Load

This article further tests the theoretical hypotheses supporting the use of number of camera changes (cc) and information introduced (ii) as indicators of resources allocated and resources required to process television messages. These two measures, combined, yield an indicator of available resources and can, therefore, be used as an indicator of television message complexity. Previous research has validated their use, averaged over time, as a global measure of message complexity. The two studies reported here test the underlying local complexity predictions and present support from two studies for the ii, cc combination as a valid indicator of local message complexity. Study 1 demonstrates that when a camera change has an increasing number of ii dimensions available resources become scarcer, eventually reaching cognitive overload. Study 2 examines the relative level of resources required for each of the seven dimensions, and demonstrates that specific theoretical groupings of dimensions (novelty, motivational, and cognitive) show differential impact on available resources. Results show that the individual dimensions increase required resources as predicted and that emotion change is the most cognitively taxing dimension. Together, the two studies increase our understanding of how the number of dimensions each individual dimension of ii increases cognitive load and provide strong support for the measure as an indicator of local message complexity.
Adaptive scheduling for differentiated services in an Ethernet passive optical network

Feature Issue on Optical Access Networks (OAN) The Ethernet passive optical network (EPON) is a technology viewed as an attractive solution to the "last mile" problem. The interleaved polling with adaptive cycle time (IPACT) is a remarkable medium access control (MAC) protocol for EPONs. The IPACT scheme supports two stages of scheduling. One is inter-optical network unit (ONU) scheduling. The other is intra-ONU scheduling. In this paper, we propose a systematic adaptive scheduling scheme to enhance the functions of the IPACT on both types of scheduling in order to achieve efficient bandwidth utilization of EPONs under unbalanced traffic and to provide class-of-service (COS) or differentiated services within an ONU. The simulation results show that our proposed scheduling scheme can improve the performance of the EPON system under unbalanced traffic loads and provide fair bandwidth allocation of the uplink to different types of traffic.
Experimental study of bifurcation and chaos in the buck-boost converter

Experimental evidence is provided to verify bifurcation and chaos phenomena, which have been analysed and studied in detail in other publications, in a current-mode controlled buck-boost converter which operates at 20 kHz. A discrete model for a buck-boost converter under current-mode control is proposed and used for the study. A good agreement between the theoretical study and experimental results is found.
The Baldwin effect works for functional, but not arbitrary, features of language.

Human languages are characterized by a number of universal patterns of structure and use. Theories differ on whether such linguistic universals are best understood as arbitrary features of an innate language acquisition device or functional features deriving from cognitive and communicative constraints. From the viewpoint of language evolution, it is important to explain how such features may have originated. We use computational simulations to investigate the circumstances under which universal linguistic constraints might get genetically fixed in a population of language learning agents. Specifically, we focus on the Baldwin effect as an evolutionary mechanism by which previously learned linguistic features might become innate through natural selection across many generations of language learners. The results indicate that under assumptions of linguistic change, only functional, but not arbitrary, features of language can become genetically fixed.
Maximum delay in buffered multistage interconnection networks

The author studies maximum delay in buffered multistage interconnection networks. His model differs from most in its assumptions about the traffic entering the network. Instead of using a stochastic model for the entering traffic, it is assumed that the entering traffic is unknown but satisfies certain regularity constraints. In case these constraints would not otherwise be satisfied, it is possible to devise and analyze processing (and the associated delay) that can be performed so that the constraints are satisfied. The constraints considered are well suited for bounding parameters of interest. For example, bounds on maximum network delay for each user of the network are easily obtained. The methods presented can be applied to a wide variety of models for network operation and configuration. <<ETX>>
Query Translation Using Evolutionary Programming for Multi-Lingual Information Retrieval

Multi-lingual information retrieval (IR) systems apply queries in one language to a document collection in several different languages with the goal of retrieving only those documents relevant to the query. At first glance, deep linguistic analysis and translation of the query appears necessary before retrievals can be performed. IR systems are unique in natural language processing, however, because a pattern of term occurrences in a document generally suffices to determine the subject matter; word order is largely irrelevant. Translated queries are therefore primarily derived by a mapping from a word set in the query language to a word set in the language of the derived query. Large parallel text collections with sentencelevel alignments can provide a baseline for evaluating the correctness of a query translation, but the determination of members of the query translation remains problematic. Constructing a query from machine-readable, bilingual dictionaries and assigning term weights by the evolutionary optimization of a population of potential weighting schemes presents a solution to the difficulties of generating translated queries. In this approach, differences in the rank statistics on the comparative recall results for a query against its native language and its translation against its native language determine the fitness of a tentative query translation.
PEMANFAATAN APLIKASI RED5 SEBAGAI STREAMING SERVER DI UNIVERSITAS SUMATERA UTARA

Pemanfaatan streaming video menjadi sarana yang efektif untuk berkomunikasi dan menyampaikan informasi. Aplikasi Red5 dapat berperan sebagai flash media server dan dimanfaatkan untuk melakukan live streaming video . Paper ini membahas tentang pengujian keandalan kinerja Red5 server yang di- install di Debian. Keandalan kinerja aplikasi streaming server diuji dengan melibatkan 30 klien dan dilakukan dengan pergantian parameter quality dan keyframe . Pada sisi server dihitung CPU usage, RAM, penggunaan bandwidth , serta tundaan waktu pada sisi klien.
Use of Verbal Protocol Analysis in the Investigation of a Manual Handling Task

Concurrent verbal protocols were used to collect reports of subjects' thoughts during the completion of a manual handling task, and to investigate whether the content of these thoughts was influenced by changes in the weights and positions of the loads which were handled. A taxonomy was constructed to help in the analysis of the potential effects of weight of the load and of load position on the numbers of reports of a range of dependent variables such as posture, load, elements of the task and outcome. An association was found between load position and numbers of references to posture when handling loads of 8kg weight. This suggested that postural awareness might be heightened when more extreme postures were adopted during the handling of loads above a weight threshold. However, the references were often ambiguous, raising concerns about the subjects' depth of awareness of the postures they were adopting.
TOWARDS COMMENT GENERATION FOR MPI PROGRAMS

As parallel architectures are becoming more commonplace, the development of parallel software that exploits the potential parallelism is increasingly important. Like sequential programs, these programs need to be maintained, which requires considerable time understanding the maintenance tasks and related software or documentation. Studies have shown that good comments can help programmers quickly understand a program’s functions. Unfortunately, few software projects adequately comment the code. This thesis work investigates the problem of automatically generating descriptive summary comments for functions in MPI parallel programs and presents an approach to generate such descriptive summary comments for parallel MPI Java methods. Given the signature and body of a method, the automatic comment generator identifies content for the summary and generates natural language text that summarizes the method’s overall actions. A base comment generator for sequential Java is modified for a first prototype for parallel MPI programs.
A Maximum Concurrent Network Flow Based Channel Assignment Algorithm for Wireless Mesh Networks

We proposed a maximum concurrent network flow based channel assignment algorithm (MCFCA) for wireless networks. In the MCFCA algorithm, we first use the maximum concurrent network flow algorithm to compute the maximum network capacity, then we assign each link a priority according to its link throughput, finally the channel is assigned to minimize the interference between neighbor nodes in the priority order. Performance simulation shows its effectiveness in channel assignment.
Perception of Temporal Patterns

To gain insight into the internal representation of temporal patterns, we studied the perception and reproduction of tone sequences in which only the tone-onset intervals were varied. A theory of the processing of such sequences, partly implemented as a computer program, is presented. A basic assumption of the theory is that perceivers try to generate an internal clock while listening to a temporal pattern. This internal clock is of a flexible nature that adapts itself to certain characteristics of the pattern under consideration. The distribution of accented events perceived in the sequence is supposed to determine whether a clock can (and which clock will) be generated internally. Further it is assumed that if a clock is induced in the perceiver, it will be used as a measuring device to specify the temporal structure of the pattern. The nature of this specification is formalized in a tentative coding model. Three experiments are reported that test different aspects of the model. In Experiment 1, subjects reproduced various temporal patterns that only differed structurally in order to test the hypothesis that patterns more readily inducing an internal clock will give rise to more accurate percepts. In Experiment 2, clock induction is manipulated experimentally to test the clock notion more directly. Experiment 3 tests the coding portion of the model by correlating theoretical complexity of temporal patterns based on the coding model with complexity judgments. The experiments yield data that support the theoretical ideas.
Complex color management using optimized nonlinear three-dimensional look-up tables

Many researchers are working on various aspects of color imaging. However, it is apparent from the papers published that it is difficult for many of them to produce high quality color matching and reproductions. While steps needed to produce calibrated color images are fairly well developed, the problem of implementation high quality color matching and reproduction continues to be a serious problem in terms of creating huge color matching data sets or complicated procedures and last the complexity of creating the appropriate mach is often very significant. To surmount this final barrier, this paper is proposes a method to reduce the complexity of the color matching and reproductions without sacrificing quality. Additionally the amount of data that is collected is also significantly reduced. The color tables are used typical color matching of many deice types. Most of the device color spaces are nonlinear and matching and characterization is done in changing conditions. Typical color image processing techniques use profiles consisting of sparse multi-dimensional lookup tables that interpolate between adjacent nodes to prepare an image for rendering. Due to the proliferation of low-cost colour devices (digital colour cameras, scanners, printers etc.) during the last few years, colour calibration has become an important issue.
Sign-select lookahead CORDIC based high-speed QR decomposition architecture for MIMO receiver applications

This paper presents a high-speed QR decomposition architecture for the multi-input-multi- output (MIMO) receiver based on Givens rotation. Under fast-varying channel, since the inverse matrix calculation has to be performed frequently in MIMO receiver, a high performance and low latency QR decomposition module is highly required. The proposed QR decomposition architecture is composed of Sign-Select Lookahead (SSL) coordinate rotation digital computer (CORDIC). In the SSL-CORDIC, the sign bits, which are computed ahead to select which direction to rotate, are used to select one of the last iteration results, therefore, the data dependencies on the previous iterations are efficiently removed. Our proposed QR decomposition module is implemented using TSMC 0.25 µm CMOS process. Experimental results show that the proposed QR architecture achieves 34.83% speed-up over the Compact CORDIC based architecture for the 4 × 4 matrix decomposition.
Processing VP-ellipsis and VP-anaphora with structurally parallel and nonparallel antecedents: An eye-tracking study

In this paper, we report on an eye-tracking study investigating the processing of English VP-ellipsis (John took the rubbish out. Fred did [] too) (VPE) and VP-anaphora (John took the rubbish out. Fred did it too) (VPA) constructions, with syntactically parallel versus nonparallel antecedent clauses (e.g., The rubbish was taken out by John. Fred did [] too/Fred did it too). The results show first that VPE involves greater processing costs than VPA overall. Second, although the structural nonparallelism of the antecedent clause elicited a processing cost for both anaphor types, there was a difference in the timing and the strength of this parallelism effect: it was earlier and more fleeting for VPA, as evidenced by regression path times, whereas the effect occurred later with VPE completions, showing up in second and total fixation times measures, and continuing on into the reading of the adjacent text. Taking the observed differences between the processing of the two anaphor types together with other research findings in the literature, we argue that our data support the idea that in the case of VPE, the VP from the antecedent clause necessitates more computation at the elision site before it is linked to its antecedent than is the case for VPA.
3D Face Recognition in the Conception of Sparse Representation

In this paper, a novel 3D face recognition method is proposed from the sparse representation point of view. Under the framework of sparse representation, the recognition problem is transformed to solve the problem of minimization L0-norm. Three types of facial geometrical features are extracted to describe 3D faces. According to the extracted features, 3D face recognition is conducted by applying to the ranking strategy of Fisher linear discriminant analysis. The experiments employed BJUT-3D datasets demonstrate the effectiveness of the proposed method.
An Indoor Position Estimation Method by Maximum Likelihood Algorithm Using Received Signal Strength

A lot of applications of sensor networks require the positions of human and objects in indoor environments. There are some methods for this purpose. In this paper, we use received signal strength (RSS) to estimate the position for its simplicity. However, RSS varies substantially owing to fading, shadowing, multipath effects and so on. Attenuation coefficient varies according to indoor environment. For this reason, the attenuation coefficient is determined before estimating the position of a target node in the conventional method. We propose a position estimation method that estimates a target node position and an attenuation coefficient simultaneously. Thus, the proposed method has no need to estimate the attenuation coefficient in the target environment preliminarily. To evaluate the position estimation accuracy of the proposed method, we developed the prototype system and experimented in our office. Multiple fixed target nodes were set in the target environments. The experiments show that the proposed method has about the same accuracy as the conventional one without preliminary data collection for attenuation coefficient estimation.
Using biomedical networks to prioritize gene–disease associations

correspondence: Joel Perdiz Arrais University of Aveiro, 3810-193 Aveiro, Portugal Tel +35 1234370500 Fax +35 1234370545 email jpa@ua.pt Abstract: Understanding the genetic foundations of genetic diseases, such as cancer, Alzheimer disease, or Huntington’s disease, is critical to the development of new diagnostics and treatments. Several computational methods have been used to speed up the discovery process, eg, by selecting the molecular targets for a given disease. However, despite the achievements obtained over recent years, better solutions are still required. This paper presents an innovative computational method that addresses the problem of using disperse biomedical knowledge to select the best candidate genes associated with a disease. The method uses a network representation of current biomedical knowledge that includes biomolecular concepts such as genes, diseases, pathways, and biological process. It also applies information extraction techniques to enrich the network with more dynamic and updated data. A biologically inspired algorithm is applied to this network in order to identify association levels between genes and diseases. The solution proposed here surpasses many limitations of previous methods such as the need for training data. The validation applied demonstrates that the proposed method has best overall results compared with state-of-the-art methods as it also performs especially well for the critical top-rank positions. We believe this method represents a major advance over previous work and that it will be a key tool for future gene–disease association studies.
From Words to Numbers: A Generalized and Linguistics-Based Coding Procedure for Collecting Textual Data

In this paper, I describe a new, powerful technique for coding data from textual sources, a technique based on concepts developed in thefield of linguistics, particularly on the concept of semantic text grammar. I develop a grammar of data collection from the simple linguistic canonical structure noun phraselverb phrase, namely, subjectlactionlobject and their modifiers. I show that the grammar allows researchers to collect richer and more flexible data than more traditional coding schemes. In particular, the grammar produces coded output that, to a large extent, preserves both the syntax and the lexicon of the source material. Furthermore, the grammar makes the process of data collection independent of any prior specification of hypotheses, because virtually all relevant information provided by the sources can be easily coded.