Miracle-dz/UniFAR-FTUs huggingface dataset:
The Criterions for Selecting Reference Points in RTK GPS Survey

RTK GPS has seen great technological advances over the past few years and is now routinely used in a wide variety of engineering type applications. Around the world, real-time kinematics GPS systems provide with centimeter level position in seconds, allowing workers to get the precision they need at the moment that they need it. The one GPS receiver is placed in a control point (named the reference station) with known coordinates. RTK system combine GPS information and data radio communication with advanced algorithms to calculate precise position of large projects, such as highway and bridge project.
Simple Design and Unit Testing with Enterprise JavaBeans: The Box Metaphor

Introducing Enterprise JavaBeansTM (EJBs) in your system adds a level of complexity. Whether or not using EJBs has its advantages is not in the scope of this paper. But when you do decide to use them, for whatever reason, there are some simple rules you can take into account. The Box Metaphor will help you keep the business logic in your system simple and clean and, most of all, independent from the technology layer (EJB). This will make it easier to develop all your code in a test harness [1], especially the business logic, which is most important to you.
Models and modeling : cognitive tools for scientific enquiry

PART I - Theory Formation and Modeling in Science Education. - Chapter 1. Modeling and the Future of Science Learning, Richard K. Coll, Denis Laijum. - Chapter 2. A Study of Expert Theory Formation: The Role of Different Model Types and Domain Frameworks, Allan Collins. -Chapter 3. The Nature of Scientific Meta-Knowledge, Barbara Y. White, Allan Collins, John R. Frederiksen. - Chapter 4. From Modeling Schemata to the Profiling Schema: Modeling across the Curricula for Profile Shaping Education, Ibrahim A. Halloun. - PART II - Modeling and Student Learning in Science Education. - Chapter 5. Helping Students Construct Robust Conceptual Models, Colleen Megowan-Romanowicz. - Chapter 6. The Molecular Workbench Software: An Innovative Dynamic Modeling Tool for Nanoscience Education, Charles Xie, Amy Pallant . - Chapter 7. Lowering the Learning Threshold: Multi-Agent-Based Models and Learning Electricity, Pratim Sengupta, Uri Wilensky. - Chapter 8. Engineering-based Modeling Experiences in the Elementary and Middle Classroom, Lyn D. English, Nicholas G. Mousoulides. - Chapter 9. Engaging Elementary Students in Scientific Modeling: The MoDeLS 5th Grade Approach and Findings, Hamin Baek, Christina Schwarz, Jing Chen, Hayat Hokayem, Li Zhan. - PART III - Modeling and Teachers' Knowledge. - Chapter 10. Relationships between Elementary Teachers' Conceptions of Scientific Modeling and the Nature of Science, Valarie L. Akerson, Orvil White, Huseyin Colak,Khemmawaddee Pongsanon. - Chapter 11. Science teachers' knowledge about learning and teaching models and modeling in Public Understanding of Science, Ineke Henze, Jan H. van Driel. - Chapter 12. Teaching Pre-service Elementary Teachers to Teach Science with Computer Models, Nicos Valanides, Charoula Angeli. - Subject Index.
Saying and doing: uses of formal languages in the conduct of business

This dissertation proposes, develops, and demonstrates a computational system that performs more office tasks than previously possible. This system is based on highly expressive formal languages and speech act theory. Because of the complexity of communication, this system divides office tasks into two types--those that involve communication (the saying tasks) and those that do not (the doing tasks). This general-purpose system performs, monitors, and coordinates tasks that are distributed over time, place, people, and applications. This system is based on observations about the nature of work and effective and efficient workers. The architecture of the system involves four main parts: (1) a formal language for communication, (2) a system for managing messages in this formal language, (3) a formal language for describing tasks, and (4) a system that performs, coordinates, and monitors these tasks. The formal language for communication, previously defined by Kimbrough and associates, is described and slightly modified. A new theory of formal language communication is derived from an existing theory of natural language communication. The requirements for a system of managing messages are described and investigated. A declarative, formal language is defined for describing the tasks the system can perform. Finally, a system that interprets these task descriptions is described. This system not only executes tasks but monitors their success and coordinates the people and applications that perform them. The fully integrated system provides powerful tools for communication and coordination. Several prototype applications demonstrate the usefulness of the architecture and the underlying communication theory. Both systems are shown to be implementable and plausibly useful for businesses to integrate into their information systems. The communication theory is shown to be useful though many steps in the process must be further investigated.
A MICROPROCESSOR-BASED MULTIFUNCTION MYOELECTRIC CONTROL SYSTEM

