Miracle-dz/UniFAR-FTUs huggingface dataset:
Notice of Retraction Creating competitive advantage through customer knowledge management in customer relationship management

Knowledge is the most valuable asset of a firm. It is also seen through the ages that only those who make a systematic effort can acquire knowledge. Today, Knowledge management is a growing field of study. Although current competitive challenges induced by today's business environment place firms' main emphais on organizational knowledge, customer knowledge has been overlook. Especially, there is a lack of a simple and overall framework to integrate the traditional customer relationship management (CRM) functionalities with the management and application of the customer-related knowledge, particularly in the context of marketing decisions. In this paper, we present an integrated framework for CRM through the application of knowledge management technology. The framework can be the basis for enhancing CRM development.
Path planning with neural subgoal search

A system for robot path planning is presented, that is able to find useful and efficient subgoals in an arbitrary environment. The system consists of two pairs of separately trained networks and an underlying layer of learning units. The network's training is completely based on the most elementary sensoric informations. The created solutions in two and three dimensional simulation environments prove the networks capability to build up a meaningful world model that is effectively applied to the tasks. <<ETX>>
An efficient key updating scheme for multicast key management

Algorithm for updating key forms the basis for any group key management (GKM) system. Existing hierarchical key tree based GKMs are complex, having high computational and communication overhead complexities up to O(logn). In this paper an improved multicast key management (MKM) system is presented, in which only few keys used for encrypting group key are renewed with both backward and forward secrecy being perfectly guaranteed. Furthermore, a mechanism named OWFDL (one-way function and double-lock encryption based) was introduced to reduce the complexities, in which an efficient algorithm of rekeying the group when many members join and leave in a batch interval is proposed. The results show that the OWFDL scheme can reduce both to O(1), which assures perfect multicast secrecy, that is not possible with the previous key management schemes.
Innovative techniques for device large‐signal noise simulations

Noise simulation of devices in RF and microwave applications requires to estimate the time‐periodic noiseless working point, which in turn calls for the inclusion in the model of the circuit elements surrounding the device itself. In this contribution we present a 2D numerical noise model based on the drift‐diffusion approximation able to tackle this issue, wherein both frequency‐ and time‐domain methods are implemented: we discuss both of them, pointing out the main advantages of each approach.
Augmenting a microprocessor with reconfigurable hardware

As VLSI technology continues to improve, configurable hardware devices such as PLDs are progressively replacing many specialized digital integrated circuits. Field-programmable gate arrays (FPGAs) are one class of such devices, characterized by their ability to be reconfigured as often as desired. Lately, FPGAs have advanced to the stage where they can host large computational circuits, giving rise to the study of reconfigurable computing as a potential alternative to traditional microprocessors. Most previous reconfigurable computers, however, have been ad hoc designs that are not fully compatible with existing general-purpose computing paradigms. This thesis examines the problem of combining reconfigurable hardware with a conventional processor into a single-chip device that can serve as the core of a general-purpose computer. The impact of memory cache stalls, of multitasking context switches, and of virtual memory page faults on the design of the reconfigurable hardware is considered. A possible architecture for the device is defined in detail and its implementation in VLSI studied. With basic development tools and a full-fledged simulator, several benchmarks are tested on the proposed architecture and their performance compared favorably against an existing Sun UltraSPARC. Some additional experiences with the architecture are also related, followed by suggestions for future research.
Physical Therapy Research: Principles and Applications

Research Fundamentals. Research in Physical Therapy. Theory in Physical Therapy Research. Research Ethics. Research Design. Resource Problems, Questions, and Hypotheses. Research Paradigms. Design Overview. Research Validity. Selection and Assignment of Subjects. Experimental Designs. Group Design. Single System Design. Non-Experimental Designs. Overview of Non-Experimental Research. Clinical Case Reports. Qualitative Research. Epidemiology. Outcomes Research. Survey Research. Measurement. Measurement Theory. Methodological Research. Measurement Tools for Physical Therapy Research. Data Analysis. Statistical Reasoning. Stat Analysis of Diff - Basic. Stat Analysis of Diff - Adv. Stat Analysis of Rel: Basic. Stat Analysis of Rel: Adv. Being a Consumer. Locating the Lit. Evaluating the Lit. Implementing Research. Project Implementation. Publishing and Presenting.
Neuroengineering control and regulation of behavior

