Miracle-dz/UniFAR-FTUs huggingface dataset:
Pure Directional Transmission and Reception Algorithms in Wireless Ad Hoc Networks with Directional Antennas

At present,most research of mobile wireless ad hoc networks is based on the assumption of omni-antennas or omni-directional reception.The disadvantage of omni-directional reception is easy to meet jamming.Here,we proposed a novel medium access control(MAC) algorithm which is Time Division Multiple Access(TDMA)-based and distributed.The beamforming capability of smart antennas is exploited.No the assumption of omni-antennas or omni-directional reception capability at all,pure directional transmission and reception for mobile wireless ad hoc networks with directional antennas is used in this algorithm too.Recent research shows that there are significant gains in throughput to be realized with directional transmission and directional reception.The analysis shows that the proposed algorithm avoided the disadvantage of omni-directional reception and had a good ability of anti-jamming.Moreover,the time cost for neighbor discovery and reservation is only 9% of the whole time.Therefore,the algorithm is reasonable.
Automatic Multi-label Categorization of Java Applications Using Dependency Graphs

Automatic approaches for categorization of software repositories are increasingly gaining acceptance because they reduce manual effort and can produce high quality results. Most of the existing approaches have strongly relied on supervised machine learning –which requires a set of predefined categories to be used as training data– and have used source code, comments, API Calls and other sources to obtain information about the projects to be categorized. We consider that existing approaches have weaknesses that can have major implications on the categorization results and haven’t been solved at the same time, namely the assumption of non-restricted access to source code and the use of predefined sets of categories. Therefore, we present Sally : a novel, unsupervised and multi-label automatic categorization model that is able to obtain meaningful categories without depending on access to source code nor the existence of predefined categories by leveraging on information obtained from the projects in the categorization corpus and the dependency relations between them. We performed two experiments in which we compared Sally to the categorization strategies of two widely used websites and to MUDABlue, a categorization model proposed by Kawaguchi et al. that we consider to be a good baseline. Additionally, we assessed the proposed model by conducting a survey with 14 developers with a wide range of programming experience and developed a web application to make the proposed model available to potential users.
Mechanism and Kinematics of a Novel Climbing Robot

This paper presents a novel climbing robot mechanism.Its configuration and structure characteristics are introduced and the forward and inverse kinematics equations are derived.Three locomotion modes are presented,i.e.moving forward,turning and transmitting orthogonal planes.Analysis on the configuration and locomotion modes shows that this mechanism has a small volume and good motion performance.Simulation results prove that the robot needs less suction moments and motion space during locomotion.
Mikro-dizilim Veri Sınıflandırmasında Öznitelik Seçme Algoritmalarının Karşılaştırılması

Mikro-dizilim verileri son zamanlarda kanser hastaligi teshisinde siklikla kullanilmaktadir. Mikro-dizilim verilerinin makina ogrenme algoritmalarinda egitilmesi ve modellenmesi nitelik sayisinin fazlaligindan ve ornek sayisinin azligindan dolayi oldukca zordur. Bu yuzden mikro-dizilim verilerinin degerlendirilmesinde oznitelik secme algoritmalari buyuk onem kazanmaktadir. nitelik secme algoritmalari genel olarak filtre, sarmal ve gomulu olmak uzere uc ana baslikta incelenmektedir. Bu calismada mikro-dizilim verilerini siniflandirmada filtre modelli oznitelik secme algoritmalari, siniflandirma basari orani ve uygulanma sureleri bakimindan karsilastirilmistir. Bu baglamda 5 farkli filtre modelli oznitelik secme algoritmasi, 11 farkli mikro-dizilim veri setine uygulanmistir. Makina ogrenme algoritmasi olarak k-NN siniflandirma algoritmasi uygulanmis ve 10-katlamali capraz yontemi ile dogrulanmistir.
The Velvet Glove

Thank you for reading the velvet glove. Maybe you have knowledge that, people have look numerous times for their chosen novels like this the velvet glove, but end up in infectious downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they cope with some malicious virus inside their laptop. the velvet glove is available in our digital library an online access to it is set as public so you can get it instantly. Our book servers hosts in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the the velvet glove is universally compatible with any devices to read.
Research of TOA Ranging Technology Based on UWB

We analyze the method based on TOA(Time of Arrival)which is appropriate for UWB(Ultra Wild- Band)system,among classical localization technologies,and presents the theoretic analysis and simulation re- sults of the relative localization estimation with UWB in WSN(Wireless Sensor Networks). We prove the superi- ority of TOA localization method adopted in UWB system.In a single-hop WSN,the more the blindfolded nodes number the better localization precision is,in a multi-hop WSN,when the number of reference nodes is certain, the more links between blindfolded nodes and reference nodes,the better localization precision is;the more hop count,the worse localization precision is.
Opinion Mining for Multi-Mix Languages Hotel Review by using Fuzzy Sets

