Miracle-dz/UniFAR-FTUs huggingface dataset:
Codes over M2(F2) and applications to Golden space-time coded modulation

In this paper, we study code constructions over the finite ring M<inf>2</inf>(F<inf>2</inf>), the ring of 2×2 matrices with coefficients in the finite field F<inf>2</inf>. We show how they can be related to classical codes over F<inf>4</inf>. We provide as application the design of outer codes for 2 × 2 space-time coded modulation, when the inner code is the so-called Golden code.
Many Can Work Better than the Best: Diagnosing with Medical Images via Crowdsourcing

We study a crowdsourcing-based diagnosis algorithm, which is against the fact that currently we do not lack medical staff, but high level experts. Our approach is to make use of the general practitioners’ efforts: For every patient whose illness cannot be judged definitely, we arrange for them to be diagnosed multiple times by different doctors, and we collect the all diagnosis results to derive the final judgement. Our inference model is based on the statistical consistency of the diagnosis data. To evaluate the proposed model, we conduct experiments on both the synthetic and real data; the results show that it outperforms the benchmarks.
A new routing algorithm for micro-mobility by using core node

In order to provide fast handover, lots of micro-mobility protocols have been designed and proposed. However, they may cause excessive signal traffic and long latency for handover management. This paper proposes a new routing algorithm for micro-mobility scheme using core node. Core node handles routing information for a mobile host. It does not need to generate unnecessary control messages at each base station and wired node. We have conducted distribution of traffic as messages which create at the old BS and then disappears at the core node for maintenance of the routing table. We have evaluated the performance of our micro-mobility scheme through a series of simulations using the network simulator 2 (ns-2).
Logic as a distributive law

We present an algorithm for deriving a spatial-behavioral type system from a formal presentation of a computational calculus. Given a 2-monad $\Calc\maps \Cat \to \Cat$ for the free calculus on a category of terms and rewrites and a 2-monad BoolAlg for the free Boolean algebra on a category, we get a 2-monad Form = BoolAlg + Calc for the free category of formulae and proofs. We also get the 2-monad $\BoolAlg \circ \Calc$ for subsets of terms. The interpretation of formulae is a natural transformation $\interp{-} \maps \Form \Rightarrow \BoolAlg \circ \Calc$ defined by the units and multiplications of the monads and a distributive law transformation $\delta\maps \Calc \circ \BoolAlg \Rightarrow \BoolAlg \circ \Calc. $ This interpretation is consistent both with the Curry-Howard isomorphism and with realizability. We give an implementation of the "possibly" modal operator parametrized by a two-hole term context and show that, surprisingly, the arrow type constructor in the $\lambda$-calculus is a specific case. We also exhibit nontrivial formulae encoding confinement and liveness properties for a reflective higher-order variant of the $\pi$-calculus.
Testing Software Design Modeled by Finite-State Machines

We propose a method of testing the correctness of control structures that can be modeled by a finite-state machine. Test results derived from the design are evaluated against the specification. No "executable" prototype is required. The method is based on a result in automata theory and can be applied to software testing. Its error-detecting capability is compared with that of other approaches. Application experience is summarized.
Inference in Computational Semantics

The first workshop on Inference in Computational Semantics (ICoS-1) was held at the Institute for Logic, Language and Computation of the University of Amsterdam, on August 15, 1999. It was aimed at bringing together researchers from scientific disciplines to discuss approaches and applications of inference in natural language semantics, ranging from theoretical to implementational issues. In particular, ICoS-1 featured three invited presentations, six contributed talks, and six system demonstrations showing how inference tools are used in natural language applications. The variety of the program was also mirrored by the spectrum of contributing authors, which included researchers from Computational Linguistics, Artificial Intelligence, Computer Science, and Logic. This special issue is derived from ICoS-1. In it we bring together nearly all of the papers presented at the workshop, as well as short descriptions of the systems that were demonstrated at ICoS-1. Before giving a brief description of the contributions, we discuss some generalities.
The effect of ERP software interface design and cognitive function on performance of user learning

