Miracle-dz/UniFAR-FTUs huggingface dataset:
PKI Based Scheme for Detection of Node Replication Attack in Mobile Sensor Network

In these days, randomly moving sensor networks are used for building up a application in all the areas like industrial, environmental, and medical and so on. There are some disadvantages of this network over the WSN, this network faces the problem regarding the security attack and they create clones of the nodes. They face this problem because of their dynamic nature. There are some solutions for noticing the attack of node replication. The sensor node generally does not assemble with tamper resistant hardware. This permits the circumstances where the competitor can easily compact the sensor node. There are number of approach are done for noticing node replication offense. The methods like localize algorithm, resisting node replication attack in mobile sensor networks. In this paper we introduced PKI based method for detecting node replication attack. This method improved the localized algorithm and settles the node attack. The proposed system consist of localize algorithm for detecting node replication attack and algorithm to protecting the node replication attack with less storage requirement, processing control and communication transparency.
Enabling Chaotic Ubiquitous Computing 1

Today, ubiquitous computing is possible only in handcrafted environments, and not across administrative and technological domains. For this to happen, a middleware "ecology" will need to emerge, so that users can exploit a chaotic environment of competing communication and service providers, and overlapping administrative authorities. Although key elements of the ecology exist today, simple exploitation of unfamiliar (or familiar) ubiquitous environments remains a challenge for users. They need simple tools that open the way to this increasingly rich ecology of devices, services, and information. This paper describes how such tools can be provided through a software abstraction called a frame.
On the use of an elastic-plastic contact law for the impact of a single flexible link

An elastic-plastic contact law is proposed for modeling impact of a single flexible link. This contact law allows continuous transition between contact and non-contact phases and is capable of predicting impact force histories. The impact model parameters can readily be obtained from the material and geometric properties. Excellent agreement with the experimental results has been obtained for both elastic and rigid body motion of the link. The impact force histories are also obtained and compared for perfectly elastic and elastic-plastic impact models. It is shown that a perfectly elastic impact assumption is not realistic for most impacts of flexible links.
Reconfigurable FPGAS for real time image processing in space

Programmable logic offers an efficient solution for the performance and flexibility required by real time image processing systems. Application specific integrated circuit (ASIC) devices could provide such performance, but the lack of flexibility for changing operation requirements and the associated high development and production cost limit their acceptance for space applications. Field programmable gate arrays (FPGAs) offer highly flexible designs, scalable circuits, and real time system performance. The parallel processing power of FPGAs allows data to be processed more quickly than a similar microprocessor implementation. The High Performance Computing (HPC-I) payload for the Australian scientific mission satellite FedSat has been designed and manufactured to validate the use of FPGA technology onboard satellites for a variety of space applications. This paper elaborates on implementing image processing algorithms and techniques on FPGAs for space applications. It presents the implementation, testing and performance evaluation of a Gaussian filter and convolution engine on HPC-I.
Document clustering using sample weighting

Clustering algorithm based on Sample weighting has been noticed recently. In this paper, a novel sample weighting clustering algorithm is presented based on K-Means and fuzzy C-Means algorithm. The algorithm uses academic documents as the clustering objects. The PageRank value of each document is calculated according to the cited relationship among them, and it is used as the weight in the algorithm. Experiments show that the proposed algorithm is effective to improve performance of document clustering.
Design of Web Questionnaires

In this article, an information-processing perspective is used to explore the impact of response categories on the answers respondents provide in Web surveys. Response categories have a significant effect on response formulation in questions that are difficult to process, whereas in easier questions (where responses are based on direct recall) the response scales have a smaller effect. In general, people with less cognitive sophistication are more affected by contextual cues. The Need for Cognition and the Need to Evaluate indexes for motivation account for a significant part of the variance in survey responding. Interactions of ability to process information and motivation combine in regulating responses for questions that are more difficult to process. The results hint at a substantial role of satisficing in Web surveys.
Application of automatic differentiation to trajectory optimization via direct multiple shooting

