Miracle-dz/UniFAR-FTUs huggingface dataset:
Technologies and Architectures for Multimedia-Support in Wireless Sensor Network

Wireless Sensor Networks (WSNs) are an emerging technology in the area of sensory and distributed computing. A WSN consists of many, theoretically up to some thousand or even millions of sensor nodes. A sensor node is generally defined as a cheap and small piece of hardware, which consists of four main units: • One or more sensors that detect physical phenomena. Common sensors monitor scalar values of temperature, pressure, humidity, light intensity, etc. • The sensor is coupled with a data processing unit. The latter controls sensing, application logic and network transfer. It receives data from the sensors as well as it can filter (e.g. thresholding), compress or correlate data from a series of measurement. The network structure, the communication process and the power management of the node are also organized by the processing unit. • The data’s wireless transmission is provided by a communication interface. Most nodes’ transfer is usually based on the IEEE 802.15. 4 standard because of the low power consumption of this transfer technology and the availability of low cost radios. • For every operational electronic system an energy source is needed. Although significant progress has been achieved in the area of energy harvesting, today’s standard power supply for sensor nodes is still the battery. Generally sensor nodes are designed to be widely spread without pre-configuration. A sink, also called a base station, is normally an embedded or a personal computer which is configured to collect, save or react according to the data. The network between the nodes and the sink is built dynamically and is considered to be self-organizing.
th International Meshing Roundtable ( IMR 24 ) An Experimental Comparison of Algorithms for Converting Triangulations of Closed Surfaces into Quadrangulations

We perform an experimental comparison of four algorithms for converting a given triangulation T of an orientable, connected, boundaryless, and compact surface S in E into a quadrangulation Q of S. All algorithms compute Q by first pairing edge-adjacent triangles of T (of another triangulation of S with the same vertex set) so that every triangle belongs to exactly one pair. Such a perfect pairing is guaranteed for triangulations of boundaryless and compact surfaces (also known as closed surfaces). The common edge of each pair of matched triangles is then removed to give rise to a quadrilateral of Q. We implemented two greedy algorithms, a graph matching algorithm, and a new algorithm presented in this paper, which uses edge contractions and vertex splittings to compute a quadrangulation of the surface in two steps by combining pairings with edge flips. If T has positive genus g, the new algorithm takes O(gn f + g) amortized time to compute a quadrangulation with the same vertex set, where n f is the number of triangles of the triangulation; otherwise (i.e., if the genus is zero), it takes O(n f ) amortized time. We verify that if n f is large and g ≪ n f (which is typically the case in several applications), then our new algorithm performs better than the other three. However, if n f is not large enough or g is large (relative to n f ), then a fast and simple greedy algorithm, when combined with an effective heuristic to pair up edge-adjacent triangles, is the best option among the four algorithms. c © 2015 The Authors. Published by Elsevier Ltd. Peer-review under responsibility of organizing committee of the 24 International Meshing Roundtable (IMR24).
Fear of criminal victimization in a reputedly violent environment

Using survey data the study estimates the prevalence, level of intensity, and broad patterns associated with the fear of criminal victimization in an environment that is characterized by high levels of ordinary criminal vio lence. Some of the findings are common to other countries while others may be specific to a setting in which there is a high level of social violence. These latter include a risk-worry paradox where subjective evaluations of the risk of victimization are incongruent with levels of worry about vic timization. The article suggests that there is a pattern of "irrationality" in the responses to crime in Jamaica that is conditioned by the real as well as vicarious victimization of the population, and that this pattern of irration ality reflects a projection of the general insecurities about the society on to crime. Crime has become emblematic of the dangers facing the society. Since the decade of the 1970s, Jamaica has experienced high and increasing rates of violent crime. Between 1977 and 2000, the rate of violent crime has increased from 254.6 incidents per 100,000 citi zens to 633.4/100,000, and the murder rate from 19.2/100,000 to 39/ 100,000.a During this period, there were some 14,512 reported mur ders in Jamaica, a country with a population of some 2.5 million (in 2000). Given the high density and long duration of this violence, understandably, the Jamaican population has been gripped by a high level of anxiety and fear of criminal victimization. Fear of criminal victimization is an effect of crime. However, in conditions of national economic vulnerability, massive indebted ness, a highly competitive media environment, and a small society, 1 See Economic and Social Survey of Jamaica (1998; 1988; 1978) for the respective years.
Isometric Relaxation of Rat Myocardium atEnd‐Systolic Fiber Length