To monitor neuronal circuits involved in emotional modulation of sensory processing we proposed a plan to establish novel research techniques combining recent biological, technical and analytical discoveries. The project was granted by National Science Center and we started to build a new experimental model for studying the selected circuits of genetically marked and behaviorally activated neurons. To achieve this goal we will combine the pioneering, interdisciplinary expertise of four Polish institutions: (i) the Nencki Institute of Experimental Biology (Polish Academy of Sciences) will deliver the expertise on genetically modified mice and rats, mapping of the neuronal circuits activated by behavior, monitoring complex behaviors measured in the IntelliCage system, electrophysiological brain activity recordings by multielectrodes in behaving animals, analysis and modeling of behavioral and electrophysiological data; (ii) the AGH University of Science and Technology (Faculty of Physics and Applied Computer Sciences) will use its experience in high-throughput electronics to build multichannel systems for recording the brain activity of behaving animals; (iii) the University of Warsaw (Faculty of Physics) and (iv) the Center for Theoretical Physics (Polish Academy of Sciences) will construct optoelectronic device for remote control of opto-animals produced in the Nencki Institute based on the unique experience in laser sources, studies of light propagation and its interaction with condensed media, wireless medical robotic systems, fast readout opto-electronics with control software and micromechanics.
An extension of stochastic process algebra for optical networks

An open research topic is how to combine the real-time traffic with the conventional formal language to allow modelling and efficient analysis of optical communication systems. We present a formal modelling language, called real-time stochastic process algebra (RT-SPA), to describe the real-time stochastic behaviour of optical communication systems. The language combines conventional stochastic process algebra with realtime semantics to describe complex systems in a compositional manner. It includes timed transition, parallel composition, probabilistic branching and hard real-time aspects. With this performance analysis methodology it is possible to obtain the design parameters of implementation using simulation with a lower computational time and cost than using conventional techniques. The adequacy of this framework applicability check is assessed by applying it to model and analyze wavelength-routed packet buffering techniques for optical networks.
Similar tasks, different effort : Why the same amount of functionality requires different development effort?

Since the appearance of Albrechts pioneering work, function points have attracted signi? cant attention from the industry. In their work, project managers can benchmark function point counts obtained for their projects against large publicly available datasets such as the ISBSG development & enhancement repository release 11, containing function point counts for more than 5000 projects. Unfortunately, larger amount of functionality as re? ected in the function points count does not necessarily correspond to a more signi? cant development effort. In this paper we focus on a collection of ISBSG projects with a similar amount of functionality and study the impact of different project attributes on the development effort.
Modeling and Verification of Distributed Systems Using Markov Decision Processes

The Markov Decision Process (MDP) formalism is a well-known mathematical formalism to study systems with unknown scheduling mechanisms or with transitions whose next-state probability distribution is not known with precision. Analysis methods for MDPs are based generally on the identification of the strategies that maximize (or minimize) a target function based on the MDP’s rewards (or costs). Alternatively, formal languages can be defined to express quantitative properties that we want to be ensured by an MDP, including those which extend classical temporal logics with probabilistic operators. Dario Bruneo and Salvatore Distefano (eds.) Quantitative Assessments of Distributed Systems, (3–26) 2015 © Scrivener Publishing LLC 3 4 Quantitative Assessments of Distributed Systems The MDP formalism is low level: to facilitate the representation of complex reallife distributed systems higher-level languages have been proposed. In this chapter we consider Markov Decision Well-formed Nets (MDWN), which are probabilistic extensions of Petri nets that allow one to describe complex nondeterministic (probabilistic) behavior as a composition of simpler nondeterministic (probabilistic) steps, and which inherit the efficient analysis algorithms originally devised for well-formed Petri nets. The features of the formalism and the type of properties that can be studied are illustrated by an example of a peer-to-peer illegal botnet.
Improving student achievement through Assessment for Learning

Research has confirmed that Assessment for Learning is a powerful tool that can raise teaching and learning standards but how do teachers get started? A forthcoming book from Curriculum Corporation provides practical guidance for teachers in the way that they consider and use assessment in the classroom. It highlights the learning partnership between students and teachers as they plan, set goals and respond to feedback to improve student learning and teaching focus.
Reconstruction of 3D Sparse images using Non-linear Filtering Compressed Sensing 3D Techniques

