Miracle-dz/UniFAR-FTUs huggingface dataset:
Ranking Developer Candidates by Social Links

In open source software (OSS) projects, participants initially communicate with others and then may become developers if they are deemed worthy by the community. Recent studies indicate that the abundance of established social links of a participant is the strongest predictor to his/her promotion. Having reliable rankings of the candidates is key to recruiting and maintaining a successful operation of an OSS project. This paper adopts degree-based, PageRank, and Hits ranking algorithms to rank developer candidates in OSS projects based on their social links. We construct several types of social networks based on the communications between the participants in Apache OSS projects, then train and test the ranking algorithms in these networks. We find that, for all the ranking algorithms under study, the rankings of emergent developers in temporal networks are higher than those in cumulative ones, indicating that the more recent communications of a developer in a project are more important to predict his/her first commit in the project. By comparison, the simple degree-based and the PageRank ranking algorithms in temporal undirected weighted networks behave better than the others in identifying emergent developers based on four performance indicators, and are thus recommended to be applied in the future.
Subspace Clustering for all Seasons

Subspace clustering is recognized as a more general and difficult task than standard clustering since it requires to identify not only objects sharing similar feature values but also the various subspaces where these similarities appear. Many approaches have been investigated for subspace clustering in the literature using various clustering paradigms. In this paper, we present Chameleoclust, an evolutionary subspace clustering algorithm that incorporates a genome having an evolvable structure. The genome is a coarse grained genome defined as a list of tuples (the "genes"), each tuple containing numbers. These tuples are mapped at the phenotype level to denote core point locations in different dimensions, which are then used to collectively build the subspace clusters, by grouping the data around the core points. The algorithm has been assessed using a reference framework for subspace clustering evaluation, and compared to state-of-the-art algorithms on both real and synthetic datasets. The results obtained with the Chameleoclust algorithm show that evolution of evolution, through an evolvable genome structure, is usefull to solve a difficult problem such as subspace clustering.
Layout-tree-based approach for identifying visually similar blocks in a web page

When extracting information from a web page, IE systems usually need to perform pattern recognition to identify the elements that have similar patterns. However, most of them are mainly based on analyzing HMTL source code, DOM tree, tag tree or Xpath of web pages. These methods are language-dependent, or more precisely, HTML-dependent. They have some insuperable limitations. In order to overcome these limitations, we propose a notion of layout-tree and a pattern recognition method to identify visual blocks with similar visual pattern using layout tree. In this paper, we call a visible rectangular region in a web page a visual block or block for short. We consider if the elements of two blocks are displayed in a similar layout, we define that the two blocks are visually similar. We first transform the layout into a layout tree. By calculating the similarity of the layout trees of two blocks, we can determine whether the two blocks are visually similar or not. The result of experiment shows that the layout tree is an effective method to identify visually similar blocks.
Monetary and Fiscal Policy in a Liquidity Trap with In ation Persistence

This paper relies on the new Keynesian model with ination persistence to characterize the optimal monetary and scal policy in a liquidity trap. It shows that, with a Phillips curve that is both forward and backward looking, the monetary policy that is implemented during a liquidity trap episode can lift the economy out of depression. The central bank does not need to commit beyond the end of the crisis to get some traction on the level of economic activity. Regarding scal policy, ination persistence justi es some front-loading of government expenditures to get ination started, which reduces the real interest rate. The magnitude of the optimal scal stimulus is decreasing in the degree of ination persistence. Finally, if ination persistence is due to adaptive expectations, rather than to price indexation, then monetary policy is ine¤ective while the optimal scal stimulus is large and heavily front-loaded. Keywords: Commitment, Ination persistence, Liquidity trap, Monetary and scal policy JEL Classi cation: E12, E52, E62, E63
Careers and Wage Growth within Large Firms

The relationship between the worker’s career path and wage growth is studied using a longitudinal sample of large firms. The econometric analysis shows that promoted workers receive a positive wage premium even if they stay in the same job level. Demotions are associated with negative wage premiums. The wage-career dynamics generates a U-shape to the wage premiums for promotions over the hierarchical ladder. In the context of the model discussed, this shape suggests a stronger learning and/or human capital accumulation effect at the bottom of the hierarchy and a stronger job assignment effect at the top.
Electromagnetic energy in a dispersive metamaterial

An expression for the electromagnetic field energy density in a dispersive lossy left-handed metamaterial, consisting of an array of split-ring resonators and an array of wires, is derived. An electromagnetic field with general time dependence is considered. The outcome is compared with previously published results. In the absence of losses, agreement with the general result for the energy density in a dispersive material is obtained. The formulae are verified using the finite-difference time-domain numerical method. The applicability of two commonly used permeability models to the problem of calculating the energy stored in an array of split-ring resonators is discussed.
Singapore Inc. versus the Private Sector: Are Government-Linked Companies Different?

