Miracle-dz/UniFAR-FTUs huggingface dataset:
Distributed computing approaches for large-scale probit-based stochastic user equilibrium problems

Traffic assignment on transportation networks is often accomplished using determinant user equilibrium (DUE) or stochastic user equilibrium (SUE). However, these applications can be limited because of the heavy requirements for computing power required. This article presents a distributed computing approach that uses a two-stage Monte Carlo simulation method to solve the stochastic network loading problem. The authors’ work accelerates the Monte Carlo simulation method by using a distributed computing system. They adopt three distributed computing approaches for the workload partition of the Monte Carlo simulation method. The first approach allocates each processor in the distributed computing system to solve each trial of the simulation in parallel and in turns. The second approach assigns all the processors to solve the shortest-path problems in one trial of the Monte Carlo simulation concurrently. The third approach combines the first two, so different trials of the Monte Carlo simulation as well as the shortest path problems in one trial are solved simultaneously. The authors report on their comprehensive testing of these three approaches, first on the Sioux-Falls network and then on a randomly generated network example. Their results demonstrate that computational time for the probit-based SUE problem can be largely reduced by any of these three approaches. However, they stress that the first approach is the best one, which they demonstrate by using it to calculate the probit-based SUE problem on a large-scale network example. These techniques may prove useful in areas such as road pricing toll design and transportation network design problems.
Cognitive Developmental Grasp Robots: From Infant Development to Computational Modeling

We addressed the idea that a hybrid of symbolic and sub-symbolic representations is the best method to represent cognition for developmental robots. Basing the learning mechanisms of a cognitive developmental robot on principles of human-like learning, we developed an intelligent grasping robot architecture based on the hierarchical learning. The hybrid of different representations and memory in IGR also gave a new direction for developing robots with high intelligence.
An Analytic Solution of the Warehouse Problem

In a recent paper, [Bellman, Richard. 1956. On the theory of dynamic programming---a warehousing problem. Management Sci.2 3, April 272. ], Bellman uses dynamic programming to establish a computational algorithm for the solution of the “warehouse” problem. The present paper also employs the dynamic-programming approach and shows that the structure of the solution can be determined analytically, with numerical results easily obtained via recursive formulas.
CARPS, A PROGRAM WHICH SOLVES CALCULUS WORD PROBLEMS

A program was written to solve calculus word problems. The program CARPS (Calculus Rate Problem Solver), is restricted to rate problems. The overall plan of the program is similar to Bobrow''s STUDENT , the primary difference being the introduction of "structures" as the internal model in CARPS. Structures are stored internally as trees. Each structure is designed to hold the information gathered about one object. A description of CARPS is given by working through two problems, one in great detail. Also included is a critical analysis of STUDENT .
A logical approach to narrative understanding

It is argued that a "theory bottleneck" encountered in the 70's and early 80's in attempts to build comprehensive NLU systems led to a fragmentation of NLU research, which still persists. NLU is an organic phenomenon, and enough has been learned about the vexing problems of the 80's to try to integrate these insights and build more comprehensive theories and extensible implementations. On that premise, a new comprehensive framework for narrative understanding has been developed. Its centerpiece is a new situational logic called Episodic Logic (EL), a highly expressive knowledge and semantic representation well-adapted to the interpretive and inferential needs of general NLU. EL is Montague-inspired and influenced by situation semantics. It provides an easily computed first order logical form for English. It allows propositional attitudes, unreliable generalizations, and other non-standard constructs, including ones involving events, actions, facts, kinds and donkey sentences. It incorporates a DRT-like treatment of indefinites, and makes systematic use of episodic variables in the representation of episodic sentences, using them to capture temporal and causal relationships. The rules of inference in EL include probabilistic versions of deduction rules resembling forward and backward chaining rules in expert systems. Also developed is a uniform, compositional approach to interpretation in which a parse tree leads directly (in rule-to-rule fashion) to a preliminary, indexical logical form, and this indexical LF is deindexed with respect to the current context (a well-defined structure). The initial translation is obtained using a GPSG-style grammar; the latter transformation is accomplished by a new recursive deindexing mechanism. Deindexing simultaneously transforms the LF and the context: context-dependent constituents of the LF, including tense, aspect and temporal adverbials, are replaced by explicit relations among quantified episodes, bringing the context information into the LF, thus removing context dependency; and new structural components and episode tokens are added to the context. The relevant context structures are called tense trees. The mechanism allows reference episodes to be correctly identified even for embedded clauses. Finally, a pilot implementation is able to make many (though not all) of the inferences described in this thesis, and has been successfully used in several domains.
Implementation of New secured data compression technique using Huffman code and Symmetric Key