Enterprise Resource Planning (ERP) system has already become more and more important in recent years. Lots of people seem very unfamiliar to operation the software. For investigates learners' satisfaction and behavioral intentions to measurement learning performance, this research present a conceptual model through Flow Theory, DeLone and McLean Model for understanding learners' satisfaction, behavioral intention of use the system and enhance learning performance. The purpose of this research, for understand ERP system, moreover, assess the cognitive function to apply learner's learning performance. We will design relevant questionnaires for data collected to survey relevance of our research model. This study should be of relevance to both researchers and practitioners alike, as a step towards a better understanding of ERP system, especially in the context of information system training.
Mean field network based QoS routing scheme in wireless mesh networks

Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, as an NPC problem, which is also a big challenge for wireless mesh networks. There are few methods, which can solve this problem effectively so far. In this paper, we propose a novel routing scheme based on mean field network (MFN/spl I.bar/RS) to solve this problem. This algorithm first uses a function of the wireless link's delay and capacity both of which are QoS parameters as the cost function, and then seeks to find a feasible path by mean field annealing. Because MFN/spl I.bar/RS uses a set of deterministic equations to replace the stochastic process in simulated annealing (SA), and uses saddle point approximation in the calculation of the stationary probability distribution at equilibrium, thus the convergence time is much less than the algorithm based on SA. Simulation results demonstrate that MFN/spl I.bar/RS is an effective algorithm and is very fit for wireless mesh networks where the topology may be changing constantly.
In Vivo Evolution of Butane Oxidation by Terminal Alkane Hydroxylases AlkB and CYP153A6

ABSTRACT Enzymes of the AlkB and CYP153 families catalyze the first step in the catabolism of medium-chain-length alkanes, selective oxidation of the alkane to the 1-alkanol, and enable their host organisms to utilize alkanes as carbon sources. Small, gaseous alkanes, however, are converted to alkanols by evolutionarily unrelated methane monooxygenases. Propane and butane can be oxidized by CYP enzymes engineered in the laboratory, but these produce predominantly the 2-alkanols. Here we report the in vivo-directed evolution of two medium-chain-length terminal alkane hydroxylases, the integral membrane di-iron enzyme AlkB from Pseudomonas putida GPo1 and the class II-type soluble CYP153A6 from Mycobacterium sp. strain HXN-1500, to enhance their activity on small alkanes. We established a P. putida evolution system that enables selection for terminal alkane hydroxylase activity and used it to select propane- and butane-oxidizing enzymes based on enhanced growth complementation of an adapted P. putida GPo12(pGEc47ΔB) strain. The resulting enzymes exhibited higher rates of 1-butanol production from butane and maintained their preference for terminal hydroxylation. This in vivo evolution system could be useful for directed evolution of enzymes that function efficiently to hydroxylate small alkanes in engineered hosts.
Hierarchical Voxel Block Hashing for Efficient Integration of Depth Images

Many modern 3D reconstruction methods accumulate information volumetrically using truncated signed distance functions. While this usually imposes a regular grid with fixed voxel size, not all parts of a scene necessarily need to be represented at the same level of detail. For example, a flat table needs less detail than a highly structured keyboard on it. We introduce a novel representation for the volumetric 3D data that uses hash functions rather than trees for accessing individual blocks of the scene, but which still provides different resolution levels. We show that our data structure provides efficient access and manipulation functions that can be very well parallelised, and also describe an automatic way of choosing appropriate resolutions for different parts of the scene. We embed the novel representation in a system for simultaneous localization and mapping from RGB-D imagery and also investigate the implications of the irregular grid on interpolation routines. Finally, we evaluate our system in experiments, demonstrating state-of-the-art representation accuracy at typical frame-rates around 100 Hz, along with 40% memory savings.
Digital image forgery detection using SIFT feature