Government-linked companies (GLCs) have a significant presence in Singapore's corporate sector. Unlike parastatals in many other countries, these companies are run on a competitive, commercial basis, ostensibly without government privileges. Based on data from publicly listed GLCs and non-GLCs, we indeed find no evidence that GLCs have easier access to credit. However, we do find that being a GLC is rewarded in financial markets with a positive premium, over and above what can be explained by the usual determinants of Tobin's q.
Effectiveness of spatial level of detail degradation in the periphery of head-mounted displays

Many researchers have proposed degradation of peripheral visual detail as a technique that can both improve frame rates in virtual environments systems, and minimize perceptual impact. A user study was performed to evaluate the effectiveness of this technique when used with head-mounted displays. Primary dependent measures were search time on correctly performed trials and percentage of all trials performed incorrectly. Results showed that a substantial amount of peripheral detail can be eliminated before user performance is impacted, The performance impact of peripheral detail degradation will vary greatly with task difficulty, although it should be useful even in the most taxing environments.
Shake – Regicide: A New Heuristic for the Diversity Control of Evolutionary Algorithms

Evolutionary algorithms have been very successful at solving global optimization problems. Two competing goals govern the performance of evolutionary algorithms: exploration and exploitation. This paper proposes a new heuristic to keep population diversity: the shake and the regicide. The shake heuristic improves the exploration by perturbing the whole population. The regicide heuristic (kill the leader) reduces the risk of being, early, trapped by a local minimum. Experiments demonstrate that the Shake-Regicide heuristic improves significantly the precision of the results (in about 3 orders of magnitude) of standard differential evolution, genetic algorithm and evolution strategy.
Glial Membranes at the Node of Ranvier Prevent Neurite Outgrowth

Nodes of Ranvier are regularly placed, nonmyelinated axon segments along myelinated nerves. Here we show that nodal membranes isolated from the central nervous system (CNS) of mammals restricted neurite outgrowth of cultured neurons. Proteomic analysis of these membranes revealed several inhibitors of neurite outgrowth, including the oligodendrocyte myelin glycoprotein (OMgp). In rat spinal cord, OMgp was not localized to compact myelin, as previously thought, but to oligodendroglia-like cells, whose processes converge to form a ring that completely encircles the nodes. In OMgp-null mice, CNS nodes were abnormally wide and collateral sprouting was observed. Nodal ensheathment in the CNS may stabilize the node and prevent axonal sprouting.
Automatic Inference of Specifications in the K Framework

Despite its many unquestionable benefits, formal specifications are not widely used in industrial software development. In order to reduce the time and effort required to write formal specifications, in this paper we propose a technique for automatically discovering specifications from real code. The proposed methodology relies on the symbolic execution capabilities recently provided by the K framework that we exploit to automatically infer formal specifications from programs that are written in a non-trivial fragment of C, called KernelC. Roughly speaking, our symbolic analysis of KernelC programs explains the execution of a (modifier) function by using other (observer) routines in the program. We implemented our technique in the automated tool Kindspec 2.0, which generates axioms that describe the precise input/output behavior of C routines that handle pointer-based structures (i.e., result values and state change). We describe the implementation of our system and discuss the differences w.r. t. our previous work on inferring specifications from C code.
AggregateRank: bringing order to web sites

Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web search and crawling. In order to get the ranks of websites, researchers used to describe the inter-connectivity among websites with a so-called HostGraph in which the nodes denote websites and the edges denote linkages between websites (if and only if there are hyperlinks from the pages in one website to the pages in the other, there will be an edge between these two websites), and then adopted the random walk model in the HostGraph. However, as pointed in this paper, the random walk over such a HostGraph is not reasonable because it is not in accordance with the browsing behavior of web surfers. Therefore, the derivate rank cannot represent the true probability of visiting the corresponding website.In this work, we mathematically proved that the probability of visiting a website by the random web surfer should be equal to the sum of the PageRank values of the pages inside that website. Nevertheless, since the number of web pages is much larger than that of websites, it is not feasible to base the calculation of the ranks of websites on the calculation of PageRank. To tackle this problem, we proposed a novel method named AggregateRank rooted in the theory of stochastic complement, which cannot only approximate the sum of PageRank accurately, but also have a lower computational complexity than PageRank. Both theoretical analysis and experimental evaluation show that AggregateRank is a better method for ranking websites than previous methods.
Active-mesh self-initialisation

This paper describes a method of initialising an Active-Mesh that is to be automatically created and configured directly from a single frame of an im- age sequence. The aim of this approach is to use the derived mesh to perform visual tracking in unconstrained motion environments, allowing movement of the camera, the scene and even the inclusion of background-independent moving ob- jects. The problem in initialising this mesh comes from the fact that there is no a priori information about the scene available. The paper will discuss met hods that are currently available for determining the initial position of active contour models within images, then suggesting a method of initialising an active mesh.
Detecting Text Line in Handwritten Documents