This is dedicated to all the people who work to make the Austin music scene the treasure it is. Acknowledgments I would like to thank my advisor Dr. Wallace Fowler for his support and encouragement throughout this project, as well as the first pointer to the GSRP program. Thanks are also extended to the other members of my dissertation committee for their guidance, advice, and support: Dr. Several people at Langley Research Center helped to make this work possible. Thanks are extended to the Vehicle Analysis Branch for taking me in and supporting my fellowship and providing great insight into the design and anaysis of launch vehicles. In particular I would like to thank David Way, Thanks to Lloyd Evans and Rafaela Schwan in the Office of Education for helping me get in Langley and assisting with my fellowship. Special thanks go to Craig Hunter and Karen Deere of Langley's Configuration Aerodynamics Branch for providing the initial opportunity for me to work at Langley. I would also like to thank my family for their support and encouragement. In particular my parents, Daniel and Mary Garza, brother and sister-v Escobedo. Special thanks go to my uncle and aunt James and Linda Boyce for the family contact during my summers in Virginia. I have made many friends in the Aerospace Department and Center for Space Research at UT, and they have helped make the years of work more fun and stimulating. In particular I would like to thank Calina Seybold, Olivier support, friendship, and encouragement. Thanks are also directed to the friends I've made at a couple of wel-Wright, for taking me on as a novice sailor. Automatic differentiation, also called computational differentiation and algorithmic differentiation, is the process of computing the derivatives or Tay-lor series of functions from the computer source code implementing the functions. To date, general-purpose trajectory optimization codes have relied on finite-differencing to compute the gradients needed by the nonlinear programming (NLP) algorithms within the codes. These codes typically support the selection of an arbitrary objective and constraint set from a library of a few hundred output variables. The use of automatic differentiation in these tra-jectory optimization programs can provide objective and constraint gradients to the same precision as the underlying functions without requiring the generation of hundreds of analytic derivative expressions by hand or via symbolic algebra packages. This work combines automatic differentiation with a direct multiple …
Actors and Arenas, Elections and Competition: The 1958 Election of the Singapore Chinese Chamber of Commerce

In 1958, the Singapore Chinese Chamber of Commerce had to decide whether to remain active in politics, representing not only the commercial interests of the rich but also the views of Chinese society at large, or to function solely as a commercial organisation. The eventual success of the pro-politics faction illustrates the buoyant aspirations of the Chinese merchant elite. The public battle for control over the Chamber shows that Chinese businessmen assessed their options by pragmatically balancing political, economic as well as cultural constraints and opportunities.
An application of hierarchical chromosome based genetic algorithm to the optimization pf platform shape

In this paper we present hierarchical chromosome based genetic algorithm and its application to solving of exemplary design problem optimization of platform shape. The problem consists in finding the optimal shape of the platform with minimal overall volume and the stress value not greater then the maximum admissible value, when the platform is under the external load. The algorithm uses hierarchical chromosome representation and hierarchical genetic operators, instead of the binary representation and traditional genetic operators. It allows for coding of phenotypes with different number of components as well as performing reproduction with such individuals. In order to solve the problem, the application with hierarchical chromosome based genetic algorithm was interfaced with the parallel fully automatic hp adaptive 3D Finite Element Method package (parhp3D). The parhp3D application was used to compute the stress values for individuals generated by genetic algorithm.
Feminism and Queer in Art Education

In this article, I argue that gender issues should be central to art education that aims to advance social justice in education, culture, and societies. Gradually discovering how little gender and queer are discussed in Finnish art education on a professional level, I find it important to explore why this is as well as to point out some of the key challenges in deconstructing gender. In the first part of the chapter, I share illustrative personal experiences of the workings of queer identity politics. Secondly, I look at how queer is avoided and dismissed as a topic, issue, and an essential element in education, even though it is often thought or claimed to be included. The implausible conceptualization of gender leads to a false emancipation, creating new power dichotomies. In the third section, I ask more precise questions about the conceptualization of sex and gender, and draw on Judith Butler’s (1999) gender theory 2
Using constraint programming for solving dynamic scheduling in the endoscopy unit

Abstract Scheduling in the Endoscopy Unit is faced with difficulties to manage dynamic and uncertain situations resulting from the progress of therapy, patients in urgency or material unavailability. This paperpresents an approach based on constraint programming techniques for solving Endoscopy Scheduling Problem in dynamic way. Our aim is to provide to hospitals a system allowing them to schedule the endoscopy activities and to avoid unconsidered investments.
Practical Application of Model Checking in Software Verification

This paper presents our experiences in applying the JAVA PATHFINDER (J(sub PF)), a recently developed JAVA to SPIN translator, in the finding of synchronization bugs in a Chinese Chess game server application written in JAVA. We give an overview of J(sub PF) and the subset of JAVA that it supports and describe the abstraction and verification of the game server. Finally, we analyze the results of the effort. We argue that abstraction by under-approximation is necessary for abstracting sufficiently smaller models for verification purposes; that user guidance is crucial for effective abstraction; and that current model checkers do not conveniently support the computational models of software in general and JAVA in particular.
Objective detection of sting jets in low‐resolution datasets

