Miracle-dz/UniFAR-FTUs huggingface dataset:
Querying the standard and Semantic Web using Xcerpt and visXcerpt

Query and transformation languages such as XPath, XQuery and XSLT have evolved to standard development tools for Web applications. Arguably those languages are not fully suited for Semantic Web applications. The query and transformation languages Xcerpt and visXcerpt have been conceived with both standard Web and Semantic Web applications in mind. They are twin languages both based on the same paradigms and principles. Xcerpt realizes these paradigms and principles textually, visXcerpt visually. A mixed standard Web and Semantic Web application scenario implemented in Xcerpt and visXcerpt is presented. Xcerpt and visXcerpt are ongoing research projects; prototypic implementations of the languages are available.
Using a pattern system to increase project complexity in groupware courses

COCHI is a flexible and easy to use software pattern system that supports the development of groupware applications. This paper describes COCHI and the experiences using this pattern system to enhance project complexity in undergraduate and graduate groupware courses in three Mexican universities. © 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 19: 280–285, 2011
A Novel Similarity Measure for frequent Term Based Text Clustering on high dimensional data

Text clustering is one of the main themes in text mining . It refers to the process of grouping document with similar contents or topics into clusters to improve both availability & reliability of the mining, In this research, a frequent item set is a set of words which occur together frequently and are good canDi Dates for clusters. By considering only the items which occur frequently in the Data, we can also address problems like outlier removal, Dimensionality reduction, etc. The main idea is to apply any existing frequent item finding algorithm such as a priori or Dp-tree to the initial set of text files to reduce the Dimension of the input text files. A Document Feature vector is formed for all the Documents. Then a vector is formed for all the static text input files. The algorithm outputs a set of clusters from the initial input of text files considered.
Requirements Elicitation Problems: A Literature Analysis

Requirements elicitation is the process through which analysts determine the software requirements of stakeholders. Requirements elicitation is seldom well done, and an inaccurate or incomplete understanding of user requirements has led to the downfall of many software projects. This paper proposes a classification of problem types that occur in requirements elicitation. The classification has been derived from a literature analysis. Papers reporting on techniques for improving requirements elicitation practice were examined for the problem the technique was designed to address. In each classification the most recent or prominent techniques for ameliorating the problems are presented. The classification allows the requirements engineer to be sensitive to problems as they arise and the educator to structure delivery of requirements elicitation training.
Web-based Social Collaborative Authoring Technology

This paper describes collaborative social authoring technology using web-based distributed user interface (DUI). In view of collaboration, web is one of the most common user environments on various systems of desktop and mobile devices. This paper addresses the DUI issues for the support of multiple kind of devices, such as PC, smartphone, tablet and so on. In our system, we define CAM (Collaborative Authoring Metadata). CAM is used for the exchange of authoring intention of each user during the collaborative authoring. We define elements of CAM that is useful for exchanging information among distributed users. Our system also provides the recommendation function for referring and adding the related media from the participants’ social media service account during the authoring process.
Link Layer Time-Varying Model for IEEE 802.15.4 Radio in Industrial Environment

IEEE 802.15. 4 PHY has been widely used in wireless sensor networks. In-depth investigations on the link layer characteristics are important for WSN protocol design. In industrial environments, link reliability is vulnerable to various interferences; therefore, many schemes have been employed for reliability improvements such as multichannel access, frequency hopping, and multipath routing, which put forward the demand on link reliability models. Previous researches mainly focus on distance fading and irregularity of link reliability; however, little work analyses the temporal and frequency variations of the link reliability. The paper proposed a link layer statistical model (LTM) for time-varying of 16 channels based on packet drop rate (PDR) data collected from typical industrial environments. LTM descript packet drop intervals, PDR variation over times, PDR variation between different channels, link level switching probability and interference distribution. And also, a discussion of the influence of IEEE 802.15. 4e MACprotocol simulation showed that LTM is closer to the realistic result.This paper provides a newmethod tomodel link reliability in industrial environment and is useful to the design of frequency diversity and upper layer protocols.
Excitation of frog sciatic nerve using pulsed magnetic fields effect of waveform variations

We examined the relative effectiveness of overdamped and of (truncated) underdamped magnetic field pulses in exciting frog sciatic nerve. Waveforms were compared by finding the stimulus magnitude (Vh) corresponding to half-maximal tension developed in gastroenemius muscle. Vh varied inversely with T/sub 0/ the time to peak of the magnetic field.
Improving IV&V Techniques Through the Analysis of Project Anomalies: Text Mining PITS issue reports - preliminary report

