Miracle-dz/UniFAR-FTUs huggingface dataset:
A Radio-Aware Routing Algorithm for Reliable Directed Diffusion in Lossy Wireless Sensor Networks

In Wireless Sensor Networks (WSNs), transmission errors occur frequently due to node failure, battery discharge, contention or interference by objects. Although Directed Diffusion has been considered as a prominent data-centric routing algorithm, it has some weaknesses due to unexpected network errors. In order to address these problems, we proposed a radio-aware routing algorithm to improve the reliability of Directed Diffusion in lossy WSNs. The proposed algorithm is aware of the network status based on the radio information from MAC and PHY layers using a cross-layer design. The cross-layer design can be used to get detailed information about current status of wireless network such as a link quality or transmission errors of communication links. The radio information indicating variant network conditions and link quality was used to determine an alternative route that provides reliable data transmission under lossy WSNs. According to the simulation result, the radio-aware reliable routing algorithm showed better performance in both grid and random topologies with various error rates. The proposed solution suggested the possibility of providing a reliable transmission method for QoS requests in lossy WSNs based on the radio-awareness. The energy and mobility issues will be addressed in the future work.
Successive Convex Matching for Action Detection

We propose human action detection based on a successive convex matching scheme. Human actions are represented as sequences of postures and specific actions are detected in video by matching the time-coupled posture sequences to video frames. The template sequence to video registration is formulated as an optimal matching problem. Instead of directly solving the highly non-convex problem, our method convexifies the matching problem into linear programs and refines the matching result by successively shrinking the trust region. The proposed scheme represents the target point space with small sets of basis points and therefore allows efficient searching. This matching scheme is applied to robustly matching a sequence of coupled binary templates simultaneously in a video sequence with cluttered backgrounds.
Optimal Realization of an Arbitrary Two-Qubit Quantum Gate

Abstract By an explicit construction, we show that an arbitrary two-q ubit gate can be implemented by using at most 16 elementary one-qubit gates and 3 CNOT gates. We sho w that this construction is optimal; in the sense that these numbers of gates is the minimal possib le ones. Moreover, we show that if the two-qubit gate belongs to SO(4), then we need only 12 elementary one-qubit gates and 2 CNOT ga tes.
MRI: Model-Based Radio Interpolation for Indoor War-Walking

Location estimation methods using radio fingerprint have been studied extensively. The approach constructs a database that associates ambient radio signals with physical locations in training phase, and then estimates the location by finding the most similar signal pattern within the database. To achieve robust and accurate location estimation, the training phase should be conducted across the entire target space. In practice, however, a user may only access limited or authorized places in a building, that causes degradation in accuracy. In this paper, we present a smartphone-based autonomous indoor war-walking scheme, which automatically constructs the location fingerprint database, even covering unvisited locations. While a smartphone user explores the target area, the proposed system tracks the user's trajectory and simultaneously trains the location fingerprint database. Furthermore, our scheme interpolates radio signals in the database with an appropriate radio propagation model, and supplements fingerprints for unvisited places. As a result, although a user may sparsely explore the target site, the scheme returns the complete database. We implemented our solution and demonstrated the feasibility of the solution.
The kinetics of monazomycin-induced voltage-dependent conductance. II. Theory and a demonstration of a form of memory

The empirical differential equation that describes the kinetics of monazomycin-induced voltage-dependent conductance is derived using a standard chemical kinetic formulation and the assumption that monazomycin entry into and exit from the membrane is autocatalytic. The predicted form of gating currents is shown and numerical calculations for this process are made using a range of values for two unmeasured variables. A form of "memory" is then demonstrated, along with the ability of the theoretical equation to explain the nature of the memory.
An Agent's Action Selection Strategy by Using Case-based Reasoning and Simulated Vision

This paper presents an approach to agent's action selection strategy called stepwise case-based reasoning (SCBR). In this paper an agent that roams in 3D synthetic world is called an SCBR agent. An SCBR agent is an entity that selects the next action based on previous interaction experience and on simulated vision. An SCBR agent's interaction experience is represented in the form of two different types of cases: plan cases and contextual cases.
Congestion control for bursty M2M traffic in LTE networks