There has been an extensive growth in the area of digital image processing. One of the main issues in the real world is to judge the authenticity of a given image. Nowadays it is very easy to tamper and forge digital image with the advancement of the powerful digital image processing software and easy availability of the tools. The most common form of image manipulation techniques is the region duplication also called as copymove forgery where a portion of the image is copied and paste to another portion in the same digital image. To investigate such forensic analysis, various techniques and method have been developed in the past literature. There has been an immense research of finding such tampered pixel blocks. This method cannot handle cases when the copied region is scaled or rotated to a new region. This paper proposes an efficient algorithm based on scale invariant feature transform (SIFT) with feature extraction which is invariant to translation, scale, noise and rotation. It comprises transformation of the input image to produce a standard representation and then detection of keypoint and feature descriptor is applied along with a matching over all the keypoints.
Symbolic Model of Perception in Dynamic 3D Environments

Abstract : Computational models of human cognition have been applied to many complex real-world tasks including air traffic control, human-computer interaction, learning arithmetic, traversing the World Wide Web, intelligent tutors, instrument-based flight, and vehicle driving. There are numerous additional applications for these computational models including integration with models of human motion, military simulation of enemy agents in virtual environment training, testing of new vehicle designs or machine interfaces, and analysis of cognitive components of tasks. However, most of these models exist in limited two-dimensional (2D) environments. In order to apply computational models to tasks in a dynamic three-dimensional world, extensions to current cognitive architectures must provide the capability for models to perceive, process, and act in the threedimensional environments. The current research will seek to extend the vision components of a cognitive architecture to support computational models capable of simulating human vision in a dynamic three-dimensional (3D) environment.
Effects of brain-computer interface-based functional electrical stimulation on balance and gait function in patients with stroke: preliminary results

[Purpose] The purpose of this study was to determine the effects of brain-computer interface (BCI)-based functional electrical stimulation (FES) on balance and gait function in patients with stroke. [Subjects] Subjects were randomly allocated to a BCI-FES group (n=5) and a FES group (n=5). [Methods] The BCI-FES group received ankle dorsiflexion training with FES according to a BCI-based program for 30 minutes per day for 5 days. The FES group received ankle dorsiflexion training with FES for the same duration. [Results] Following the intervention, the BCI-FES group showed significant differences in Timed Up and Go test value, cadence, and step length on the affected side. The FES group showed no significant differences after the intervention. However, there were no significant differences between the 2 groups after the intervention. [Conclusion] The results of this study suggest that BCI-based FES training is a more effective exercise for balance and gait function than FES training alone in patients with stroke.
Bilvideo-7: an MPEG-7- compatible video indexing and retrieval system

Early prototype multimedia database management systems used the query-by-example paradigm to respond to user queries. Users needed to formulate their queries by providing examples or sketches. The query-by-keyword paradigm, on the other hand, has emerged due to the desire to search multimedia content in terms of semantic concepts using keywords or sentences rather than low-level multimedia descriptors. After all, it's much easier to formulate some queries by using keywords. However, some queries are still easier to formulate by examples or sketches-for example, the trajectory of a moving object.
QoS aware collaborative communications with incentives in the downlink of cellular network: A matching approach

The demand for data rate is increasing exponentially in the cellular networks due to the emergence of more and more data-driven applications and smart-devices. Currently, these demands cannot be met by cellular networks with any single technology. As a consequence, Quality-of-service (QoS) needs to be sacrificed by some users. To provide guaranteed QoS to the users, researchers are considering massive MIMO, LTE-A, cooperative communications etc as the suitable candidate for the next generation cellular network. In this paper, we propose a collaborative communication mechanism with incentive for downlink in the cellular network for providing guaranteed QoS by utilizing multiple connectivity of the user's smart equipments. We formulate the problem as an optimization problem first and afterwards, we solve this problem with the help of matching theory. Simulation results are shown to represent performance of the technique.
A Case Study Towards Turkish Paraphrase Alignment