Myoelectric prostheses are well accepted by below elbow amputees but less well by those with higher level amputations. The primary limitation at present lies in the control system. Although these systems have been successful for single device control (hand or elbow), the extension to the control of more than one device (either simultaneously or sequentially) has been difficult. It is the control systems which now limit the performance and, at times, the acceptance of the prosthetic fitting. For the high-level amputee (above-elbow or higher) and especially for the bilateral amputee, the need for improved control systems for multifunction prostheses is critical. Over the past several years the Institute has been developing a myoelectric control system which is easy to operate, yet provides control of many independent prosthetic limb functions.
Feedback Control of a Bipedal Walker and Runner with Compliance

Feedback Control of a Bipedal Walker and Runner with Compliance by Koushil Sreenath Chair: Jessy W. Grizzle This dissertation contributes to the theoretical foundations of robotic bipedal locomotion and advances the experimental state of the art as well. On the theoretical side, a mathematical formalism for designing provably stable, walking and running gaits in bipedal robots with compliance is presented. A key contribution is a novel method of force control in robots with compliance. The theoretical work is validated experimentally on MABEL, a planar bipedal testbed that contains springs in its drivetrain for the purpose of enhancing both energy efficiency and agility of dynamic locomotion. While the potential energetic benefits of springs are well documented in the literature, feedback control designs that effectively realize this potential are lacking. The methods of virtual constraints and hybrid zero dynamics, originally developed for rigid robots with a single degree of underactuation, are extended and applied to MABEL, which has a novel compliant transmission and multiple degrees of underactuation. A time-invariant feedback controller is designed such that the closed-loop system respects the natural compliance of the open-loop system and realizes exponentially stable walking gaits. A second time-invariant feedback controller is designed such that the closed-loop system not only respects the natural compliance of the open-loop system, but also enables active force control within the compliant hybrid zero dynamics and results in exponentially stable running gaits. Several experiments are presented that highlight different aspects of MABEL and the xii feedback design method, ranging from basic elements such as stable walking, robustness under perturbations, energy efficient walking to a bipedal robot walking speed record of 1.5 m/s (3.4 mph), stable running with passive feet and with point feet. On MABEL, the full hybrid zero dynamics controller is implemented and was instrumental in achieving rapid walking and running, leading upto a kneed bipedal running speed record of 3.06 m/s (6.8 mph).
Local histograms for per-pixel classification

Abstract : We introduce a rigorous mathematical theory for the analysis of local histograms, and study how they interact with textures that can be modeled as occlusions of simpler components. We first show how local histograms can be computed as a system of convolutions and discuss some basic local histogram properties. We then introduce a probabilistic, occlusion-based model for textures and formally demonstrate that local histogram transforms are natural tools for analyzing the textures produced by our model. Next, we characterize all nonlinear transforms which satisfy the three key properties of local histograms and consider the appropriateness of local histogram features in the automated classification of textures commonly encountered in histological images. We discuss how local histogram transforms can be used to produce numerical features that, when fed into mainstream classification schemes, mimic the baser aspects of a pathologist's thought process.
Interprocedural Reaching Definitions in the Presence of Single Level Pointers

This paper describes the rst algorithm that calculates Interprocedural Def-Use Associations in C software systems. Our algorithm accounts for program-point-speci c pointer-induced aliases, although it is currently limited to programs using a single level of indirection. We prove the NP-hardness of the Interprocedural Reaching De nitions Problem and point out the approximation made by our polynomial-time algorithm. Initial empirical results are also presented. The research reported here was supported by Siemens Corporate Research and NSF grants CCR-8920078 and CCR-9023628 1/5.
Compressed Measurement of Structural Similarity Index

Image quality index corresponds to amount of degradation in an image. Structural Similarity Index(SSIM) is one such image quality index considered under this project. The statistical parameters required for the computation of SSIM are defined in spatial domain. The computations involved can be reduced when performed in compressed or reduced domain. In addition, as many image processing applications are based on compressed data, reconstructing inferior quality image for quality measurement can also be avoided. Compressed data can be achieved either at processing level (image compression algorithms) or at acquisition level (compressive sampling). A new algorithm called CM-SSIM was proposed to compute the SSIM from the compressed data. This is done through reconstructing data from reduced dimension to appropriate basis system and defining statistical parameters associated with the basis system. The proposed algorithm is validated by performing correlation analysis between the DMOS with acutal SSIM and CM-SSIM. The correlation factors considered for analysis are pearson, spearman and kendall tau. The results confirms that the proposed algorithm exist a good relationship with the DMOS \& actual SSIM and would be suitable for future real-time systems
Building Ontology Networks: How to Obtain a Particular Ontology Network Life Cycle?