Social data analysis based on the conceptual and formal models are very useful for smooth running of web businesses. It is essential that cater to each and every consumer otherwise, attaining the desired goal can be difficult. Expression is a fast-evolving with emoji and Code-mixing in internet world. Doing sentimental analyses on user generated multi language service reviews with emotion and abbreviation tagging for identify the viewpoint is one of the challenging tasks. Purpose of this work is to extracting and summarizing the multiple
Optical amplifier arrangement

Optical amplifier arrangement with - which has a gain medium (1), an approximately rectangular cross section with a long edge and a short edge, - and at least two highly reflective mirrors (2, 3) between which the gain medium (1) is arranged, - wherein the long or the short edge of the cross section along the x-axis and the y-axis is the z-axis is the optical axis and the x-, y- and z-axes form a rectangular system of coordinates, - said mirrors (2, 3) are designed and arranged such that an irradiated from an oscillator to a reinforcing beam (4) passes several times through and in the xz plane through the gain medium is amplified, and - the dimension of the beam to be amplified (4) in the x-direction after each pass becomes larger. - and wherein the two mirrors (2, 3) are designed and arranged such that a hybrid resonator is formed, the unstable in the x-direction and in the y-direction .
3D WAVELET-BASED COMPRESSION OF HYPERSPECTRAL IMAGERY

Since hyperspectral imagery is generated by collecting hundreds of contiguous bands, uncompressed hyperspectral imagery can be very large, with a single image potentially occupying hundreds of megabytes. For instance, the Airborne Visible InfraRed Imaging Spectrometer (AVIRIS) sensor is capable of collecting several gigabytes of data per day. Compression is thus necessary to facilitate both the storage and the transmission of hyperspectral images. Since hyperspectral imagery is typically collected on remote acquisition platforms, such as satellites, the transmission of such data to central, often terrestrial, reception sites can be a critical issue. Thus, compression schemes oriented to the task of remote transmission are becoming increasingly of interest in hyperspectral applications. Although there have been a number of approaches to the compression of hyperspectral imagery proposed in recent years—prominent techniques would include vector quantization (VQ) (e.g., [1, 2]) or principal component analysis (PCA) (e.g., [3, 4]) applied to spectral pixel vectors, as well as 3D extensions of common image-compression methods such as the discrete cosine transform (DCT) (e.g., [5])—most of the approaches as proposed are not particularly well-suited to the image-transmission task. That is, in many applications involving the communication of images, progressive transmission is desired in that successive reconstructions of the image are possible. In such a scenario, the receiver can produce a low-quality representation of the image after having received only a small portion of the transmitted bitstream, and this “preview” representation can be successively refined in
A parallelized rule extraction method for high-dimensional pattern classification problems

In this paper, we propose a parallelized rule extraction method from trained neural networks for high-dimensional pattern classification problems. In the rule extraction method, we have to examine all combinations of antecedent fuzzy sets for extracting fuzzy rules. For high-dimensional problems, the number of possible combinations is increased exponentially. To address this difficulty, we parallelize the rule extraction method.
Grouping Methods for Pattern Matching over Probabilistic Data Streams

SUMMARY As the development of sensor and machine learning technologies has progressed, it has become increasingly important to detect patterns from probabilistic data streams . In this paper, we focus on complex event processing based on pattern matching . When we apply pattern matching to probabilistic data streams, numerous matches may be detected at the same time interval because of the uncertainty of data. Although existing methods distinguish between such matches, they may derive inappropriate results when some of the matches correspond to the real-world event that has occurred during the time interval. Thus, we propose two grouping methods for matches. Our methods output groups that indicate the occurrence of complex events during the given time intervals. In this paper, ﬁrst we describe the deﬁnition of groups based on temporal overlap, and propose two grouping algorithms, introducing the notions of complete overlap and single overlap . Then, we propose an e ﬃ cient approach for calculating the occurrence probabilities of groups by using deterministic ﬁnite automata that are generated from the query patterns. Finally, we empirically evaluate the e ﬀ ectiveness of our methods by applying them to real and synthetic datasets.
PRESENT STATE AND FUTURE DEVELOPMENT OF MOBILE ROBOT TECHNOLOGY RESEARCH

In this paper, the history, present situation and future of intelligent mobile robots technology are summarized. We analyze the technologies of robot navigation and localization, multisensor fusion etc. In addition, point out the advantages and disadvantages of these technologies. we also further describe the mobile robot technologies concerning biomimetic robot, multi robot system and robocup.
The giRaph package for graph representation in R

