Miracle-dz/UniFAR-FTUs huggingface dataset:
Hydrogen bonding and coordination in normal and supercritical water from X-ray inelastic scattering

A direct measure of hydrogen bonding in water under conditions ranging from the normal state to the supercritical regime is derived from first-principles calculations for the Compton scattering of inelastically scattered x rays. First, we show that a measure of the number of electrons n(e) involved in hydrogen bonding at varying thermodynamic conditions can be directly obtained from Compton profile differences. Then, we use first-principles simulations to provide a connection between n(e) and the number of hydrogen bonds n(HB). Our study shows that over the broad range studied, the relationship between n(e) and n(HB) is linear, allowing for a direct measure of bonding and coordination in water by coupling simulations with experiments. In particular, the transition to supercritical state is characterized by a sharp increase in the number of water monomers but also displays a significant number of residual dimers and trimers.
Word sense disambiguation based on positional weighted context

Word sense disambiguation (WSD) is a key factor in solving natural language processing problems. The purpose of WSD is to make computers automatically determine the specific meaning of a word in a specific context. In this regard, state-of-art studies have focussed on the co-occurrences of words to measure context similarity. However, a problem with these approaches is that they consider all the words within a certain range to have equal influence on the ambiguous word. In this paper, we propose a position-based algorithm for measuring context similarity. By assigning positional weights to context words, we compared the context similarity between a new instance and pre-labelled instances to determine the appropriate sense of the ambiguous word. Experiments on the Senseval-2 English lexical sample task showed that our algorithm can achieve good precision and recall. Even in a minimally supervised state, it performs well with few training instances.
THE DYNAMICS OF UK INDUSTRIAL CONCENTRATION , 1993-1997

This paper empirically examines variations and changes in industry concentration and their determinants in the UK over the period 1993-1997 for a sample of 99 industries. The analysis indicates that average industrial concentration has increased during the 1990s, but is now lower than during the 1980s. Employing both static and dynamic panel data models to the sample, we find that industry-specific effects play a significant role in explaining both the level and change in concentration. Technological factors and mergers are found to have a positive effect on concentration.
Option Chain and Change Management: a Structural Equation Application

The aim of this work is to establish empirically with a structural equation model (SEM) the existence of links between the options perceived by the members of an industry, the expectation of future rents produced by the exercise of these options and firm or industry specific factors. The theoretical part of this work is based on the notion of option chain developed by Bowman and Hurry (1993). The empirical part is on the video-game industry. A questionnaire based dataset on 211 video-game creators allows us to represent the concepts of potential and real option from a strategic point of view. The study shows that the relations between perceived opportunities, capacities building and rent expectations are shared by the members of this industry and can be expressed as options.
The Importance of Individual Characteristics on Consideration Sets for Online Auction Buyers

In this research, we extend online auction theory by considering set theory in terms of a staged buying process. Success of online auction marketplaces depends on the efficacy of individual buyers searching for and finding desired items for bidding. Searches that lead to consideration sets with too many or too few options may result in a suboptimal choice. Results from this study suggest that certain personal characteristics may impact the number of auctions considered when filtering the awareness set to the consideration set. The findings suggest that design and management of online auction marketplaces should be refined to facilitate these individual traits such that individual search strategies are maximized.
Simplifying Heuristic Evaluation for Older Children

This paper aims to identify whether children can perform a heuristic evaluation based on a new modified method. In total 12 children placed in groups of 4 participated in the study, evaluating a music making game on a laptop. The results showed that children could perform a heuristic evaluation, identifying genuine usability problems using the simplified method. The effectiveness of the method was measured against ease of use for aspects such as mapping problem to game rules (heuristics), using the 'Bad Scale' (severity) and the number of observed errors reported. The children struggled to map all the problems to the game rules and had difficulty rating some problems to the new 'Bad Scale'. Further research will be performed to refine the process in an attempt to eliminate reported issues thus improving the method for children.
Relationally encoded links and the rhetoric of hypertext