This project is in two parts. The second part will try to combine two (or more) of the IVV i.e. - SILAP, from the IVV - James Dabney's Bayes networks that describe the IVV - The PITS issue tracking data; - The LINKER database project that intends to join PITS to other data sources; - Balanced score card strategy maps from NASA Langley. - and the COCOMO data sets from JPL.
The effects of display context on the effectiveness of visual onsets for attention capture

Breakdowns in human-automation communication have been observed in many complex domains for a variety of reasons. For example, numerous studies have shown that pilots on highly automated aircraft sometimes miss unexpected changes in autoflight modes. These changes are signaled by the onset of a green box drawn around the new mode name on the primary flight display. The purpose of the appearance of the green box is to capture pilots' attention in case of a mode transition. However, the above difficulties suggest that this design choice may not be effective in the context of data-rich multiple-dynamic display contexts. The goal of the current experiment was to examine systematically the effectiveness of visual onsets for capturing attention when these onsets are immersed in several different display backgrounds that vary with respect to color and dynamics. Detection performance for embedded targets was worst in the so-called color-dynamic condition, which resembled many real-world displays. The other display conditions suggest that dynamics affect performance more strongly than color similarity between target and background. The results of this study illustrate the need for prudent adaptation and application of findings from laboratory research on attention capture to the design of interfaces for complex systems and environments.
Imaging the body with diffuse optical tomography

Diffuse optical tomography (DOT) is an ongoing medical imaging modality in which tissue is illuminated by near-infrared light from an array of sources, the multiply-scattered light which emerges is observed with an array of detectors, and then a model of the propagation physics is used to infer the localized optical properties of the illuminated tissue. The three primary absorbers at these wavelengths, water and both oxygenated and deoxygenated hemoglobin, all have relatively weak absorption. This fortuitous fact provides a spectral window through which we can attempt to localize absorption (primarily by the two forms of hemoglobin) and scattering in the tissue. The most important current applications of DOT are detecting tumors in the breast and imaging the brain. We introduce the basic idea of DOT and review the history of optical methods in medicine as relevant to the development of DOT. We then detail the concept of DOT, including a review of the tissue's optical properties, modes of operation for DOT, and the challenges which the development of DOT must overcome. The basics of modelling the DOT forward problem and some critical issues among the numerous implementations that have been investigated for the DOT inverse problem, with an emphasis on signal processing. We summarize with some specific results as examples of the current state of DOT research.
A Reduced-Swing Voltage-Mode Driver for Low-Power Multi-Gb/s Transmitters

At a lower supply voltage, voltage-mode drivers draw less current than current-mode drivers. In this paper, we newly propose a voltage-mode driver with an additional current path that reduces the output voltage swing without the need for complicated additional circuitry, compared to conventional voltage-mode drivers. The prototype driver is fabriccated in a 0.13-㎛ CMOS technology and used to transmit data streams at the rate of 2.5 Gb/s. Deemphasis is also implemented for the compensation of channel attenuation. With a 1.2-V supply, it dissipates 8.0 ㎃ for a 400-㎷ output voltage swing.
Architecture of Wireless Sensor Networks with Mobile Sinks: Multiple Access Case

We propose to develop Wireless Sensor Networks with Mobile Sinks (MSSN), under high sensor node density, where multiple sensor nodes need to share one single communication channel in the node-to-sink transmission. By exploiting the tradeoff between the successful information retrieval probability and the nodes energy consumption, a number of multiple nodes transmission scheduling algorithms are proposed. Both optimal and suboptimal algorithms, which exhibit exponential and linear complexity respectively, are discussed under the desired application. Computer simulations show that suboptimal algorithms perform nearly as good as the optimal one. The study leads to the cross-layer Wireless Link layer design for MSSN.
Design, selection and implementation of a content-addressable memory for a VLSI CMOS chip architecture

The paper reports an investigation into the design constraints, trade-offs and implementation issues involved in the design of a large content-addressable memory (CAM) for a VLSI CMOS high-speed associative chip architecture: the single chip array processing element SCAPE associative parallel processor. It includes results from a study into determining the general electrical and physical characteristics of a range of CAM cells; details from a case study of the SCAPE chip that predicts the performance of CAMs within a VLSI-based parallel processing computer system, together with the overall impact the CAM design has on the SCAPE chip performance; the selection and implementation engineering of the most cost-effective CAM design for the SCAPE chip.
A kernel based structure matching for web services search