Data compression is a common requirement for most of the computerized applications. There are many number of unsecured data compression algorithms, which are dedicated to compress different unsecured data formats. Even for a single data type there are number of different compression algorithms, which use different approaches. In this research, we propose a simple and efficient data compression algorithm particularly suited to be used on available commercial basis using secured manner. Our intention is transmitting text data in secured as well as compressed in the open environment. It is using double compression technique based on Huffman coding algorithm and simple symmetric key algorithm. Experiment itself evaluates the performance of new secured data compression algorithm with other data compression algorithm.
An interactive 3D interface for a virtual ceramic art work environment

Describes the design and implementation of a hands-on interface to support 3D object creation in a virtual environment (VE). This interface provides a 3D stereoscopic display facility. Virtual objects are presented stereoscopically just in front of users through LCD shutter glasses, enabling them to manipulate the objects directly by using their own real hands with two-handed instrumented gloves. It provides functions such as dynamic gesture expressions, position and size indication of the 3D objects, spatial manipulations, and a stereoscopic display function to operate with the two-handed gloves. A method called quasi-force-feedback is designed to control spatial tasks such as translations, rotations and deformations of the objects. It takes advantage of the objects' deformation speed to give the users a sense of force resistance from the objects visually without using any real force-feedback devices. Ceramic art is chosen as a target application and a prototype system for providing a realistic 3D virtual environment by simulating the pottery-making space in the real world is under development to verify its usefulness and effectiveness.
Preliminaries to a Theory of Speech Disfluencies

This thesis examines disfluencies (e.g., “um”, repeated words, and a variety of forms of self-repair) in the spontaneous speech of adult normal speakers of American English. Despite their prevalence, disfluencies have traditionally been viewed as irregular events and have received little attention. The goal of the thesis is to provide evidence that, on the contrary, disfluencies show remarkably regular trends in a number of dimensions. These regularities have consequences for models of human language production; they can also be exploited to improve performance in speech applications. The method includes analysis of over 5000 hand-annotated disfluencies from a database (250,000 words) containing three different styles of spontaneous speech: task-oriented humancomputer dialog, task-oriented human-human dialog, and human-human conversation on a prescribed topic. The approach is theory-neutral and strongly data-driven. The annotations correspond to observable characteristics (“features”) in the data, including: 1) the speech domain; 2) the speaker; 3) the sentence in which a disfluency occurs; 4) word-related characteristics of the disfluency; and 5) simple acoustic characteristics of the disfluency. A methodology is developed for representing these features in a database format, and an algorithm is provided for automatic disfluency type classification based on this representation. Results show regular trends in disfluency rates by sentence length, by disfluency position, by presence of another disfluency in the same sentence, by disfluency type, and by combinations of these features both across and within speakers. Regularities are also found for word-related features of the disfluency, including the number of excised words, the rate of cutoff words, and the rate of editing phrases. Additional analyses describe characteristics of overlapping disfluencies and prosodic characteristics of the simplest disfluency types. Across analyses, data from the three different speech styles are compared; where relevant, simple parametric models are provided. In sum, disfluencies show regularities in a variety of dimensions. These regularities can help guide and constrain models of spoken language production. In addition they can be modeled in applications to improve the automatic processing of spontaneous speech.
Fuzzy systems design via ensembles of ANFIS

Neurofuzzy networks have become a powerful alternative strategy to develop fuzzy systems, since they are capable of learning and providing IF-THEN fuzzy rules in linguistic or explicit form. Amongst such models, ANFIS is recognized as a reference framework, mainly for its flexible and adaptive character. In this paper, we extend ANFIS theory by experimenting with a multi-net approach wherein two or more differently structured ANFIS instances are coupled to play together. Ensembles of ANFIS (E-ANFIS) enhance ANFIS performance skills and alleviate some of its computational bottlenecks. Moreover, they promote the automatic configuration of different ANFIS units and the a posteriori selective combination of their outputs. Experiments conducted to assess E-ANFIS generalization capability are also presented.
An Approach for the Empirical Validation ofSoftware Complexity Measures

Software metrics are widely accepted tools to control and assure software quality. A large number of software metrics with a variety of content can be found in the literature; however most of them are not adopted in industry as they are seen as irrelevant to needs, as they are unsupported, and the major reason behind this is due to improper empirical validation. This paper tries to identify possible root causes for the improper empirical validation of the software metrics. A practical model for the empirical validation of software metrics is proposed along with root causes. The model is validated by applying it to recently proposed and well known metrics.
Adaptive personalized interfaces—A question of viability