In machine to machine (M2M) communication systems based on the Third Generation Partnership Project (3GPP) Long Term Evolution (LTE), the machine type communication (MTC) devices compete in a random access channel (RACH) to access the network. An MTC device randomly chooses a preamble from a pool of preambles and transmits it during the RACH. The evolved node B (eNodeB) acknowledges the successful reception of a preamble if that preamble is transmitted by only one device. To reduce the burstiness of the connection requests in heavy traffic situations, access class barring (ACB) is proposed in the 3GPP standard. Using ACB, an MTC device postpones its request in a RACH with a probability p. In this paper, we propose a new adaptive ACB scheme for congestion control of bursty M2M traffic. The optimal value of the ACB depends on the total number of MTC devices competing in a RACH. To estimate this number, we derive a joint conditional probability distribution function (PDF) for the number of preambles selected by zero or one MTC device, conditioned on the number of MTC devices that passed the ACB check. We design a maximum likelihood estimator using this PDF. We use this estimation to dynamically adjust the ACB factor. To further improve our estimation, we use Kalman filtering based on the dynamics of the system. Numerical results show that the total service time for the proposed method is very close to the optimal case where the information of the number of MTC devices is given.
Network-power-saving resource allocation algorithm with hybrid communication mode for OFDMA relay networks

Network power minimization problem is considered for orthogonal frequency-division multiple access (OFDMA) relay systems. To devise a simple algorithm, we introduce a new cost that is an inverse-of-required-minimum power for a target rate. Using the new cost, we propose a greedy-search-based subchannel resource allocation algorithm with a communication mode selection and relay processing adaptation. The communication mode selection allows each user to employ multiple (hybrid) modes with direct, amplify-and-forward (AF), and decode-and-forward (DF) communications, and the relay processing adaptation controls relay transmit power, so that network power consumption can be significantly reduced as verified in simulation.
Saddle vertex graph (SVG)

This paper presents the Saddle Vertex Graph (SVG), a novel solution to the discrete geodesic problem. The SVG is a sparse undirected graph that encodes complete geodesic distance information: a geodesic path on the mesh is equivalent to a shortest path on the SVG, which can be solved efficiently using the shortest path algorithm (e.g., Dijkstra algorithm). The SVG method solves the discrete geodesic problem from a local perspective. We have observed that the polyhedral surface has some interesting and unique properties, such as the fact that the discrete geodesic exhibits a strong local structure, which is not available on the smooth surfaces. The richer the details and complicated geometry of the mesh, the stronger such local structure will be. Taking advantage of the local nature, the SVG algorithm breaks down the discrete geodesic problem into significantly smaller sub-problems, and elegantly enables information reuse. It does not require any numerical solver, and is numerically stable and insensitive to the mesh resolution and tessellation. Users can intuitively specify a model-independent parameter K, which effectively balances the SVG complexity and the accuracy of the computed geodesic distance. More importantly, the computed distance is guaranteed to be a metric. The experimental results on real-world models demonstrate significant improvement to the existing approximate geodesic methods in terms of both performance and accuracy.
An Interactive Tile-Based Modeling Interface

This paper presents a novel modeling interface and method that uses two-dimensional (2D) data. In general, 2D computer graphics are most commonly used to depict 2D structures. However, many computer games often depict three-dimensional (3D) structures using 2D computer graphics. We dene such an expression as an overhead view. Although an overhead view has no 3D structure, we can perceive an ambiguous 3D structure from it. In this study, we dene shape perception rules from the overhead view and propose a novel modeling system using it. We also propose a tile-based interface as a prototype system that can create a 3D shape from an overhead view and can seamlessly convert an overhead view into a 3D view. In addition, we conduct a psychological experiment by means of which we conrmed our system is highly intuitive and can quickly create 3D models.
Liberalism's Order/Liberalism's other: A Genealogy of Threat

Who are the greatest myth makers of the twentieth century? Three times in this century, liberal states and societies in the West told the story of their heroic victory over forces of evil threatening to plunge the entire world into misery and slavery. But not being satisfied merely with the glory of a war hero, liberal states and societies went on to tell the story of their struggle as global peacemakers and world builders. The years 1919, 1945, and 1990 were weighty times when the fate of the world as it was and as it would be fell onto the shoulders of libera1 heroes whose mettle would not falter at having to be, as Dean Acheson put it, “present at the creation. ”’ The mythic dimensions of the story of the victory of the free world over communism is now all too familiar to us-but so is the story of the virtues of the liberal West. * It is this myth of the virtuous victor Over communism that I want to call to account. That is, I want to interrogate the notion that forty years of Cold War were an unavoidable consequence of power balancing in the face of a threatening totalitarian empire, and that Western liberalism itself as a social form remains eminently attractive despite its many historic failures and mistakes (e.g., Vietnam and Guatemala) steinming from its overzealOusness and its greed due to its grounding in capitalism.s Although today the shining veneer of liberalism has surely dulled since its heady days in the early years of this decade, its hold as a historical modality, a way of life and being, remains intact. It may be dull but it is thought by many in the West and elsewhere to be the best way we #
ARC6 Is a J-Domain Plastid Division Protein and an Evolutionary Descendant of the Cyanobacterial Cell Division Protein Ftn2 Online version contains Web-only data. Article, publication date, and citation information can be found at www.plantcell.org/cgi/doi/10.1105/tpc.013292.