To build an ontology, ontology developers should devise first a concrete plan for the ontology development, that is, they should establish the ontology life cycle. To do this, ontology developers should answer two key questions: a) which ontology life cycle model is the most appropriate for their ontology project? and b) which particular activities should be carried out in their ontology life cycle? In this paper we present a set of guidelines to help ontology developers and also naive users answer such questions.
A Database Creation and Retrival Method of Feature Descriptors for Markerless Tracking

In this paper, we propose a novel database creation and retrieval method of feature descriptors to support real-time marker-less tracking in the augmented reality environments. Each feature descriptor is encoded by integer and multi-level database is created in order to retrieve a feature descriptor efficiently. The retrieval of a feature descriptor is performed as follows: Firstly, candidate feature descriptors are searched by traversing the multi-level database. Secondly, the euclidean distance between input feature descriptor and each candidate one is compared. The shortest one is retrieved. The proposed method is 16 ms faster than previous KD-Tree method for each feature descriptor.
Extending MoXi to simulate Western watercolor

Watercolor is one of the most appealing paint media enjoyed by artists around the world. Due to its complex nature, it is also one of hardest media to simulate on a computer for interactive painting applications. In this paper, we describe an extension of our previous work, MoXi, which is a system for simulating Chinese ink painting, to cover watercolor effects. These effects include backrun, granulation, and edge-darkening. A simple technique for quick post-simulation edge-darkening is also developed. We also discuss the use of the Kubulka-Munk Model for watercolor glazing composition.
Finding Support Documents with a Logistic Regression Approach

Entity retrieval finds the relevant results for a user’s information needs at a finer unit called “entity”. To retrieve such entity, people usually first locate a small set of support documents which contain answer entities, and then further detect the answer entities in this set. In the literature, people view the support documents as relevant documents, and their findings as a conventional document retrieval problem. In this paper, we will state that finding support documents and that of relevant documents, although sounds similar, have important differences. Further, we propose a logistic regression approach to find support documents. Our experiment results show that the logistic regression method performs significantly better than a baseline system that treat the support document finding as a conventional document retrieval problem.
Le point sur la programmation par aspects

Reuse is one of the major promises of object-oriented programming. Unfortunately, this promise is only partially achieved. One of the sources of this failure is the mix of the applications basic functionalities code with non-functional properties code (e.g. distribution, fault tolerance, persistence). In order to avoid this weakness, the aspect-oriented programming (AOP) paradigm proposes to split applications implementation into aspects representing either functionalities or non-functional properties. Then, an application is built by composing (“assembling”) various aspects. We have identified three different approaches allowing AOP. In this paper, we present and discuss these approaches and the concepts behind AOP. MOTS-CLES : Separation des aspects, composition d’aspects, reutilisation.
Polymer-solvent compounds : a route to make new polymer structures

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.
Clustering of scientific fields by integrating text mining and bibliometrics

Increasing dissemination of scientific and technological publications via the Internet, and their availability in large-scale bibliographic databases, has led to tremendous opportunities to improve classification and bibliometric cartography of science and technology. This metascience benefits from the continuous rise of computing power and the development of new algorithms. Paramount challenges still remain, however. This dissertation verifies the hypothesis that accuracy of clustering and classification of scientific fields is enhanced by incorporation of algorithms and techniques from text mining and bibliometrics. Both textual and bibliometric approaches have advantages and intricacies, and both provide different views on the same interlinked corpus of scientific publications or patents. In addition to textual information in such documents, citations between them also constitute huge networks that yield additional information. We incorporate both points of view and show how to improve on existing text-based and bibliometric methods for the mapping of science. The dissertation is organized into three parts. Firstly, we discuss the use of text mining techniques for information retrieval and for mapping of knowledge embedded in text. We introduce and demonstrate our text mining framework and the use of agglomerative hierarchical clustering. We also investigate the relationship between the number of Latent Semantic Indexing factors, the number of clusters, and clustering performance. Furthermore, we describe a combined semi-automatic strategy to determine the optimal number of clusters in a document set. Secondly, we focus on analysis of large networks that emerge from many individual acts of authors citing other scientific works, or collaborating in the same research endeavor. These networks of science and technology can be analyzed with techniques from bibliometrics and graph theory in order to rank important and relevant entities, for clustering or partitioning, and for extraction of communities. Thirdly, we substantiate the complementarity of text mining and bibliometric methods and we propose schemes for the sound integration of both worlds. The performance of unsupervised clustering and classification significantly improves by deeply merging textual content of scientific publications
An in-depth look into the win32 portable executable le format