In a ‘physiologically sequenced’ contraction (PSC), which loads the isolated muscle preparation in a manner which approximates that of the intact heart, isometric relaxation precedes isotonic relaxation and occurs at minimum (‘end-systolic’) length. We studied the effects of initial muscle length, load, temperature, calcium, and isoproterenol on the isometric relaxation phase of physiologically sequenced contractions to define the determinants of the rate of isometric relaxation of rat left ventricular myocardium. At the baseline temperature (28 °C), relaxation was found to be nonexponential, and the maximum rate of decline of force (-dF/dtma,) was used to evaluate changes in relaxation. Three factors, shortening, end-systolic length, and total load, were examined as possible mechanical determinants of −dF/dtmax. We found that −dF/dtmax is linearly related to end-systolic muscle length for lengths below 94% of L--,x; −dF/dtmax is also strongly related to total load for lightly loaded contractions, but peaks at loads of approximately 80% of peak developed force and declines thereafter. Shortening is poorly correlated with −dF/dtmax. The slope of the linear portion of the relation between −dF/dtma′ and end-systolic length appears to be independent of muscle-loading conditions, and sensitive to factors known to alter relaxation.
Estimate of finite-time domain of attraction for a class of nonlinear Hamiltonian systems with time delay

This paper investigates the finite-time stability (FTS) and the estimate of finite-time domain of attraction for a class of nonlinear time-delay Hamiltonian systems via Lyapunov-Krasovskii (L-K) functional method, and proposes some delay-dependent results on the issues. Firstly, a time-varying criterion on the FTS is proposed for general nonlinear time-delay systems via L-K functional approach. Then, based on the criterion, a delay-dependent condition on the FTS is derived for the nonlinear time-delay Hamiltonian systems by constructing a specific L-K functional. Thirdly, we use the obtained FTS result to investigate the estimate of finite-time domain of attraction problem, and present an estimate result for the Hamiltonian systems. Finally, the study of an illustrative example shows that the results obtained in this paper work very well in the estimate of finite-time domain of attraction of some nonlinear time-delay (Hamiltonian) systems.
A Probabilistic Hierarchical Approach for Pattern Discovery in Collaborative Filtering Data (Extended Abstract)

This paper presents a hierarchical probabilistic approach to collaborative filtering which allows the discovery and analysis of both global patterns (i.e., tendency of some products of being ‘universally appreciated’) and local patterns ( tendency of users within a community to express a common preference on the same group of items). We reformulate the collaborative filtering approach as a clustering problem in a high-dimensional setting, and propose a probabilistic approach to model the data. The core of our approach is a co-clustering strategy, arranged in a hierarchical fashion: first, user communities are discovered, and then the information provided by each user community is used to discover topics, grouping items into categories. The resulting probabilistic framework can be used for detecting interesting relationships between users and items within user communities. The experimental evaluation shows that the proposed model achieves a competitive prediction accuracy with respect to the state-of-art collaborative filtering approaches.
A Qualitative Model of Gradient Flow in a Spatially Distributed Parameter

This paper presents a qualitative common-sense model of gradient flow processes caused by concentration differences in a distributed parameter. A physical system is modelled by the spatial distributions of its parameters . Space is discretized into a pattern of regions according to the landmark values in the quantity space of each parameter. Gradient flow processes occur between adjacent regions with different values and create new regions of intermediate value that grow at the expense of the source and sink regions. The spatial and temporal evolution of the system depends on the relative sizes of the regions and the speeds of the flow processes. Ambiguities arise because shape information is not required . However, a plausible least complex evolution can be generated based on shapeinvariant inferences and assumptions. An example of aqualitative simulation of heat flow processes is given.
Randomized sketches of convex programs with sharp guarantees

Random projection (RP) is a classical technique for reducing storage and computational costs. We analyze RP-based approximations of convex programs, in which the original optimization problem is approximated by the solution of a lower-dimensional problem. Such dimensionality reduction is essential in computation and memory limited settings, since the complexity of general convex programming can be quite high (e.g., cubic for quadratic programs, and substantially higher for semidefinite programs). We prove that the approximation ratio of this procedure can be bounded in terms of the geometry of constraint set. When using Gaussian random projections, the data matrix defining the cost function can be projected down to the statistical dimension of the tangent cone of the constraints at the original solution, which is often substantially smaller than the original dimension. We illustrate consequences of our theory for various cases, including unconstrained and ℓ1-constrained least squares, support vector machines and discuss connections with denoising and compressed sensing.
Segregating feature interfaces to support software product line maintenance