This paper describes a kernel based Web Services (abbrevi-ated as service) matching mechanism for service discoveryand integration. The matching mechanism tries to exploitthe latent semantics by the structure of services. Using textual similarity and n-spectrum kernel values as features of low-level and mid-level, we build up a model to estimate thefunctional similarity between services, whose parameters arelearned by a Ranking-SVM. The experiment results showedthat several metrics for the retrieval of services have beenimproved by our approach.
AN EFFICIENT METHOD BASED ON ABC FOR OPTIMAL MULTILEVEL THRESHOLDING

Many efficient bi-level thresholding techniques have been proposed in recent years. Usually, the objective functions, which are used by them, are not appropriate for the multilevel thresholding owing to exponential growth of computational complexity. This work presents a new multilevel thresholding algorithm using Artificial Bee Colony algorithm (ABC) with the Otsu's objective function. Also, a strategy is used to guess suitable thresholds for initializing the proposed method. This initializing phase used the bi-level Otsu method to find the initial thresholds. These guessed thresholds are used to create a food source around each of them for use in the ABC algorithm as initial population. The presented thresholding method is tested on four popular images. The results show that this method has competitive performance compared to other well- known methods such as Gaussian-smoothing, Symmetry-duality, GA-based and PSO-based algorithms.
Identification of Microblog Opinion Leader Based on User Feature and Interaction Network

Opinion leaders are core users in online communities, who can guide the direction of the public opinion. With the rapid development of microblog, identification of the microblog opinion leaders has become a significant task. In this paper, we propose a hybrid data mining approach based on user feature and interaction network, which includes three parts: a way to analyze users' authority, activity and influence, a way to consider the orientation of sentiment in interaction network and a combined method based on HITS algorithm for identifying micro blog opinion leaders. Comparative results show that this mechanism can provide an effective mining of the user feature and a better rate of recognition.
Research on routing model for MANET based on quantum search algorithm

Ad Hoc networks is recently a hot spot in wireless network researching domain. The design of routing algorithm, which is as the core layer technology in Ad Hoc networks, has drawn great concern. In response to the drawbacks of traditional routing protocols such as bad convergence and providing no QoS guarantee, this paper gives the way to construct node vector function to represent QoS indices in networks. And then combining the idea of Grover quantum searching and DSR protocol, it puts forward a MANET routing model based on Quantum search algorithm. In the process of routing, this algorithm gets node probability vector by Grover computation on node vector function in networks. Results of simulation show that comparing with DSR protocol, routing algorithm based on Quantum search algorithm can converge quickly and provide QoS guarantee, which fills up the deficiency of the exiting algorithm.
Developing single source documentation

Writers often have to create documents for different audiences and for different media (e.g. paper, online, help, training). However, timelines and budgets for developing documentation are often tight. That means we have to find more efficient ways to develop documentation. One way is to consider single sourcing information for multiple users and media. While single sourcing takes more up-front planning, it can significantly decrease costs and development times once implemented.
Algorithm 450: Rosenbrock Function Minimization

This paper outlines a program that searches for the predominant terms of the asymptotic error expansion of initial value problems in ordinary differential equations and uses this information in a self-modifying extrapolation process. During the integration process, using a ratio that Carl de Boor (1971) used in an integration program, the method seeks to recognize trends of change in the error expansion of the differential equation and to adjust the method of extrapolation. A basic algorithm used in the modifying process is presented along with a brief explanation. Also, a comparison made with the well-known rational extrapolation method shows rational extrapolation to be generally less efficient in terms of function evaluations but also demonstrates that the self-modifying method is generally not able to reduce its error to the level of rational extrapolation. A note, though, shows the self-modifying method to be superior to the regular Romberg extrapolation. A program to solve any jigsaw puzzle involving pieces of polygonal shape is described. An efficient solution has been found to depend on a number of ad hoc strategies, which are described in detail in the paper. The puzzles are solved by successively placing individual pieces in the region to be covered using a depth-first tree search algorithm. A formal representation of regions, pieces, and placings of pieces is defined. The main idea behind the chosen representation is to orient clockwise the polygons making up a region, and to orient counterclockwise the pieces to be placed. Placing a piece means computing a valid new region, i.e. one or more clockwise oriented polygons, constructed from the previous one by removing the part corresponding to the piece which is placed. The data structure and the procedures required to examine where pieces can be placed and how to perform the placing of the pieces are also described. All puzzles so far presented to the program have been successfully solved in a reasonable time. Submittal of an algorithm for consideration for publication in Communications of the ACM implies unrestricted use of the algorithm within a computer is permissible. General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. Description Purpose. This subroutine finds the …
A Trusted Model for Secure Cloud Environment