The giRaph package provides formal classes and methods to represent and manipulate graphs in the R language and environment for statistical computing and graphics. It is intended as a contribution to the gR project described by Lauritzen (2002). We consider a broad notion of graph, including graphs with loops, multiple edges and hyper-edges (i.e. edges involving more than two vertifces) both directed and undirected. In particular, hyper-graphs and simple graphs (as defined by Lauritzen, 1996) fall within the scope of our definition. Since there is no unique way to represent a graph which is optimal for all computations, we consider four different representations: incidence list, incidence matrix, adjacency list and adjacency matrix; see for example Ahuja et al. (1993). We provide classes for these representations, suitable to store graphs of different families, and classes for such families, handling alternative representations transparently with respect to the user. For each class we furnish a robust initialize method, that takes care of producing valid output from varied input, a nice show method, adopting typical graph notation, and methods to set and retrieve information. In addition, we implement conversions between graph representations, and between graphs of different families, by means of coerce methods. We also provide classes for directed and undirected edges, as well as for vertex sets, so that simple graph operations such as adding/removing an edge, or extracting an induced subgraph, can be performed via overloaded +, and * operators. Finally, we provide an interface to other graph packages such as the interactive graphical tool dynamicGraph by Badsberg (2005) which is also part of the gR project. Ahuja, R.K. , Magnanti, T.L. and Orlin J.B. (1993) “Network Flows”, Prentice-Hall, NJ. Badsberg, J.H. (2005) “dynamicGraph”, R package, version 0.2. 0.1, available on CRAN. Lauritzen, S.L. (1996) “Graphical Models”, Clarendon Press, Oxford, UK. Lauritzen, S.L. (2002) “gRaphical Models in R”, R News, 2, 39.
Feature-based 3-D surface reconstruction directed by grid space projection

In this paper we describe a voxel-based 3-D reconstruction algorithm from multiple calibrated camera views. Unlike image-based algorithms, this algorithm is capable of detecting occlusion explicitly, and recovering the conventional Stereo Algorithms limitations; the algorithm is extendable to reconstruct the full surface without any restrictions on the cameras distribution. Because of using stable features at consistency checking the mismatching probability is decreased. The Grid Space is traced one time only; hence, there is no any additional computation or memory consuming. In spite of that, experimental results on both real and synthetic images show the algorithm efficiency and time preserving.
Web Service and HLA-based Distributed Modelling & Simulating Environment

High Level Architecture (HLA) is an infrastructure that supports to the distributed MS environment, but limits in the local area network. Web service is the milestone for the distributed computing architecture and mode, which supports the interoperability among heterogeneous simulations and enables reusability of legacy models and simulations. Emerging HLA/RTI and web service technologies collectively helps to make distributed MS application available in the Internet environment. After analyzing the characteristics of the next generation MS technology, a framework of HLA and web service based for collaborative MS of a complex system, the corresponding technology and integration of these two infrastructures towards a collaborative simulation solution were proposed. Furthermore, a highly distributed collaborative MS prototyping system based on this framework was designed in developing.
Writing Research Papers Across The Curriculum

Thank you for reading writing research papers across the curriculum. As you may know, people have look numerous times for their chosen books like this writing research papers across the curriculum, but end up in malicious downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they cope with some malicious bugs inside their computer. writing research papers across the curriculum is available in our book collection an online access to it is set as public so you can get it instantly. Our books collection saves in multiple countries, allowing you to get the most less latency time to download any of our books like this one. Merely said, the writing research papers across the curriculum is universally compatible with any devices to read.
Makomotines A to D from Makomotake, Zizania latifolia Infected with Ustilago esculenta.

Abstract Four novel compounds, makomotines A to D ( 1 – 4 ), along with two known ones ( 5 , 6 ) were isolated from Makomotake, Zizania latifolia infected with Ustilago esculenta . The structures were determined or identified by the interpretation of spectroscopic data. Compound 1 suppressed the formation of osteoclast without toxicity.
Analysis for e-commerce protocols based on ProVerif

It was very important to analyze e-commerce protocols by formal methods.A technique for modeling the fair-change e-commerce protocol(FEEP) with automated dispute resolution and for verifying its property was proposed.First, FEEP was modeled in applied picalculus and a novel formalization of the fairness was provided in term of a correspondence property.Then, ProVerif, proposed by Juels, Catalano and Jakobsson, was adopted to analyze FEEP automatically.The results show that:it is feasible to formalize the fairness based on a correspondence property;ProVerif can be used to verify the property that before event A happened, event B had happened, but it is not applicable to analyze the property that after event A happened, event B would happen.
Modelica Instance Creation