Replication of chloroplasts is essential for achieving and maintaining optimal plastid numbers in plant cells. The plastid division machinery contains components of both endosymbiotic and host cell origin, but little is known about the regulation and molecular mechanisms that govern the division process. The Arabidopsis mutant arc6 is defective in plastid division, and its leaf mesophyll cells contain only one or two grossly enlarged chloroplasts. We show here that arc6 chloroplasts also exhibit abnormal localization of the key plastid division proteins FtsZ1 and FtsZ2. Whereas in wild-type plants, the FtsZ proteins assemble into a ring at the plastid division site, chloroplasts in the arc6 mutant contain numerous short, disorganized FtsZ filament fragments. We identified the mutation in arc6 and show that the ARC6 gene encodes a chloroplast-targeted DnaJ-like protein localized to the plastid envelope membrane. An ARC6–green fluorescent protein fusion protein was localized to a ring at the center of the chloroplasts and rescued the chloroplast division defect in the arc6 mutant. The ARC6 gene product is related closely to Ftn2, a prokaryotic cell division protein unique to cyanobacteria. Based on the FtsZ filament morphology observed in the arc6 mutant and in plants that overexpress ARC6, we hypothesize that ARC6 functions in the assembly and/or stabilization of the plastid-dividing FtsZ ring. We also analyzed FtsZ localization patterns in transgenic plants in which plastid division was blocked by altered expression of the division site–determining factor AtMinD. Our results indicate that MinD and ARC6 act in opposite directions: ARC6 promotes and MinD inhibits FtsZ filament formation in the chloroplast.
Oo-line Reasoning for On-line Eeciency: Knowledge Bases

The complexity of reasoning is a fundamental issue in AI. In many cases, the fact that an intelligent system needs to perform reasoning on-line contributes to the diiculty of this reasoning. This paper considers the case in which an intelligent system computes whether a query is entailed by the system's knowledge base. It investigates how an initial phase of oo-line preprocessing and design can improve the on-line complexity considerably. The notion of an eecient basis for a query language is presented, and it is shown that oo-line prepro-cessing can be very eeective for query languages that have an eecient basis. The usefulness of this notion is illustrated by showing that a fairly expressive language has an eecient basis. A dual notion of an eecient disjunctive basis for a knowledge base is introduced, and it is shown that oo-line preprocessing is worthwhile for knowledge bases that have an eecient disjunctive basis.
A weighted semantic feature expansion using hyponymy tree for feature integration in sentiment analysis

It is necessary that sophisticated opinion extraction methods to be used, since ordinary keyword search does not suit for mining varied opinions. Assessment, proposed emotional correspondence or compelling state are might be his or her assessment is attitude. Classifying polarity of an unstructured document text in terms of positive, negative, or neutral polarities is the task of sentiment analysis. This paper proposes semantic based feature integration for feature extraction. Experiments were undertaken with different features.
An Improved Reverse Pinsker Inequality for Probability Distributions on a Finite Set

A new upper bound on the relative entropy is derived as a function of the total variation distance for arbitrary probability distributions that are defined on a common finite set. The bound improves a previously reported bound by Csisz\'{a}r and Talata. It is further extended, for probability distributions on a finite set, to a derivation of an upper bound on the R\'{e}nyi divergence of an arbitrary non-negative order (including $\infty$) as a function of the total variation distance. An extended version of this paper, which also includes reverse Pinsker inequalities for general probability measures and further results and discussions, is available at this http URL
MPEG-4 and H.263 video traces for network performance evaluation

MPEG-4 and H.263 encoded video is expected to account for a large portion of the traffic in future wireline and wireless networks. However, due to a lack of sufficiently long frame size traces of MPEG-4 and H.263 encoded videos, most network performance evaluations currently use MPEG-1 encodings. We present and study a publicly available library of frame size traces of long MPEG-4 and H.263 encoded videos, which we have generated at the Technical University Berlin. The frame size traces have been generated from MPEG-4 and H.263 encodings of over 10 video sequences each 60 minutes long. We conduct a thorough statistical analysis of the traces.
Efficient priority assignment policies for distributed real-time database systems