Cloud computing is an emerging technology that gives a tremendous changes in IT industry. It has ultimate features like multitenancy, elasticity, pay-per-use, self provision etc. But the customers are still hesitant to adopt cloud computing due to security and privacy. In this paper we propose a trust model which secures client’s information from both insiders and outsiders. In this model calculation of trust is based on their compliance report which has been promised in service level agreement. Keywords : cloud computing, trust, compliance, SLA, symmetric encryption
Enabling Business Rule oriented Constraint in XML Update Validation

In the database update validation field, we are often unaware that there is a softer side of business rules, where it is hard to be expressed in the form of data constraint, as they require human decisions, etc. Even though it is not as critical as data constraint; but it may influence the accurateness of system data in their own way. The motivation of our research is to handle this type of rule, particularly for XML update validation. We have come out with the concept of dynamic constraint validation special for XML data, which is based from soft type business rules. We also have proposed a few different types of dynamic constraints and an algorithm to extract only necessary information for dynamic type of rules w.r. t. the validation operation. In this paper, we mainly focus only on the single node updating for single step transition, which will affect the dynamic constraint. The dynamic constraint is expressed using Schematron and should be flexible enough to sit on top of any existing XML database. The analysis shows that the algorithm is in polynomial efficiency.
Multiple dependent queries execution using critical path scheduling in parallel databases

Multiple processors are employed to improve the performance of database systems and the parallelism can be exploited at three levels in query processing: intra-operation, inter-operation, and inter-query parallelism. Intra-operation and inter-operation parallelism are also called intra-query parallelism which has been studied extensively. In contrast, inter-query parallelism has received little attention particularly for multiple dependent queries. We develop a decompression algorithm, CPS, for coping with multiple dependent queries which are represented by a directed graph, and the algorithm makes use of the activity analysis of critical path analysis, and the resource scheduling and levelling of project management. A simulation study has been conducted and the results show that the proposed algorithm outperforms other existing methods and is able to provide a global optimal solution when the number of processors available is sufficient.
A novel reinforcement learning architecture for continuous state and action spaces

We introduce a reinforcement learning architecture designed for problems with an infinite number of states, where each state can be seen as a vector of real numbers and with a finite number of actions, where each action requires a vector of real numbers as parameters. The main objective of this architecture is to distribute in two actors the work required to learn the final policy. One actor decideswhat actionmust be performed;meanwhile, a second actor determines the right parameters for the selected action. We tested our architecture and one algorithmbased on it solving the robot dribbling problem, a challenging robot control problem taken from the RoboCup competitions. Our experimental work with three different function approximators provides enough evidence to prove that the proposed architecture can be used to implement fast, robust, and reliable reinforcement learning algorithms.
What connects us in shared decision-making in health

This paper explores the mechanisms that lead to consensus in shared decision-making (SDM). It does so by comparing the mechanisms described until now in the literature on small group decision-making with those made possible by SDM interventions. This type of theoretical analysis is useful for the critical understanding of the way in which SDM interventions are able to foster the sharing of information, preferences, identities, and meta-cognitions in connection with treatment decisions. This analysis may become particularly useful in answering the question: under what conditions are SDM interventions likely to lead to shared mental representations that foster consensus. In decision-making theory, there are two ways to generate consensus: one based on agreement about the decision-making process and one based one agreement on the final resolution or the content of the decision (Moscovici, Doise 1994; Zamfir 2005). In this paper, the author refers to the first type as process-based consensus and to the second type as content-based consensus. Discussions and voting are the most common ways to reach consensus (Moscovici, Doise 1994), with discussions being the preferred method for dyads. Consensus is important because it is the precondition for commitment (Hirokawa, Poole 1996). Also, consensus based decisions have the highest satisfaction rates compared to other decision-making strategies, like voting, representation (or deference), and this makes them a valued outcome (Zamfir 2005). Consensus, however, does not guarantee the best solution is implemented (Gheondea-Eladi 2015, Dunning et al. 1990, Oskamp 1982). In the ab-
A Comparison of Dynamic Load Balancing Algorithms

Distributed computing has the potential for running large-scale applications using heterogeneous and geographically distributed resources. However, a number of major technical issues must be handled before the full potential of distributed computing can be realized. Efficient job scheduling is a major prerequisite for the effective utilization of resources. Dynamic load balancing is the core of an efficient job scheduler. This paper describes the features of a Java- based simulator intended to analyze the performance of three load balancing algorithms, namely: sender- initiated, receiver-initiated and symmetrically-initiated algorithms using Average Waiting Time (AWT) and Average Turnaround Time (ATT) as criteria. Simulation results revealed that the symmetrically- initiated algorithm performs better in almost all cases.