Abstract It is widely accepted that interfaces between computers and users should differ to accommodate individual, or group, needs. One method of ‘personalizing’ an interface is to have the system form a limited model of the user and employ it to fashion the dialogue to his needs. Unfortunately, little is known about the effect of adaptation on the man–machine interface. Although obvious advantages accrue from ‘personalized’ interfaces, there are also obvious disadvantages to presenting users with a changing, adapting and perhaps apparently inconsistent interface. The goal of this work is to determine the viability of an adaptive interface through a human–factor pilot study of a simple, specially designed, interactive computer system. The system uses menu–driven selection to retrieve entries from a large ordered telephone directory. This simple task has several advantages: it is a realistic application area for interactive computers; plausible adaptive modelling methods exist and have been studied theore.
Discrimination between low metal content mine and non-mine-targets using polarimetric ultra-wide-band radar

In this paper we show that wide band radar polarimetry can be used for discrimination between surface laid AP mine and non-mine targets. To do this we employ two types of coherent radar decomposition theorem applied to wide band chamber measurement data from the European Microwave Scattering Laboratory (EMSL). Our main conclusion is that radar polarimetry should be further investigated as an important way to secure low false alarm rate from radar sensors in stand off mine detection.
Construction and Rendering of Trimmed Blending Surfaces with Sharp Features on a GPU

We construct surfaces with darts, creases, and corners by blending different types of local geometries. We also render these surfaces efficiently using programmable graphics hardware. Points on the blending surface are evaluated using simplified computation which can easily be performed on a graphics processing unit. Results show an eighteen‐fold to twenty‐fold increase in rendering speed over a CPU version. We also demonstrate how these surfaces can be trimmed using textures.
Investigation of space charge formation at polymer interface using laser induced pressure pulse technique

This paper reports the results of an investigation into the space charge formation and decay at the interface between polyethylene and ethylene vinyl-acetate used in cable insulation systems. Planar samples were subjected to high dc electric stress for extended periods of time and space charge measurements taken using the laser induced pressure pulse (LIPP) technique. The results were compared with those obtained from the individual materials under the same experimental conditions.
A framework for automatic causality extraction using semantic similarity

Textual documents are the most common way of storing and distributing information within organizations. Extracting useful information from large text collections is therefore the goal of every organization that would like to take advantage of the experience encapsulated in those texts. Entering data using a free text style is easy, as it does not require any special training. However, unstructured texts pose a major challenge for automatic extraction and retrieval systems. Generally, deep levels of text analysis using advanced and complex linguistic processing are necessary that involve computational linguistic experts and domain experts. Linguistic experts are rare in engineering organizations, which thus find it difficult to apply and exploit such advanced extraction techniques. It is therefore desirable to minimize the extensive involvement of linguist experts by learning extraction patterns automatically from example texts. In doing so, the analysis of given texts is necessary in order to identify the scope and suitable automatic methods. Focusing on causality reasoning in the field of fault diagnosis, the results of experimenting with an automatic causality extraction method using shallow linguistic processing are presented.Copyright © 2007 by ASME
New reference point for guiding an articulated vehicle

Deals with the control of an articulated vehicle. A new reference point for guiding an articulated vehicle is suggested and the equations of motion in terms of this point has been derived. Both the planning and tracking aspects of the control problem are analyzed. Using the proposed reference point the forward/backward maneuvers can be incorporated into the planning procedure in a natural way. The planning procedure is enhanced by adding an "on-the-spot folding" maneuver, that replaces the reversals of conventional algorithms. Using our proposed "intermediate" reference point we may handle by the same way the forward and backward portions of the path bypassing the numerical instability that arises in computing the segments with varying curvature assigned for backward motion. A position estimation scheme based on internal sensors (wheel encoders) is also discussed. Although this work was performed as part of a research project on automatic guidance of mining vehicles, many of its results have a wider area of application.
A Framework for SLA-based cloud services verification and composition

Cloud computing is becoming a key element in service provision on the Internet. Businesses are seizing the availability of infrastructure as service to obtain cost effective infrastructure solutions. However, in businesses the power of services emerges from the ability to combine different services in order to obtain some value added services. Cloud services composition presents some challenges like, service discovery and real time service evaluation; which are addressed in this paper by introducing a primal framework that enables dynamic specification of SLAs, in addition to SLA-based verification and composition of services on the Cloud. The verification is used as input to the composition and consists of verifying the functional and non-functional properties of the cloud service under test. An ongoing prototype implementation will evaluate the verification scheme and prove its importance in composing and selecting services on the cloud.
Basic concepts and architectural details of the Delphi trigger system