Paraphrasing is expressing the same semantic content using different linguistic means. Although previous work has addressed linguistic variations at different levels of language, paraphrasing in Turkish has not been yet thoroughly studied. This paper presents the first study towards Turkish paraphrase alignment. We perform an analysis of different types of paraphrases on a modest Turkish paraphrase corpus and present preliminary results on that analysis from different standpoints. We also explore the impact of human interpretation of paraphrasing on the alignment of paraphrase sentence pairs.
Integrating identification and perception: A case study of familiar and unfamiliar face processing

We are very familiar with certain objects; we can quickly recognize our cars, friends and collaborators despite heavy occlusion, unusual lighting, or extreme viewing angles. We can also determine if two very different views of a stranger are indeed of the same person. How can we recognize familiar objects quickly, while performing deliberate, perceptual inference on unfamiliar objects? We describe a model combining an identity classification network for familiar faces with an analysis by synthesis approach for unfamiliar faces to make rich inferences about any observed face. We additionally develop an online non-parametric clustering algorithm for recognition of repeatedly experienced unfamiliar faces, and show how new faces can become familiar by being consolidated into the identity recognition network. Finally, we show that this model predicts human behavior in viewpoint generalization and identity clustering tasks, and predicts processing time differences between familiar and unfamiliar faces.
Peroxynitrite Diminishes Myogenic Activity and Is Associated With Decreased Vascular Smooth Muscle F-Actin in Rat Posterior Cerebral Arteries

Background and Purpose— This study investigated the effect of peroxynitrite (ONOO−) on pressure-induced myogenic activity and vascular smooth muscle (VSM) actin of isolated posterior cerebral arteries (PCAs). Methods— Histochemical staining of nitrotyrosine (NT) was used to demonstrate the presence of ONOO− in the cerebrovasculature after 1 hour of middle cerebral artery occlusion with 30 minutes of reperfusion. To determine the effect of ONOO− on pressure-induced myogenic activity, third-order PCAs from nonischemic animals were isolated and mounted in an arteriograph chamber. Diameter in response to changes in pressure was determined in the absence and presence of ONOO− (10−8 to 10−4 mol/L). Filamentous actin (F-actin) and globular actin (G-actin) were quantified using confocal microscopy in PCAs with and without exposure to ONOO−. Results— NT staining of vascular cells was greater in ischemic brain versus sham animals (56±3% versus 35±3%; P<0.01). Addition of low concentrations of ONOO− (≤10−6 mol/L) to isolated PCAs caused constriction from 129±16 &mgr;m to 115±15 &mgr;m (P<0.01), whereas concentrations >10−6 mol/L caused dilation of spontaneous tone and loss of myogenic activity in the physiological range of 50 to 125 mm Hg, increasing diameter from 130±6 to 201±5 &mgr;m at 75 mm Hg (P<0.01). In addition, the diminished myogenic activity was associated with a 4.5-fold decrease in F-actin content of VSM and a 27% increase in G-actin content (P<0.01). Conclusions This study demonstrates that ONOO− affects the myogenic activity of cerebral arteries and causes F-actin depolymerization in VSM, a consequence that could promote vascular damage during reperfusion injury and further brain injury.
Prevalence of Major Depressive Disorder Among Spouses of Men Who Use Alcohol in a Rural Community in Central Sri Lanka