The objective of this project is to reconstruct 3D sparse images using Non-linear Filtering Compressed Sensing (NFCS) 3D Anisotropic and 3D Isotropic techniques. Compressed Sensing is a new paradigm for signal recovery and sampling. Using proposed NFCS techniques, a random mask is generated for the selected input 3D image using a sampling matrix. Now, a sparse image is generated for the selected 3D image. Applying Normalization, the original image will be reconstructed from the sparse 3D image in iterations. The obtained reconstructed 3D image will be filtered using an appropriate adaptive non-linear filter in proposed NFCS 3D techniques. The output parameters like Normalized Factor, PSNR, and CPU elapsed time will be calculated and compared along with simulation results. The results obtained using proposed techniques will confirm that these possess properties of efficiency, stability, low computational cost, fast recovery of 3D images in few seconds and its performance is competitive with those of state of art algorithms.
COMMONSENSE KNOWLEDGE EXTRACTION FOR PERSIAN LANGUAGE: A COMBINATORY APPROACH

The Putting human commonsense knowledge into computers has always been a long standing dream of artificial intelligence (AI). The cost of several tens of millions of dollars and time have been covered so that the computers could know about “objects falling, not rising. ”, “running is faster than walking”. The large database was built, automated and semi-automated methods were introduced and volunteers’ efforts were utilized to achieve this, but an automated, high-throughput and low-noise method for commonsense collection still remains as the holy grail of AI. The aim of this study was to build commonsense knowledge ontology using three approaches namely Hearst method, machine translation and using structured resources. Using three Persian corpuses and applying aforementioned methods, we could extract 7 different relations. Seventy thousand assertions have been extracted. Finally, average accuracy of Hearst, MT and structured resource were 75 per cent, 75 per cent and 100 per cent respectively.
Some numerical methods of diffusion equation for dic technique

Food drying is one of the common techniques for preserving food to decrease the moisture content and minimize the biochemical reactions of degradation. This paper focuses on the mathematical modeling of tropical fruits dehydration using instant controlled pressure drop (Detente Instantanee Controlee or known as DIC) technique. The mathematical model is described based on the Fick’s second type law [1]. Neglecting the effects of shrinkage, the Fick’s law is transformed into one dimensional partial differential equation (PDE) with parabolic type. The discretization of the PDE is based 3 points weighted finite difference approximation. The simulation of the diffusion equation is illustrated through some numerical iterative methods; Jacobi, Gauss Seidel, Red Black Gauss Seidel and Successive Over Relaxation (SOR) methods. The sequential algorithm is developed by using Matlab 7.6. 0 software with R2008a version supported by Intel®CoreTM Processor. The numerical analyses of these iterative methods are compared in terms of number of iterations, time execution, maximum error, root mean square error and computational complexity cost.
Using Live Sequence Chart Specifications for Formal Verification

USING LIVE SEQUENCE CHART SPECIFICATIONS FOR FORMAL VERIFICATION OF SYSTEMS Rahul Kumar Department of Computer Science Doctor of Philosophy Formal methods play an important part in the development as well as testing stages of software and hardware systems. A significant and often overlooked part of the process is the development of specifications and correctness requirements for the system under test. Traditionally, English has been used as the specification language, which has resulted in verbose and difficult to use specification documents that are usually abandoned during product development. This research focuses on investigating the use of Live Sequence Charts (LSCs), a graphical and intuitive language directly suited for expressing communication behaviors of a system as the specification language for a system under test. The research presents two methods for using LSCs as a specification language: first, by translating LSCs to temporal logic, and second, by translating LSCs to an automaton structure that is directly suited for formal verification of systems. The research first presents the translation for each method and further, identifies the pros and cons for each verification method.
ActionScript 3.0 Game Programming University

Learn ActionScript 3.0 the fun way, by creating 16 great games: real, robust games - not just "web toys"! Highly-rated ActionScript tutorial, now with seven new 3D and card games! Code and techniques easily adaptable to training, advertising, and more For Flash artists learning ActionScript, Flash programmers seeking to create games, and upgraders from ActionScript 1.0/2.0. Includes a chapter on developing games in Flash for the iPhone! Gary Rosenzweig's ActionScript 3.0 Game Programming University, Second Edition is the best hands-on tutorial for learning ActionScript 3.0, the programming language behind Flash Professional CS5. You will master all the basics of ActionScript programming by building 16 robust games. One step at a time, you'll learn techniques (and get tested code) that can be adapted to virtually any project, from games to training and advertising. The first edition earned widespread raves; Rosenzweig has now updated it with seven brand-new games that teach even more valuable ActionScript 3.0 skills and techniques. You will first learn how Flash and ActionScript 3.0 work together, the elements of an ActionScript program, and how to build a basic game framework with ActionScript. Next, Rosenzweig walks youthrough building the full spectrum of ActionScript games, including brain games, animation-based games, picture puzzles, games based on direction and movement, casual games, word games, Q and A games, action games, game worlds, and more. This edition adds new chapters on card games and 3D games, with High-Low, Video Poker, Blackjack, 3D Paddle Ball, 3D Scavenger Hunt, and two other new projects.
MC-FDMA and MC-TDMA versus MC-CDMA and SS-MC-MA: performance evaluation for fading channels