Although software product lines are widely used in practice, their maintenance is challenging. Features as units of behaviour can be heavily scattered across the source code of a product line, hindering modular reasoning. To alleviate this problem, feature interfaces aim at enhancing modular reasoning about features. However, considering all members of a feature interface is often cumbersome, especially due to the large number of members arising in practice. To address this problem, we present an approach to group members of a feature interface based on their mutual dependencies. We argue that often only a subset of all interface members is relevant to a maintenance task. Therefore, we propose a graph representation that is able to capture the collaboration between members and apply a clustering algorithm to it to group highly-related members and segregate non-related members. On a set of ten versions of a real-world product line, we evaluate the effectiveness of our approach, by comparing the two types of feature interfaces (segregated vs. original interfaces) with co-change information from the version-control system. We found a potential reduction of 62% of the interface members to be considered during maintenance. This way, the effort to reason about features can be reduced.
An Intracranial Electroencephalography (iEEG) Brain Function Mapping Tool with an Application to Epilepsy Surgery Evaluation

Objects: Before epilepsy surgeries, intracranial electroencephalography (iEEG) is often employed in function mapping and epileptogenic foci localization. Although the implanted electrodes provide crucial information for epileptogenic zone resection, a convenient clinical tool for electrode position registration and Brain Function Mapping (BFM) visualization is still lacking. In this study, we developed a BFM Tool, which facilitates electrode position registration and BFM visualization, with an application to epilepsy surgeries. Methods: The BFM Tool mainly utilizes electrode location registration and function mapping based on pre-defined brain models from other software. In addition, the electrode node and mapping properties, such as the node size/color, edge color/thickness, mapping method, can be adjusted easily using the setting panel. Moreover, users may manually import/export location and connectivity data to generate figures for further application. The role of this software is demonstrated by a clinical study of language area localization. Results: The BFM Tool helps clinical doctors and researchers visualize implanted electrodes and brain functions in an easy, quick and flexible manner. Conclusions: Our tool provides convenient electrode registration, easy brain function visualization, and has good performance. It is clinical-oriented and is easy to deploy and use. The BFM tool is suitable for epilepsy and other clinical iEEG applications.
Location Estimation of Wireless Nodes with Preservation of Neighbor Relations in MANET

Acquisition methods of locations of mobile wireless nodes in wireless multihop networks are required to be developed for location-dependent network applications. Espacially for indoor wireless networks, various location estimation methods without GPS devices has been proposed. However in most of the conventional methods, since location of each mobile wireless node is estimated independently of the others, neighbor relations among the nodes are not preserved in the set of their estimated locations. In addition, since multihop stationary wireless nodes whose locations have been determined are required, it is impossible for the conventional methods to be applied to MANETs (mobile ad-hoc networks). This paper proposes a novel location estimation method whose estimated locations preserve the neighbor relations among nodes by applying 2-step location estimation in which a sequence of wireless nodes is estimated based on the neighbor relations before locations are estimated and which does not require stationary wireless nodes by estimation of relative locations among the wireless nodes. The proposed method is now only adapted to 1-demensional MANETs such as slender and mesh types distribution of wireless nodes.
Searching the State Space: A Qualitative Study of API Protocol Usability

Application Programming Interfaces (APIs) often define protocols -- restrictions on the order of client calls to API methods. API protocols are common and difficult to use, which has generated tremendous research effort in alternative specification, implementation, and verification techniques. However, little is understood about the barriers programmers face when using these APIs, and therefore the research effort may be misdirected. To understand these barriers better, we perform a two-part qualitative study. First, we study developer forums to identify problems that developers have with protocols. Second, we perform a think-aloud observational study, in which we systematically observe professional programmers struggle with these same problems to get more detail on the nature of their struggles and how they use available resources. In our observations, programmer time was spent primarily on four types of searches of the protocol state space. These observations suggest protocol-targeted tools, languages, and verification techniques will be most effective if they enable programmers to efficiently perform state search.
From artificial cognitive systems and open architectures to cognitive manufacturing systems

Considering constantly increasing demand for shift from mass production to mass customization and the need to maintain high level of automation despite permanent changes in manufacturing technologies and tools new approaches and solutions have to be provided in manufacturing. Cyber-Physical Systems and Industrial Internet of Things are enabling smart manufacturing to tackle the challenge of data processing, integration and interpretation, but beyond uniformed data collection and visualization. The cognitive approach is argued to introduce brain and biologically-inspired algorithms capable to better adapt industrial systems for unforeseen conditions. Such approach should provide flexible and robust solution for manufacturing systems, enabling new level of adaptability and re-configurability in the system by self-X capabilities. In this paper contemporary solutions applicable for introduction of cognitive capabilities in manufacturing systems are studied and the architecture for cognitive manufacturing system employing benefits of Industrial Internet and Cognitive Control is proposed.
Disruption of the Rickettsia rickettsii Sca2 Autotransporter Inhibits Actin-Based Motility