Although detecting text lines in machine printed documents is typically considered as a solved problem, it is still a challenge to segment handwritten text lines in the general sense given no prior knowledge of scrip. This paper models text line detection as an image segmentation problem by enhancing text line structure using a Gaussian window, and adopting the level set method to evolve text line boundaries. Experiments show that the method, which is script independent, achieves high accuracy for detecting text lines in both handwritten and machine printed documents.
Signal Sequence Processing in Rough Microsomes (*)

Secretory proteins are synthesized with a signal sequence that is usually cleaved from the nascent protein during the translocation of the polypeptide chain into the lumen of the endoplasmic reticulum. To determine the fate of a cleaved signal sequence, we used a synchronized in vitro translocation system. We found that the cleaved signal peptide of preprolactin is further processed close to its COOH terminus. The resulting fragment accumulated in the microsomal fraction and with time was released into the cytosol. Signal sequence cleavage and processing could be reproduced with reconstituted vesicles containing Sec61, signal recognition particle receptor, and signal peptidase complex.
ABSTRACT Title of thesis: TYROSINE-BASED “ACTIVATABLE PRO-TAG”: ENZYME- CATALYZED PROTEIN CAPTURE AND RELEASE

Title of thesis: TYROSINE-BASED “ACTIVATABLE PRO-TAG”: ENZYMECATALYZED PROTEIN CAPTURE AND RELEASE Angela T. Lewandowski, Master of Science, 2004 Thesis directed by: Professor William E. Bentley Department of Chemical Engineering Fusion tags are widely used in the recovery and purification of recombinant proteins. We have investigated the capture and release of two fusion proteins from cell extracts using the aminopolysaccharide chitosan. We have fused to green fluorescent protein (GFP) and to S-ribosylhomocysteinase (LuxS) a “pro-tag” consisting of five tyrosine residues that are “activated” by tyrosinase-catalyzed conversion into reactive oquinones. The o-quinones react with the amino groups of chitosan, resulting in the covalent conjugation of the fusion protein to chitosan. The fusion protein is captured from solution by precipitation of the protein-chitosan conjugate due to the decrease in solubility of chitosan at higher pH. Additionally, chitosan is used to “pre-precipitate” cell extract contaminants such as nucleic acids and phospholipids, and thus, crudely purify the fusion protein remaining in solution. Finally, we released the fusion protein from chitosan back into solution using the chitosan-hydrolyzing enzyme chitosanase as an alternative to protease cleavage. TYROSINE-BASED “ACTIVATABLE PRO-TAG”: ENZYME-CATALYZED PROTEIN CAPTURE AND RELEASE
A Latency-Aware Partitioning Method for Distributed Virtual Environment Systems

Distributed virtual environment (DVE) systems allow multiple users working on different client computer's interconnected through different networks to interact in a shared virtual world. In these systems, latency is crucial for providing an acceptable quality of service (QoS), since it determines how fast client computers are reported about changes in the shared virtual scene produced by other client computers. This paper presents in a unified manner a partitioning approach for providing a latency below a threshold to the maximum number of users as possible in DVE systems. This partitioning approach searches the assignment of avatars, which represents the best trade-off among system latency, system throughput, and partitioning efficiency when solving the partitioning problem. Evaluation results show that the proposed approach not only maximizes system throughput, but also allows the system to satisfy, if possible, any specific latency requirement needed for providing QoS. This improvement is achieved without decreasing either image resolution or quality of animation, and it can be used together with other techniques already proposed. Therefore, it can contribute to provide QoS in DVEs.
The Physiologic Nature of Sleep