A good understanding of the Portable Executable (PE) file format leads to a good understanding of the operating system. If you know what's in your DLLs and EXEs, you'll be a more knowledgeable programmer. This article, the first of a two-part series, looks at the changes to the PE format that have occurred over the last few years, along with an overview of the format itself. After this update, the author discusses how the PE format fits into applications written for . NET, PE file sections, RVAs, the DataDirectory, and the importing of functions. An appendix includes lists of the relevant image header structures and their descriptions.
Lustre: Building a File System for 1,000-node Clusters

Lustre is a GPLed cluster file system for Linux that is currently being tested on three of the world’s largest Linux supercomputers, each with more than 1,000 nodes. In the past 18 months we’ve tried many tactics to scale to these limits, and the first half of this paper will discuss some of our successes and failures. The second half will explore some of the changes that we plan to make over the next year, as we scale towards tens of thousands of clients and petabytes of data.
The Geometry of Multiple Images

Nitrocyclopropane is prepared by reacting 3-chloro-1-nitropropane with an amine which has a polar center in addition to an amino function in the presence of a polar, aprotic solvent. For example, the reaction of 3-chloro-1-nitropropane with ethylene diamine in the presence of dimethyl sulfoxide produces nitrocyclopropane in high yield.
Modality and the semantics-pragmatics interface

This thesis explores certain aspects of the structure of lexical semantics and its interaction with pragmatic processes of utterance comprehension, using as a case-study a sample of the English modal verbs. Contrary to previous polysemy-based accounts, I propose and defend a unitary semantic account of the English modals, and I give a relevance-theoretic explanation of the construction of their admissible (mainly, root and epistemic) contextual interpretations. Departing from previous accounts of modality, I propose a link between epistemic modality and metarepresentation, and treat the emergence of epistemic modal markers as a result of the development of the human theory of mind. In support of my central contention that the English modals are semantically univocal, I reanalyse a range of arguments employed by previous polysemy-based approaches. These arguments involve the distributional properties of the modals, their relationship to truth-conditional content, the status of so-called speech-act modality, and the historical development of epistemic meanings: it turns out that none of these domains can offer reasons to abandon the univocal semantic analysis of the English modals. Furthermore, I argue that the priority of root over epistemic meanings in language acquisition is predicted by the link between epistemic modality and metarepresentation. Finally, data from a cognitive disorder (autism) are considered in the light of the metarepresentation hypothesis about epistemic modality. The discussion of modality has a number of implications for the concept of polysemy. I suggest that, despite its widespread use in current lexical semantics, polysemy is not a natural class, and use the example of the Cognitive Linguistics to illustrate that polysemy presupposes some questionable assumptions about the structure of lexical concepts. I propose a division of labour between ambiguity, semantic underdeterminacy, and a narrowed version of polysemy, and present its ramifications for the psychology of word meaning. In the final chapter, I extend the proposed framework for modality to the analysis of generic sentences, thereby capturing certain similarities between genericity and modality.
Adaptive real-time decoding of brain signals for long-term control of a neuro-prosthetic device

ADAPTIVE REAL-TIME DECODING OF BRAIN SIGNALS FOR LONG-TERM CONTROL OF A NEURO-PROSTHETIC DEVICE Tushar Dharampal, B.E. Marquette University, 2011 Changes in the statistical properties of neural signals recorded at the brainmachine interface (BMI) pose significant challenges for accurate long-term control of prostheses interfaced directly with the brain by continuously altering the relationship between neural responses and desired action. In this thesis, we develop and test an adaptive decoding algorithm that can recover from changes in the statistical properties of neural signals within minutes. The adaptive decoding algorithm uses a Kalman filter as part of a dual-filter design to continuously optimize the relationship between the observed neural responses and the desired action of the prosthesis. Performance of the algorithm was evaluated by simulating the encoding of arm movement by neurons in the primary motor cortex under stationary conditions as well as nonstationary conditions depicting loss and/or replacement of neurons in the population. The time taken for the system to fully recover (3-12 minutes) was faster than other adaptive systems (Rotermund et al 2006) and resulted in errors that were well matched to the initial system performance. The algorithm adapts to the instantaneous properties of the stimulus and is able to decode movements with high accuracy outside the trained movement space. This implementation lends itself favorably toward a portable long-term decoding approach at the brainmachine interface capable of providing accurate real-time decoding of neural signals over periods of weeks to months without outside intervention.