Sting jets are transient coherent mesoscale strong wind features that can cause damaging surface wind gusts in extratropical cyclones. Currently, we have only limited knowledge of their climatological characteristics. Numerical weather prediction models require enough resolution to represent slantwise motions with horizontal scales of tens of kilometres and vertical scales of just a few hundred metres to represent sting jets. Hence, the climatological characteristics of sting jets and the associated extratropical cyclones cannot be determined by searching for sting jets in low‐resolution datasets such as reanalyses.
Program schemas as proof methods.

Automatic proof and automatic programming have always enjoyed a close relationship. We present a unification of proof planning (a knowledge-based approach to automated proof) and schema-guided synthesis (a knowledge-based approach to automatic programming). This unification enhances schema-guided synthesis with features of proof planning, such as the use of heuristics and the separation between object-level and meta-level reasoning. It enhances proof planning with features of schema-guided synthesis, such as reuse. It allows program schemas and heuristics to be implemented as proof planning methods. We aim particularly at implementation within the Clam proof planner, whose higherorder features are particularly appropriate for synthesis . Program synthesis and satisfaction of its proof obligations, such as verification conditions, matchings, or simplifications, are thus neatly integrated.
Problem Decomposition for Non-Uniformity and Processor Heterogeneity

Grid problems that exhibit non-uniformity or irregularity are common in science and engineering. Methods for partitioning these problems across traditional parallel machines with homogeneous processors have been examined by a number of researchers. In this paper we extend some typical decomposition schemes for uniform 2-D grid problems to accommodate non-uniformity in the problem space as well as heterogeneity of the processors. A new block decomposition method, Fair Binary Recursive Decomposition (FBRD), is proposed and an extension of this method, Non-Uniform FBRD (NUFBRD) is described. A simple mathematical characterization of communication cost is presented along with simulated performance comparisons of the various decomposition methods for non-uniform problem spaces that assume the existence of modern high speed switching technology. (b) (c) Grid Square with 1 data element Grid Square with 4 data elements Figure 1: Examples of (a) uniform, (b) non-uniform, and (c) irregular grids.
A Survey on Behavior Analysis in Video Surveillance Applications

There is an increasing desire and need in video surveillance applications for a proposed solution to be able to analyze human behaviors and identify subjects for standoff threat analysis and determination. The main purpose of this survey is to look at current developments and capabilities of visual surveillance systems and assess the feasibility and challenges of using a visual surveillance system to automatically detect abnormal behavior, detect hostile intent, and identify human subject. Visual (or video) surveillance devices have long been in use to gather information and to monitor people, events and activities. Visual surveillance technologies, CCD cameras, thermal cameras and night vision devices, are the three most widely used devices in the visual surveillance market. Visual surveillance in dynamic scenes, especially for humans, is currently one of the most active research topics in computer vision and artificial intelligence. It has a wide spectrum of promising public safety and security applications, including access control, crowd flux statistics and congestion analysis, human behavior detection and analysis, etc. Visual surveillance in dynamic scene with multiple cameras, attempts to detect, recognize and track certain objects from image sequences, and more importantly to understand and describe object behaviors. The main goal of visual surveillance is to develop intelligent visual surveillance to replace the traditional passive video surveillance that is proving ineffective as the number of cameras exceed the capability of human operators to monitor them. The goal of visual surveillance is not only to put cameras in the place of human eyes, but also to accomplish the entire surveillance task as automatically as possible. The capability of being able to analyze human movements and their activities from image sequences is crucial for visual surveillance. In general, the processing framework of an automated visual surveillance system includes the following stages: Motion/object detection, object classification, object tracking, behavior and activity analysis and understanding, person identification, and camera handoff and data fusion. Almost every visual surveillance system starts with motion and object detection. Motion detection aims at segmenting regions corresponding to moving objects from the rest of an image. Subsequent processes such as object tracking and behavior analysis and recognition are greatly dependent on it. The process of motion/object detection usually involves background/environment modeling and motion segmentation, which intersect each other
Feature-based off-line programming of coordinate measuring machines

The paper describes an off-line programming system for coordinate measuring machines based on a novel approach. Input data to the system is the geometric model produced by a CAD system. Using the picture of the part, the user can select the surface elements to be inspected. He or she has to provide the tolerance data as additional information. First the workpiece setup is decided: the position, orientation, and accessibility of the part is determined. Next the system automatically generates an optimal distribution of the measuring points for the surfaces to be inspected and the local probe path. Probe clusters are built together on an interactive way using a set of building blocks. A time optimal sequence of the inspection operations is computed using heuristic algorithms. At this stage all information needed for the CMM program is available and will be combined in a device independent DMIS format, which in turn can be converted into equipment specific programs.
Microsoft Windows Server 2003: Security Enhancements and New Features