What should you think more? Time to get this [PDF? It is easy then. You can only sit and stay in your place to get this book. Why? It is on-line book store that provide so many collections of the referred books. So, just with internet connection, you can enjoy downloading this book and numbers of books that are searched for now. By visiting the link page download that we have provided, the book that you refer so much can be found. Just save the requested book downloaded and then you can enjoy the book to read every time and place you want.
Time Shift Grouping Access in IEEE 802.15.4 MAC Beacon Mode for Layered-Tree Networks

The IEEE 802.15. 4/ZigBee attracts much attention as an energy-efficient and flexible low-rate wireless protocol for ubiquitous networks. This paper proposes a new active period assignment method called Time Shift Grouping Access (TSGA) in IEEE 802.15. 4/ZigBee beacon mode for cluster-tree networks. By dividing top-level routers into two groups and using different time slots for accessing PAN coordinator, throughput bottleneck in Contention Access Period (CAP) is reduced. Beacon frame collision between subnets is also avoided by introducing different long spreading codes. Thus, low power intermittent operation with beacon is possible in each subnetwork. Simulation results show that the proposed method presents a better network throughput and reduces energy consumption by 1/2 to 1/3.
Producing Unseen Morphological Variants in Statistical Machine Translation

Translating into morphologically rich languages is difficult. Although the coverage of lemmas may be reasonable, many morphological variants cannot be learned from the training data. We present a statistical translation system that is able to produce these inflected word forms. Different from most previous work, we do not separate morphological prediction from lexical choice into two consecutive steps. Our approach is novel in that it is integrated in decoding and takes advantage of context information from both the source language and the target language sides.
Human Computer Interaction Model based Virtual Whiteboard: A Review

Interactive whiteboard involving human interaction have been an active field of research in past years in human computer interaction (HCI). There is a need for adoption of natural interfaces between user and computing devices. This is trending in educational as well as corporate sector where various interactive application, tools and methodologies are used to make the presentation, summarization of difficult concepts easy and also to simulate collaborative work and enhance teaching practices. For Instance, it is a common practice to draw business processes on a traditional whiteboard, using conventional modeling notation such as UML, BPMN, during meetings between software programmers and business clients. Since it is a traditional whiteboard, software developer may need to redesign the process diagram on his computer by referring the whiteboard, this can be time consuming. Alternative way will be to use pen-based input device such as an electronic interactive whiteboard or graphics tablet. Use and working of interactive whiteboard have received researchers’ attention as it has been found to be easy and highly effective interaction method. This paper presents a short review for interactive whiteboard technology and its operations proposed in the literature. Some examples of applications are also investigated.
Ja n 20 06 Ensemble based convergence assessment of biomolecular trajectories

Assessing the convergence of a biomolecular simulation is an essential part of any computational investigation. This is because many important quantities (e.g., free energy differences) depend on the relative populations of different conformers; insufficient convergence translates into systematic errors. Here we present a simple method to selfconsistently assess the convergence of a simulation. Standard clustering methods first generate a set of reference structures to any desired precision. The trajectory is then classified by proximity to the reference structures, yielding a one-dimensional histogram of structurally distinct populations. Comparing ensembles of different trajectories (or different parts of the same trajectory) built with the same reference structures provides a sensitive, quantitative measure of convergence. Please note: this is a preliminary manuscript, and should be read as such. Comments are most welcome, especially regarding pertinent prior work.
Diverse Mn(II)-Oxidizing Bacteria Isolated from Submarine Basalts at Loihi Seamount

Abstract Metal-oxidizing bacteria may play a key role in the submarine weathering of volcanic rocks and the formation of ferromanganese crusts. Putative fossil microbes encrusted in Mn oxide phases are commonly observed on volcanic glasses recovered from the deep ocean; however, no known Mn(II)-oxidizing bacteria have been directly identified or cultured from natural weathered basalts. To isolate epilithic Mn(II) oxidizing bacteria, we collected young, oxidized pillow basalts from the cold, outer portions of Loihi Seamount, and from nearby exposures of pillow basalts at South Point and Kealakekua Bay, HI. SEM imaging, EDS spectra and X-ray absorption spectroscopy data show that microbial biofilms and associated Mn oxides were abundant on the basalt surfaces. Using a series of seawater-based media that range from highly oligotrophic to organic-rich, we have obtained 26 mesophilic, heterotrophic Mn(II)-oxidizing isolates dominated by α- and γ-Proteobacteria, such as Sulfitobacter, Methylarcula and Pseudoalteromonas spp. Additional isolates include Microbulbifer, Alteromonas, Marinobacter, and Halomonas spp. None of the isolates, nor their closest relatives, were previously recognized as Mn(II) oxidizing bacteria. The physiological function of Mn(II) oxidation is clearly spread amongst many phylogenetically diverse organisms colonizing basalt surfaces. Our findings support a biological catalysis of Mn(II) oxidation during basalt-weathering, and suggest heterotrophic Mn(II) oxidizing bacteria may be ubiquitously associated with submarine glasses within epilithic and endolithic biofilms.
Detecting Concurrently Executed Paris of Statements Using Adapted MHP Algorithm ∗

Information about which pairs of statements in a concurrent program can be executed concurrently is important for improving the accuracy of dataflow analysis, optimizing programs, and detecting errors. This paper presents a new method named Concurrent Control Flow Graph for representing concurrent Ada programs in a simple and precise way. Based on this method, we develop an Adapted MHP (May Happen in Parallel) algorithm that can statically detect all pairs of statements that may be executed concurrently. This algorithm checks not only whether a rendezvous can be triggered, but also whether it can be finished. Although this algorithm generates a conservative superset of the perfect pairs of statements, it is more precise than many existing methods.