Aims: To estimate the prevalence of major depressive disorder (MDD) among spouses of men who use alcohol in two rural areas in Sri Lanka, and to examine whether the severity of alcohol-related problems (ARPs) in men and presence of alcohol-related domestic violence are associated with MDD among these women. Method: In a cross-sectional study, ARPs among men were assessed using Alcohol Use Disorders Identification Test (AUDIT) questionnaire filled in by men, and domestic violence and husbands' drinking pattern data obtained from the women. MDD among the women was ascertained using the Structured Clinical Interview for DSM–IV Disorders for major depression. Using logistic regression we examined whether age, past history of depression, different indices of ARPs and domestic violence were associated with current MDD among the women. Results: Point prevalence of MDD in the sample was 33.3% (95% CI: 25.93, 40.73%). Once adjusted for other factors, morning drinking of the spouse (odds ratio = 4.11, 95% CI: 1.25, 13.47; P = 0.019) and increasing age (odds ratio = 1.05, 95% CI: 1.01, 1.09; P = 0.003) significantly increased the odds of MDD. Being subjected to domestic violence/arguments also had a trend to be associated with MDD among women, but was not significant (odds ratio = 2.29, 95% CI: 0.95, 5.48; P = 0.062). Conclusion: The prevalence of MDD among spouses of men who use alcohol is markedly higher than that has been observed among Sri Lankan women in previous studies. The prevalence of MDD in women seems to increase when their husbands are morning drinkers, and with increasing age.
The Hypervelocity Star SDSS J090745.0+024507 Is Variable

We present high-precision photometry of the hypervelocity star SDSS J090745.0+024507 (hereafter HVS), which has a Galactic rest-frame radial velocity of v = 709 km s-1, and thus has likely been ejected from the supermassive black hole in the Galactic center. Our data were obtained on two nights using the MMT 6.5 m telescope and is supplemented by lower precision photometry obtained on four nights using the FLWO 1.2 m telescope. The high-precision photometry indicates that the HVS is a low-amplitude variable. Assuming a periodic, sinusoidal model for this variation, we obtain period P = 0.2-2 days and amplitude A = 2%-10%. Together with the known effective temperature of Teff ≃ 10,500 K (spectral type B9), this variability implies that the HVS is probably a MS star, since BHB stars do not appear to be variable. Thus, we resolve the previously reported twofold degeneracy in the luminosity and distance of the star. The variability, effective temperature, and possible periodicity of the HVS indicate that it likely belongs to the class of slowly pulsating B-type main-sequence stars. The HVS has a heliocentric distance of 71 kpc and an age of ≲0.35 Gyr. The time of ejection from the center of the Galaxy is ≤100 Myr, and thus the existence of the HVS constitutes observational evidence of a population of young stars in the proximity of the central supermassive black hole ~0.1 Gyr ago. It is possible that the HVS was a member of a binary that was tidally disrupted by the central black hole; we discuss constraints on the properties of the companion's orbit.
A Hybrid Model for Emergence of Skilled Agent Specialization with Continuous Demand

paper, we study the effect of demand on specialization of skilled agents by modifying the earlier hybrid model which is based on the well-known Genetic Threshold Model (GTM) and Social Inhibition Model (SIM). We improve the agent specialization or division of labor (DOL) and also the quality of work (QOW) by introducing a new concept of varying the demand on a smooth curve and compare our results with the previous models.
Authentication of Digital Streams

We study the multicast stream authentication problem when the communication channel is under control of an opponent who can drop, reorder and inject data packets. Recently, many coding theory based protocols have been developed to treat the stream authentication problem over such a channel. In this paper, our goal is to provide a general coding approach for multicast stream authentication. We design an authentication protocol which combines any list recoverable code (provided some conditions on its construction parameters). We demonstrate that the previous schemes can be viewed as instances of our construction when a Reed-Solomon code is used as a list recoverable code. In such settings, we also show that our approach leads to a better upper bound on the number of signature verification queries for each receiver.
Particle Swarm Optimization with cognitive avoidance component

This paper introduces cognitive avoidance scheme to the Particle Swarm Optimization algorithm. Random movements of particle influenced by personal best solution and global best solution may encourage to take an unfruitful move. This may delay in convergence towards the optimal solution. With the similar notion as particle's own known best position attracts towards it (cognitive attraction), particle may avoid itself from taking moves around its own known worst position (cognitive avoidance). This concept is added to the standard Particle Swarm Optimization algorithm as cognitive avoidance component with an additional coefficient. Experimental results on well known benchmark functions shows considerable improvement in proposed approach.