Abstract : The purpose of this thesis is to discuss the new features and enhancements of Windows Server 2003. Windows NT and Windows 2000 were known to have numerous security vulnerabilities; hence Microsoft focused on improving security by making Windows Server 2003 secure by design, secure by default, secure in deployment. This thesis examines the differences between the five unique editions of the Windows Server 2003 family. Some of the pros and cons of migrating to Windows Server 2003 are highlighted. The author hopes this study will assist information technology professionals with their decision on whether or not to upgrade to this latest version of Microsoft's flagship network operating system.
An Introduction to Matlab for Econometrics

This paper is an introduction to MATLAB for econometrics. It describes the MATLAB Desktop, contains a sample MATLAB session showing elementary MATLAB operations, gives details of data input/output, decision and loop structures, elementary plots, describes the LeSage econometrics toolbox and maximum likelihood using the LeSage toolbox. Various worked examples of the use of MATLAB in econometrics are also given. After reading this document the reader should be able to make better use of the MATLAB on-line help and manuals.
Simultaneous extraction and localization of dipolar independent components in evoked potentials

EEG stimulus-related responses have been extensively studied to gain insight on the functional behavior of the brain. Traditionally, these responses have been considered as the result of the generation of low-amplitude evoked potentials (EP). When averaged, these low-amplitude potentials come up from the background and can be cleanly observed. Independent component analysis (ICA) is a technique widely used to solve the problem of blind source separation (BSS). When applied to EP, ICA provides a method to obtain activation signals of neural structures responsible for the generation of several components of EP. ICA algorithms may be modified in order to impose some constraints on the independent components (IC) to be extracted or the mixing matrix, resulting in the so-called constrained ICA (cICA). Here, we make use of a cICA approach to get those IC of the EP that can be identified with point-dipolar sources, as well as their position.
Panorama des techniques de codage/décodage conjoint et techniques de diversité adaptées à la transmission de flux vidéo et HTML sur lien IP sans fil point/multipoint

I. Introduction The concomitant developments of the Internet, which offers to its users always larger and more evolved contents (from HTML (HyperText Markup Language) files to multimedia applications), and of wireless systems and handhelds integrating them, have progressively convinced a fair share of people of the interest to always be connected. Still, constraints of heterogeneity, reliability, quality and delay over the transmission channels are generally imposed to fulfill the requirements of these new needs and their corresponding economical goals. This implies different theoretical and practical challenges for the digital communications community of the present time. This paper presents a survey of the different techniques existing in the domain of HTML and video stream transmission over erroneous or lossy channels. In particular, the existing techniques on joint source and channel coding and decoding for multimedia or HTML applications are surveyed, as well as the related problems of streaming and downloading files over an IP mobile link. Finally, various diversity techniques that can be considered for such links, from antenna diversity to coding diversity, are presented.
Case-Based Reasoning: Experiences, Lessons and Future Directions

From the Publisher: This book presents a selection of recent progress, issues, and directions for the future of case-based reasoning. It includes chapters addressing fundamental issues and approaches in indexing and retrieval, situation assessment and similarity assessment, and in case adaptation. Those chapters provide a "case-based" view of key problems and solutions in context of the tasks for which they were developed. It also presents lessons learned about how to design CBR systems and how to apply them to real-world problems. The final chapters include a perspective on the state of the field and the most important directions for future impact. The case studies presented involve a broad sampling of tasks, such as design, education, legal reasoning, planning, decision support, problem-solving, and knowledge navigation. In addition, they experimentally examine one of the fundamental tenets of CBR, that reasoning from prior experiences improves performance. The chapters also address other issues that, while not restricted to CBR per se, have been vigorously attacked by the CBR community, including creative problem-solving, strategic memory search, and opportunistic retrieval. This volume provides a vision of the present, and a challenge for the future, of case-based reasoning research and applications.
Procede d'estimation de la phase dans un systeme de communication numerique et boucle a verrouillage de phase

Un procede d'estimation d'une phase dans un systeme de transmission numerique comportant les etapes suivantes : - reception et memorisation d'un bloc d'observations Yk ; - execution d'au moins une boucle a verrouillage de phase sur une sequence predeterminee d'observations extraites dudit bloc. Chaque boucle de phase fournie une valeur intermediaire, dont la combinaison permet de fournir une estimation affinee de la phase. Le procede permet la realisation d'un estimateur de phase ameliore base sur la simplicite des boucles a verrouillage de phase.