This paper is about instance creation in Modelica. Despite the conceptual simplicity of Modelica's object-oriented framework, instance creation in Modelica requires surprisingly complicated procedures. Hence, it takes considerable effort to develop a Modelica processor for extracting all variables, equations and algorithms from a given Modelica class. This paper is meant to reduce this effort by presenting key representations and algorithms for instance creation. To ease reading and verification, instance creation is developed for a fragment of Modelica, called SimpleModelica. Building on the representations and procedures given here, the implementation of instance creation (flattening) for full Modelica should be straightforward. However, that ultimate procedure is not given here, since it is loaded with technical details, described in the (100 pages) Modelica language specification. 1 SimpleModelica
Enabling Multilingual Social Interactions and Fostering Language Learning in Virtual Worlds

Virtual worlds are a new way for people to communicate, to meet and to socialize. They are now pushing the boundaries of multilingual communication. The need for multilingual support is increasing every day making virtual worlds a very good example of fields of development where applications supporting multilinguality are becoming an absolute necessity. In order to enhance interoperability between virtual worlds, applications and corpora, it is obvious that standards should come into place. This is the main goal of MLIF and, on a more global perspective, of the Metaverse1 project. In this paper, we study social interactions in virtual worlds, present some cues to facilitate them, and describe the empirical support that we developed for these theories. We also present a few methods for fostering language learning in virtual worlds, and we explain how we have implemented some of them.
Statistical Methods for the Analysis of Biomedical Data

This is the fourth version (4E) of this book to appear in less than 10 years. Most recently, the third edition (3E), published in 1999, was reported by Ziegel (2001). In the Preface, the authors call the S language “the statistician’s calculator for the 1990s” (p. v). Perhaps there should be a poll, but I imagine that the SAS Institute might question that claim. SAS users, already burdened with one cumbersome syntax-oriented language, probably, like me, have never wanted to learn another, especially one that is not nearly as capable. The recent S-PLUS GUI, which encouraged my purchase of a copy of S-PLUS, merits only a 4-page Appendix here. The comment by the authors that “we do not discuss the interface here, as it does not provide enough power for our material” (p. 3) indicates that they have a more masochistic approach to statistical computing than I do. The authors have continued to enhance the book. The 4E makes only a few modest additions to the material of the 3E. They emphasized one change, which must interest someone—the addition of coverage of the R-version of the S language. The introductory chapters have been reorganized to provide a complete chapter on data manipulation. A chapter on computation using generalized linear mixed models has been added. Neural network methods are discussed for both nonlinear regression and classi cation applications. Sections on splines and projection pursuit regression have been added. The book concludes with a completely new chapter on optimizations. The authors have promised a website that provides all of the datasets and the S code used in the book. In addition, it is supposed to contain “on-line complements, additional sections and chapters” (p. v). The site was not yet developed when this report was written.
Looking forward by looking back: Applying lessons from 20 years of African language technology

This paper takes a frank look at what has and has not been achieved in African language technology during the past two decades. Several questions are addressed: What was the status of technology for African languages 20 years ago? What were the major initiatives during that time? What were their successes and failures? What can we learn from these experiences? How does this inform the work that we are planning going forward? Examining in particular the history of Swahili, it is argued that technology projects have often achieved their expressed aims, but have collectively not significantly advanced the normalization of African languages as operable within the technical sphere, even while Africa has become blanketed with mobile technology. It is argued that future projects will succeed only by asserting the goal that technology of 2035 must be fully operational in users' primary languages, and gearing policy, funding, and individual project efforts toward gathering and deploying linguistic data for a large number of African languages to meet cutting-edge technologies as they emerge
Crystal structure of (4-ethoxynaphthalen-1-yl)(furan-2-yl)methanone, C17H14O3

Abstract C17H14O3, monoclinic, C2/c (no. 15), a = 17.373(4) Å, b = 7.8290(16) Å, c = 19.781(4) Å, β = 93.62(3)°, V = 2685.2(9) Å3, Z = 8, Rgt(F) = 0.0447, wRref(F2) = 0.1313, T = 293(2) K.
Data Visualization Research and Development

Data visualization is the new technique of data analysis and process, which aims at presenting the data sets with image and graph with the assistance of such methods and techniques as interactions, multi-dimension analysis and data mining. This article firstly introduces the concept of data visualization and its development, and then introduces several types of data visualization techniques and their representative methods used in large data sets. It also covers an analysis and comparison between data visualization and scientific computing visualization. In the end, this article discusses on the future work of data visualization. ;