A lot of research works have been done in this filed of real-time database systems to seek for optimizing transaction scheduling. The findings of such studies examining the use of various algorithms of priority assignment policy have been discussed widely. One drawback of these approaches is presenting poor performance due to neglect repetitively missed real-time transactions. In this paper, an improved priority assignment policy named Flexible High Reward with concurrency control factor (FHR-CF) is proposed to reduce the MissRatio and WastedRatio.
Efficient gamut clipping for color image processing using LHS and YIQ

Out-of-gamut problems exist in color image processing and color reproduction in different devices. Extensive research has been done on transforming out-of-gamut colors to the inside of the output device's color gamut for color reproduction. We focus on the out-of- gamut problem in color image processing. Luminance, hue, and satura- tion (LHS) and YIQ color coordinate systems are investigated. Efficient techniques for luminance and saturation processing and gamut clippings are presented. The efficient technique of luminance clipping for LHS is developed based on scaling, and the efficient technique of luminance clipping for YIQ is developed based on shifting. However, the efficient technique of saturation clipping for both LHS and YIQ is a combination of scaling and shifting. Such efficient techniques reduce the complexity of forward and backward transformations between the color representing the color coordinate system (RGB) and the processing color coordinate system (LHS or YIQ) significantly. Illustrations show the result of RGB, luminance, and saturation clippings. Saturation clipping is the best in terms of maintaining the hue and contrast of the original image. Experi- ments are also conducted to measure the efficiency of the proposed efficient techniques. It shows that the processing time is reduced by 27% comparing with the conventional technique using forward and backward color transformations. © 2003 Society of Photo-Optical Instrumentation Engineers.
Should a High School Adopt Advanced Placement or a Concurrent Enrollment Program An Expected Benefit Approach

This article provides an explicit framework for evaluating the expected benefit to college-bound students of courses offered by Advanced Placement (AP) versus concurrent enrollment programs (CEP). District personnel can use it to assess the relative merits of these programs, given the characteristics of their students, in deciding which model to implement or maintain. Simulations reveal that CEP generally provides a higher expected benefit for districts where students who take the course attend private colleges or universities (including public institutions out of state) and perform on the AP exam around national norms. AP favors high schools where students taking the course either face inexpensive costs for study at institutions of higher education or perform exceptionally well on the AP exam. Information from a sample of 240 colleges and universities reveals that few explicitly reject AP or CEP for credit if the student meets a minimum criterion, although more information is provided for AP.
Runway to Realway: Visual Analysis of Fashion

Clothing and fashion are an integral part of our everyday lives. In this paper we present an approach to studying fashion both on the runway and in more real-world settings, computationally, and at large scale, using computer vision. Our contributions include collecting a new runway dataset, designing features suitable for capturing outfit appearance, collecting human judgments of outfit similarity, and learning similarity functions on the features to mimic those judgments. We provide both intrinsic and extrinsic evaluations of our learned models to assess performance on outfit similarity prediction as well as season, year, and brand estimation. An example application tracks visual trends as runway fashions filter down to "real way" street fashions.
Urinary Schistosomiasis in Urban and Semi-Urban Communities in South-Eastern Nigeria

Background In view of the massive rural-to-urban migration in Nigeria, investigations on transmission of urinary schistosomiasis were carried out in urban and semi-urban communities in Nike Lake area of Enugu State, Nigeria. Methods Urine samples of school children were tested for micro-haematuria using reagent strips followed by microscopic examination for Schistosoma haematobium eggs. Water contact sites were also identified and sampled for snails. Results The overall prevalence of S. haematobium eggs in school children was 4.64%. The mean intensity of infection was 1.14 ± 0.41 eggs/10ml urine. Males had insignificantly higher prevalence and intensity of S. haematobium infection than females. The youngest age group (4-7 years) had no infection. The prevalence of micro-haematuria (6.2%) was higher than that of microscopy, and this correlated positively with prevalence (r = 0.65, P < 0.01) and intensity (r = 0.50, P < 0.01) of the infection. Potential intermediate host of human shistosome collected were: Bulinus globosus, B. senegalensis and Biomphalaria pfeifferi. However, only B. globosus shed cercariae of S. haematobium, with a snail infection rate of 0.73%. Transmission was in the dry season coinciding with the drying of wells. Conclusion The results revealed that urinary schistosomiasis is prevalent, and that B. globosus and not B. truncatus as previously reported is the main intermediate host of urinary schistosomiasis in this part of Enugu State.