Delphi (DEtector with Lepton, Photon and Hadron Identification) is one of the four experiment of the LEP (Large Electron Positron) collider at CERN. The detector is laid out to provide a nearly 4/spl pi/ coverage for charged particle tracking, electromagnetic, hadronic calorimetry and extended particle identification. The trigger system consists of four levels. The first two are synchronous with the BCO (Beam Cross Over) and rely on hard-wired control units, while the last two are performed asynchronously with respect to the BCO and are driven by the Delphi host computers. The aim of this paper is to give a comprehensive global view of the trigger system architecture presenting, in detail the first two levels, their various hardware components and the latest modifications introduced in order to improve their performance and make more user friendly the whole software user interface. <<ETX>>
Intelligent Agent System by Self Organizing Neural Network

In this paper, I proposed the INTelligent Agent System by Kohonen's Self Organizing Neural Network (INTAS). INTAS creates each user's profile from the information. Based on it, learning community grouping suitable to each individual is automatically executed by using unsupervised learning algorithm. In INTAS, grouping and learning are automatically performed on real time by multiagents, regardless of the number of learners. A new framework has been proposed to generate multiagents, and it is a feature that efficient multiagents can be executed by proposing a new negotiation mode between multiagents.
Antioxidant activity of fifteen seeds from fruit processing residues by different methods

This study identified and quantified five phenolic compounds, and evaluated the antioxidant capacity in vitro of fifteen native and exotic Brazilian fruit seeds that are typically discarded as waste. The contents of phenolic compounds were determined by ultra-performance liquid chromatography coupled with tandem mass spectrometry, and the antioxidant capacity was determined by oxygen radical absorbance capacity (ORAC) and 2,2-diphenyl-1-picrylhydrazyl (DPPH•) antioxidant assays. The results showed the antioxidant activity of Campomanesia pubescens, Hovenia dulcis Thunberg and Syzygium jambos (L.) Alston in the ORAC assay, and Hymenaea stigonocarpa, Hovenia dulcis Thunberg and Campomanesia pubescens in the DPPH• assay. Among the fifteen samples, four were highlighted regarding phenolic compound analyzes: Hovenia dulcis Thunberg (5.723 µg g -1 ) for gallic acid and myricetin (111.057 µg g -1 ), Passiflora edulis (1.208 µg g -1 ) for chlorogenic acid, Annona atemoya (1.0580 µg g -1 ) for vanillic acid, and Campomanesia pubescens (0.420 µg g -1 ) for ferulic acid. Therefore, these fruit seeds can be used as alternative sources of natural antioxidants.
Conditional-capture flip-flop for statistical power reduction

This paper describes a family of novel low-power flip-flops, collectively called conditional-capture flip-flops (CCFFs). They achieve statistical power reduction by eliminating redundant transitions of internal nodes. These flip-flops also have negative setup time and thus provide small data-to-output latency and attribute of soft-clock edge for overcoming clock skew-related cycle time loss. The simulation comparison indicates that the proposed differential flip-flop achieves power savings of up to 61% with no impact on latency while the single-ended structure provides the maximum power savings of around 67%, as compared to conventional flip-flops. With a typical switching activity of 0.33, the power consumption is reduced by as much as 23-30% with comparable minimum data-to-output latency. It is also indicated that the proposed single-ended structure provides power comparable to the fully static master-slave design with significantly reduced data-to-output latency. An eight-bit counter was fabricated using a 0.35-/spl mu/m CMOS technology, and the experimental results indicate that the counter using the differential CCFF saves the overall power consumption by about 30% as compared to that using the conventional flip-flop.
A Novel Method for Mining the Advisor-Student Relationships in Academic Social Network

Academic social network contains abundant knowledge about relationships among people or entities. Building the relationship between different entities correctly can help providing comprehensive services in the scientific research field. Unfortunately, some relationships, such as advisor-student relationship, are often hidden in academic social network, which are not explicitly categorized. Discovery of these relationships can benefit many valuable applications such as research community analysis. In this paper, a novel method based on Markov Logic Network is proposed to mine the advisor-student relationship in academic social network. Experimental results show that the proposed approach can find the advisor-student relationship effectively.
HARDWARE PROTOTYPING FOR THE H.264 4u 4 TRANSFORMATION

This paper presents a hardware prototype of the H.264 transformation. The proposed architecture uses only add and shift operations to reduce the computational requirements for the 4u 4 transform. The architecture is developed to be used in high-resolution applications such as High Definition Television (HDTV) and Digital Cinema. The developed architecture is prototyped and simulated using ModelSim 5.4®. It is synthesized using Leonardo Spectrum®. The results show that the architecture satisfies the real-time constraints required by different digital video applications.