More than two years’ work on designing, writing, editing, and linking documents in Context32 [Land86], the first course employing Intermedia developed at Brown University’s IRIS (Institute for Research in Information and Scholarship), has provided valuable experience of hypertext and hypermedia systems. Context32, which contains more than a thousand text and graphic files joined by approximately 1300 links, appears the most ambitious implementation thus far of a full hypertext and hypermedia system intended for multiple users. Members of the development team at IRIS have previously described various aspects of Intermedia’s object-oriented programming [Meyr86], general design EMeyr85, Yank87a, Yank87b1, and educational goals [Land871. This paper presents conclusions about what works best at each end of a hypertext path or linkway and proposes that, like other forms of discourse, hypertext requires systems of conjunctive and other relational devices.
Fuzzy Incremental Hierarchical Sliding Mode Control for Underactuated Systems

This paper designs a fuzzy incremental hierarchical sliding mode controller for a class of under actuated systems. By capturing the physical structure of the class, the hierarchical sliding surfaces with incremental structure are designed as follows. The first-layer sliding surface is firstly defined. Then, the first-layer sliding surface and one of the left states are employed to construct the second-layer sliding surface. The process continues till all the state variables are included. The control law is deduced from Lyapunov stability scheme. For decreasing the chattering phenomenon of the sliding mode, a fuzzy regulator is presented to regulate the controller gain. Simulation results illustrate the feasibility of the present method.
A System for Interactive Visual Analysis of Large Graphs Using Motifs in Graph Editing and Aggregation

Network analysis is an important task in a wide variety of application domains including analysis of social, financial, or transportation networks, to name a few. The appropriate visualization of graphs may reveal useful insight into relationships between network entities and subnetworks. However, often further algorithmic analysis of network structures is needed. In this paper, we propose a system for effective visual analysis of graphs which supports multiple analytic tasks. Our system enhances any graph layout algorithm by an analysis stage which detects predefined or arbitrarily specified subgraph structures (motifs). These motifs in turn are used to filter or aggregate the given network, which is particularly useful for search and analysis of interesting structures in large graphs. Our approach is fully interactive and can be iteratively refined, supporting analysis of graph structures at multiple levels of abstraction. Furthermore, our system supports the analysis of data- or user-driven graph dynamics by showing the implications of graph changes on the identified subgraph structures. The interactive facilities may be flexibly combined for gaining deep insight into the network structures for a wide range of analysis tasks. While we focus on directed, weighted graphs, the proposed tools can be easily extended to undirected and unweighted graphs. The usefulness of our approach is demonstrated by application on a phone call data set [18].
Visualising the actin cytoskeleton

The actin cytoskeleton is a dynamic filamentous network whose formation and remodeling underlies the fundamental processes of cell motility and shape determination. To serve these roles, different compartments of the actin cytoskeleton engage in forming specific coupling sites between neighbouring cells and with the underlying matrix, which themselves serve signal transducing functions. In this review, we focus on methods used to visualise the actin cytoskeleton and its dynamics, embracing the use of proteins tagged with conventional fluorophores and green fluorescent protein. Included also is a comparison of cooled CCD technology, confocal and 2‐photon fluorescence microscopy of living and fixed cells, as well as a critique of current procedures for electron microscopy. Microsc. Res. Tech. 47:3–17, 1999. © 1999 Wiley‐Liss, Inc.
A System Dynamics Model of the Pacific Coast Rockfish Fishery

-This paper presents a model of the dynamic behavior of the yellowtail rockfish of the Pacific Coast of the United States. The purpose of the model is to generate endogenously the historical data for fish population, fishing vessels, regulatory parameters, and fish harvest. The model was subjected to a variety of tests to determine its sensitivity to changes in key parameters and initial values, including extreme conditions. Model results indicate that acceptable biological catch and fleet capacity must be adjusted quickly in response to changing conditions, in order to improve fishery sustainability. Additional analysis reinforces the policy of setting the maximum sustainable yield at 40%.
Convertibility and Conversion Algorithm of Well-Structured Workflow Net to Process Tree

A workflow net is a Petri net for modeling and analyzing a workflow. A process tree has been proposed as a representational bias of a workflow net and enabled us to grasp the structure of actions routing such as sequence, choice and parallel in the workflow net. The advantage of process trees enables us to grasp the structure of action routing such as sequence, choice, and parallel in a given workflow net. Unfortunately, workflow nets are not always convertible to process trees. In this paper, we discuss the convertibility and conversion of workflow nets to process trees. We first proposed a necessary and sufficient condition on convertibility, i.e. a workflow net is convertible to a process tree iff it is acyclic, bridge-less, and well-structured. Next, based on the condition we constructed an algorithm to convert the workflow net to a process tree. Then we proposed an application of the conversion algorithm, which allows us to calculate the state number of the workflow net.
To Patent or Not to Patent: A Pilot Experiment on Incentives to Copyright in a Sequential Innovation Setting

This paper presents preliminary results from a pilot experiment dealing with the economic motivations to contribute to Free/Open Source Software (FOSS). In a seminal paper Bessen and Maskin (2006) argue that in a dynamic sequential innovation framework in which every innovation builds on previous inventions the standard argument for granting patent protection is no more valid and the innovator has at certain conditions an incentive to fully disclose the results of his works; in these same conditions, a copyright strategy could result in a tragedy of the anticommons (Heller 1998, Buchanan 2000). We study in the lab the choice of copyrighting or copylefting subsequent innovations in a dynamic setting a la Bessen and Maskin, introducing an innovative experimental design requiring real effort on the part of subjects. The players are asked to actually 'innovate' producing words from given letters, and face the choice to copyright or copyleft their words. Subsequent words can be created by modifying existing words, for free if a word is copylefted, and paying a fixed license fee if the word is copyrighted. Preliminary results show that copyleft is more likely to emerge when royalty fees are relatively high, and when the extendability, modularity and manipulability of inventions is enhanced. Moreover, copyleft innovations are sparsely started but once set in motion attract a higher number of contributors than copyrighted innovations, generating higher quality innovations and showing a more thorough exploration of possible profitable extensions. Finally, high royalty fees tend to generate anticommons effects, namely a lower rate of cooperation resulting in underuse of resources and lower innovative output.
Improved Algorithms for Compressed Sensing Based on the Multi-scale Wavelet Transform

The designing of sensing matrix has been our focus in the research of the Compressed Sensing (CS). In this paper, according to the properties of wavelet transform sub-bans, we improved the sensing matrix of the classical algorithms for compressed sensing based on the multi-scale wavelet transform. By using the weight matrix, the more information of the wavelet coefficients which is more important for the signal reconstruction can be reserved after measurement, and the PSNR of the improved algorithm was improved about 0.5~0.8dB.
A survey of algorithmic skeleton frameworks: high‐level structured parallel programming enablers

Structured parallel programs ought to be conceived as two separate and complementary entities: computation, which expresses the calculations in a procedural manner, and coordination, which abstracts the interaction and communication. By abstracting commonly used patterns of parallel computation, communication, and interaction, algorithmic skeletons enable programmers to code algorithms without specifying platform‐dependent primitives. This article presents a literature review on algorithmic skeleton frameworks (ASKF), parallel software development environments furnishing a collection of parameterizable algorithmic skeletons, where the control flow, nesting, resource monitoring, and portability of the resulting parallel program is dictated by the ASKF as opposed to the programmer. Consequently, the ASKF can be positioned as high‐level structured parallel programming enablers, as their systematic utilization permits the abstract description of programs and fosters portability by focusing on the description of the algorithmic structure rather than on its detailed implementation. Copyright © 2010 John Wiley & Sons, Ltd.
Dense Linear Algebra Pattern

The pivotal problem in computational linear algebra is how to balance data access costs with the cost of computation. Given the disparity between memory and CPU speeds, it is critical to maximize the amount of computation carried out for each item of data accessed from memory. For problems for which the systems of equations associated with a problem are dense (i.e. they contain mostly non-zero values), it is often possible to exploit a surface to volume effect providing plenty of computation to hide the costs of accessing data. How do we write software that can take advantage of this property in order to achieve high performance?
A New Method of Assessing the Structural Budget Balance: Results for the Years 1995-2000

A precise assessment of the impact of the cyclical conditions on the budget is very important to correctly assess the state of public finances. Instead of using only GDP as a reference, the authors compute the trends and the cyclical components for a limited number of macroeconomic variables whose impact on public finances is particularly large (e.g. private consumption, employees’ gross earnings, operating surplus, employment in the private sector). The cyclical adjusted balance is then computed adjusting the budget for the effects of those cyclical components. This is done on the basis of legal and administrative rules, taking into account their historical evolution.
Effect of Ethical Leadership and Leader-Member Exchange on Voice Behavior – Moderating Impact of Empowerment

The purpose of this paper is to examine the effect of ethical leadership and leader-member exchange on employee voice behavior and moderating effect of employee empowerment. Data collected from 718 full time working employees via questionnaires, incorporating ethical leadership, leader-member exchange, employee voice behavior and employee empowerment. Correlation and regression analysis was to examine the relationship, association and effect of the variables on each other. Results indicated a strong, positive and significant association between ethical leadership, leader-member exchange and employee empowerment and employee voice behavior. Further regression results specify that ethical leadership, leader-member exchange and employee empowerment effect employee voice behavior positively and significantly. Results point out that interactive effect of employee empowerment is there in between leader-member exchange and employee voice behavior. Current study provides a new aspect to focus for the organizations that is importance of ethical leadership to enhance employee voice behavior through leader-member exchange and employee empowerment. Organization needs to acknowledge the significance of ethical leadership behavior to training and enhancing ethical behavior of leader in order to maximize employee voice behavior for organization efficiency. Keywords: Ethical leadership;leader-member exchange; Employee voice behavior; Employee empowerment; DOI : 10.7176/EJBM/11-9-15 Publication date :March 31 st 2019
Netbed: an integrated experimental environment

The diverse requirements of network and distributed systems research are not well met by any single experimental environment. Competing approaches remain popular because each offers different levels of ease of use , control, andrealism. These include packet-level discrete event simulation, live network experimentation, and emulation, which subjects real hardware, protocols, and workloads to a synthetic network environment. Netbed offers a new alternative. It is software that, when deployed on local and wide-area machines, provides a platform for research, education, or development in distributed systems and networks. Netbed’s primary contribution is the seamless integrationof the above disparate techniques into a common architectural framework that preserves the control and ease of use of simulation, without sacrificing the realism of emulation and live network experimentation. This framework provides common abstractions, namespaces, services, and user interfaces to all three environments. Netbed’s integration allows tools such as topology and traffic generators that were originally targeted for one domain to apply to all. Netbed leverages and extends its ancestor, Emulab, which focused on making emulationas easy to use and control as simulation. Our results show that Emulab speeds up experiment configuration on a cluster by two orders of magnitude, and through timeand space-sharing, improves cluster utilization by another two orders of magnitude. Architecture: Netbed revolves around interacting state machines, monitored by a state management daemon. The central state machine is the “experiment. ” Subsidiary state machines include those handling node allocation, configuration, and disk reloading. This approach copes well with the reliability challenges of large-scale distributed systems, composed of often unstable commodity hardware. The state daemon catches illegal or tardy state transitions. For example, if a node hangs while rebooting, the state daemon times out and attempts an alternate reboot mechanism. An experiment is generated from a user’s n script or via a GUI, resulting in hard state in Netbed’s relational database. It represents a network configuration, such as switch VLAN mappings or IP tunnels, and node configurations, including OS images. A node’s local disk is currently considered soft state; this allows an experiment to be “swapped out” and later regenerated from the database onto other hardware. The database provides a single namespace and abstractions for heterogeneous resources. The resulting resourcetransparency enables simulated, emulated, live,
An efficient power reduction technique for low power data I/O for military applications

In many digital processors which are mostly used in avionics, power dissipation in the processor plays a major role. Several encoding techniques have been proposed to reduce the power dissipation. In digital circuits most of the power is dissipated as dynamic power for charging and discharging of node capacitance. A majority of power reduction methods attempt to reduce the number of effective bus transitions. But, de facto in Deep Submicron (DSM) technology the distance between the two adjacent wires is very small and the effect of inter-wire (coupling) capacitances will dominate substrate (base) capacitances. So, in the presence of coupling effects, the previous techniques of power reduction in digital processors which are mainly based on self transitions may not achieve the goal. This paper proposes a new data bus encoding scheme, in which coupling transitions of bus lines along with self transitions are considered. Simulation results show that proposed encoding scheme reduces effective transitions related to power dissipation (considering the power due to Codec), by as much as 18% for 8, 16, 32-bit bus, indicating that the proposed coding scheme is suitable for low power design.
W Analyzing the Impact of Standard Encryption Approaches for Data Aggregation in a Wireless Sensor Network

Wireless Sensor Network (WSN) is a variant of Mobile Adhoc Network (MANET) that exhibits strict energy constraints. Recent advances in WSN have lead to promising applications viz. habitat monitoring and target tracking. These applications are based on monitoring and analysis of data received by various sensor nodes. However, data communication between nodes consumes a major portion of the total energy consumption of the WSN. Consequently, data aggregation techniques can efficiently reduce the energy consumption by eliminating redundant data traveling back to the base station. This paper aims to identify an efficient data aggregation protocol and after survey of different data aggregation approaches, LEACH has been selected as a data aggregation protocol which is a cluster based approach. The security issues such as data integrity, confidentiality, and freshness in this data aggregation become crucial when the WSN is deployed in a remote or hostile environment where sensors are prone to node failures and compromises. After comparisons of three methods of encryption like AES, DES and RSA, AES algorithm has been selected which follows the symmetric approach. Here, comparisons are based on the parameters like Execution time, Throughput and Energy consumed.