ABSTRACT Rickettsii rickettsii, the etiologic agent of Rocky Mountain spotted fever, replicates within the cytosol of infected cells and uses actin-based motility to spread inter- and intracellularly. Although the ultrastructure of the actin tail and host proteins associated with it are distinct from those of Listeria or Shigella, comparatively little is known regarding the rickettsial proteins involved in its organization. Here, we have used random transposon mutagenesis of R. rickettsii to generate a small-plaque mutant that is defective in actin-based motility and does not spread directly from cell to cell as is characteristic of spotted fever group rickettsiae. The transposon insertion site of this mutant strain was within Sca2, a member of a family of large autotransporter proteins. Sca2 exhibits several features suggestive of its apparent role in actin-based motility. It displays an N-terminal secretory signal peptide, a C-terminal predicted autotransporter domain, up to four predicted Wasp homology 2 (WH2) domains, and two proline-rich domains, one with similarity to eukaryotic formins. In a guinea pig model of infection, the Sca2 mutant did not elicit fever, suggesting that Sca2 and actin-based motility are virulence factors of spotted fever group rickettsiae.
The Psychophysiology of Video Gaming: Phasic Emotional Responses to Game Events

The authors examined phasic psychophysiological responses indexing emotional valence and arousal to different game events during the video game Monkey Bowling 2. Event-related changes in skin conductance, cardiac interbeat intervals, and facial EMG activity over corrugator supercilii, zygomaticus major, and orbicularis oculi were recorded. Game events elicited reliable valence- and arousal-related phasic physiological responses. Not only putatively positive game events, but also putatively negative events that involved active participation by the player elicited positive emotional responses in terms of facial EMG activity. In contrast, passive reception of negative feedback elicited low-arousal negative affect. Information on emotion-related phasic physiological responses to game events or event patterns can be used to guide choices in game design in several ways.
Expanding Video Game Live-Streams with Enhanced Communication Channels: A Case Study

Live-streaming of video games is a recent phenomenon. One driving factor is the direct communication between the streamer and the audience. Currently, besides the platform-integrated options such as text chats, streamers often use external sources to let their community better articulate their opinions. In this paper we present a case study with our tool Helpstone, a live-streaming tool for the card game Hearthstone. Helpstone provides several new communication channels that allow for a better viewer-streamer interaction. We evaluated the tool within a live-streaming session with 23 viewers using Helpstone, and interviewed the streamer. The results indicate that not every implemented interactivity option is relevant. However, in general, new communication channels appear to be valuable and novel influence options are appreciated.
The independent relationship between triglycerides and coronary heart disease

Aims: The aim was to review epidemiologic studies to reassess whether serum levels of triglycerides should be considered independently of high-density lipoprotein-cholesterol (HDL-C) as a predictor of coronary heart disease (CHD). Methods and results: We systematically reviewed population-based cohort studies in which baseline serum levels of triglycerides and HDL-C were included as explanatory variables in multivariate analyses with the development of CHD (coronary events or coronary death) as dependent variable. A total of 32 unique reports describing 38 cohorts were included. The independent association between elevated triglycerides and risk of CHD was statistically significant in 16 of 30 populations without pre-existing CHD. Among populations with diabetes mellitus or pre-existing CHD, or the elderly, triglycerides were not significantly independently associated with CHD in any of 8 cohorts. Triglycerides and HDL-C were mutually exclusive predictors of coronary events in 12 of 20 analyses of patients without pre-existing CHD. Conclusions: Epidemiologic studies provide evidence of an association between triglycerides and the development of primary CHD independently of HDL-C. Evidence of an inverse relationship between triglycerides and HDL-C suggests that both should be considered in CHD risk estimation and as targets for intervention.
A new meta-module for controlling large sheets of ATRON modules

In this paper we present a 2D meta-module for the ATRON robot, which simplifies the motion constraints significantly. The motion capabilities of the new meta-module is similar to that of previous sliding cube style modules with the addition of one extra action, which is shown to improve the motion capabilities of the modules greatly. In general our work shows that if three simple actions, which is implemented by our proposed meta-module, is implemented by a self-reconfigurable robot module or meta-module then the control of the robot will be simple. The improved motion capabilities allow us to use offline planning for large groups consisting of hundreds of meta- modules. The simple motion constraints of the meta-module further allows us to implement a distributed cluster flow locomotion gait, with the interesting property that the group of meta-modules self-organizes into a shape that makes the locomotion efficient.