The multi-carrier (MC) multiple access schemes MC-FDMA, MC-TDMA, MC-CDMA and the previously proposed SS-MC-MA scheme are investigated and compared for the suitability in the uplink and the downlink of a mobile radio system. By presenting a bandwidth efficiency plan for the different MC multiple access schemes in fading channels, the influence of the channel code rate, the system load, and the spreading code length is presented. Moreover, results with oneand two-dimensional pilot symbol aided channel estimation are shown for the various MC multiple access schemes considering typical multipath propagation scenarios in the uplink and the downlink.
Some practical universal noiseless coding techniques

Some practical adaptive techniques for the efficient noiseless coding of a broad class of such data sources are developed and analyzed. Algorithms are designed for coding discrete memoryless sources which have a known symbol probability ordering but unknown probability values. A general applicability of these algorithms to solving practical problems is obtained because most real data sources can be simply transformed into this form by appropriate preprocessing. These algorithms have exhibited performance only slightly above all entropy values when applied to real data with stationary characteristics over the measurement span. Performance considerably under a measured average data entropy may be observed when data characteristics are changing over the measurement span.
Molecular Cloning A Laboratory Manual Fourth Edition

Download pdf #Molecular Cloning: A Laboratory Manual (Fourth Edition): Three-volume set. / #260571 in Books / Cold Spring Harbor Laboratory Press. download Molecular Cloning A Laboratory Manual Fourth Edition Three volume set PDF. ChE 130, Biomolecular Engineering Laboratory, Spring 2015 Available in the Laboratory: Molecular cloning: A laboratory manual, 3rd edition, J. Sambook and D.W. Available in Millikan Library: Molecular Biology of the Cell, 4th edition.
Multi-h CPM with post-detection diversity for satellite mobile communication systems

The increasing number of users of mobile communication systems and the corresponding need for increased capacity show the importance of using a modulation scheme which is both power and spectrally efficient. In the paper, the comparison between two different multi-h CPM schemes is made for the land mobile satellite communication channel. The study is complemented with the use of post-detection diversity in the receiver (implemented by means of two Viterbi receivers) that allows an improved performance, in particular when the received signal is unshadowed. Results show that multi-h CPM can achieve good performances when using receiver diversity both in terms of bit error rate and occupied bandwidth. However, during shadowed time intervals it is necessary to use some form of error control coding, specially for data transmission.
Quantization Noise: Roundoff Error in Digital Computation, Signal Processing, Control, and Communications

If you are working in digital signal processing, control or numerical analysis, you will find this authoritative analysis of quantization noise (roundoff error) invaluable. Do you know where the theory of quantization noise comes from, and under what circumstances it is true? Get answers to these and other important practical questions from expert authors, including the founder of the field and formulator of the theory of quantization noise, Bernard Widrow. The authors describe and analyze uniform quantization, floating-point quantization, and their applications in detail. Key features include: Analysis of floating point round off Dither techniques and implementation issues analyzed Offers heuristic explanations along with rigorous proofs, making it easy to understand 'why' before the mathematical proof is given
Out-of-core simplification of large polygonal models

We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme of Rossignac and Borrel [13] by using error quadric information for the placement of each cluster's representative vertex, which better preserves fine details and results in a low mean geometric error. The use of quadrics instead of the vertex grading approach in [13] has the additional benefits of requiring less disk space and only a single pass over the model rather than two. The resulting linear time algorithm allows simplification of datasets of arbitrary complexity. In order to handle degenerate quadrics associated with (near) flat regions and regions with zero Gaussian curvature, we present a robust method for solving the corresponding underconstrained least-squares problem. The algorithm is able to detect these degeneracies and handle them gracefully. Key features of the simplification method include a bounded Hausdorff error, low mean geometric error, high simplification speed (up to 100,000 triangles/second reduction), output (but not input) sensitive memory requirements, no disk space overhead, and a running time that is independent of the order in which vertices and triangles occur in the mesh.