Miracle-dz/UniFAR-FTUs huggingface dataset:
Integrating prior knowledge in time series alignment: Prior Optimized Time Warping

In this paper, we propose Prior Optimized Time Warping (POTW) algorithm, which allows user to integrate prior knowledge by marking out pairs of matching sub-sequences from the sequences to be aligned. To relieve users of the task of guaranteeing the full accuracy of the marking, a certainty coefficient reflecting the certainty of the matching can also be specified for each marked pairs. POTW will then look for the best alignment based on the two sequences and the given matching pairs. POTW is an extension of existing align algorithm, and in the absence of prior knowledge, is able to independently find the best alignment of two sequences. We apply our algorithm to walk sequences from CMU motion capture database, as well as UJI pen characters dataset to demonstrate its ability to allow easy and effective integration of prior knowledge.
Model checking dataflow for malicious input

Many embedded systems today are no longer isolated control units, but are fully fledged miniature desktops with their own kernel and sometimes operating system networked with the outside world. This opens up a whole new set of security issues previously not known to embedded systems. One example is potentially malicious input that exploits source code weaknesses leading to critical mission failures. In this paper we propose a new automated malicious input detection approach that works on a staged application of traditional tainted dataflow analysis and syntactic software model checking. The advantages of this approach are that tainted data can be tracked from its source to its application point, a precise path through the source code can be computed, speed and precision can be custom-tuned by automated refinement, and the approach is flexible to deal with real-life security threats. We illustrate our approach with a number of analysis examples taken from existing open source C/C++ projects.
On-line Handwritten Japanese Characters Recognition Using a MRF Model with Parameter Optimization by CRF

This paper describes a Markov random field (MRF) model with weighting parameters optimized by conditional random field (CRF) for on-line recognition of handwritten Japanese characters. It also presents updated evaluation using a large testing set. The model extracts feature points along the pen-tip trace from pen-down to pen-up and sets each feature point from an input pattern as a site and each state from a character class as a label. It employs the coordinates of feature points as unary features and the differences in coordinates between the neighboring feature points as binary features. The weighting parameters are estimated by CRF or the minimum classification error (MCE) method. In experiments using the TUAT Kuchibue database, the method achieved a character recognition rate of 92.77%, which is higher than the previous model's rate, and the method of estimating the weighting parameters using CRF was more accurate than using MCE.
Quantifying the coexistence of massive black holes and dense nuclear star clusters

In large spheroidal stellar systems, such as elliptical galaxies, one invariably finds a 10 6 -10 9 M ⊙ supermassive black hole at their centre. In contrast, within dwarf elliptical galaxies one predominantly observes a 10 5_ 10 7 M ⊙ nuclear star cluster. To date, few galaxies have been found with both types of nuclei coexisting and even less have had the masses determined for both central components. Here, we identify one dozen galaxies housing nuclear star clusters and supermassive black holes whose masses have been measured. This doubles the known number of such hermaphrodite nuclei - which are expected to be fruitful sources of gravitational radiation. Over the host spheroid (stellar) mass range 10 8_ 10 11 M ⊙ , we find that a galaxy's nucleus-to-spheroid (baryon) mass ratio is not a constant value but decreases from a few per cent to ~0.3 per cent such that log[(M BH + M NC )/M sph ] = -(0.39 ± 0.07) Iog[M sph /10 10 M ⊙ ] ― (2.18 ± 0.07). Once dry merging commences and the nuclear star clusters disappear, this ratio is expected to become a constant value. As a byproduct of our investigation, we have found that the projected flux from resolved nuclear star clusters is well approximated with Sersic functions having a range of indices from ~0.5 to ~3, the latter index describing the Milky Way's nuclear star cluster.
Scaling of Soaring Seabirds and Implications for Flight Abilities of Giant Pterosaurs

The flight ability of animals is restricted by the scaling effects imposed by physical and physiological factors. In comparisons of the power available from muscle and the mechanical power required to fly, it is predicted that the margin between the powers should decrease with body size and that flying animals have a maximum body size. However, predicting the absolute value of this upper limit has proven difficult because wing morphology and flight styles varies among species. Albatrosses and petrels have long, narrow, aerodynamically efficient wings and are considered soaring birds. Here, using animal-borne accelerometers, we show that soaring seabirds have two modes of flapping frequencies under natural conditions: vigorous flapping during takeoff and sporadic flapping during cruising flight. In these species, high and low flapping frequencies were found to scale with body mass (mass −0.30 and mass −0.18) in a manner similar to the predictions from biomechanical flight models (mass −1/3 and mass −1/6). These scaling relationships predicted that the maximum limits on the body size of soaring animals are a body mass of 41 kg and a wingspan of 5.1 m. Albatross-like animals larger than the limit will not be able to flap fast enough to stay aloft under unfavourable wind conditions. Our result therefore casts doubt on the flying ability of large, extinct pterosaurs. The largest extant soarer, the wandering albatross, weighs about 12 kg, which might be a pragmatic limit to maintain a safety margin for sustainable flight and to survive in a variable environment.
Congestion Games and Potentials Reconsidered

In congestion games, players use facilities from a common pool. The benefit that a player derives from using a facility depends, possibly among other things, on the number of users of this facility. The paper gives an easy alternative proof of the isomorphism between exact potential games and the set of congestion games introduced by Rosenthal (1973). It clarifies the relations between existing models on congestion games, and studies a class of congestion games where the sets of Nash equilibria, strong Nash equilibria and potential-maximizing strategies coincide. Particular emphasis is on the computation of potential-maximizing strategies.
Differentiating Intended Sensory Outcome from Underlying Motor Actions in the Human Brain

To achieve a certain sensory outcome, multiple actions can be executed. For example, unlocking a door might require clockwise or counterclockwise key turns depending on regional norms. Using fMRI in healthy human subjects, we examined the neural networks that dissociate intended sensory outcome from underlying motor actions. Subjects controlled a figure on a computer screen by performing pen traces on an MR-compatible digital tablet. Our design allowed us to dissociate intended sensory outcome (moving the figure in a certain direction) from the underlying motor action (horizontal/vertical pen traces). Using multivoxel pattern analysis and a whole-brain searchlight strategy, we found that activity patterns in left (contralateral) motor and parietal cortex and also right (ipsilateral) motor cortex significantly discriminated direction of pen traces regardless of intended direction of figure movement. Conversely, activity patterns in right superior parietal lobule and premotor cortex, and also left frontopolar cortex, significantly discriminated intended direction of figure movement regardless of underlying direction of hand movement. Together, these results highlight the role of ipsilateral motor cortex in coding movement directions and point to a network of brain regions involved in high order representation of intended sensory outcome that is dissociated from specific motor plans.
All-Uses versus Mutation Testing : An ExperimentalComparison of E ectiveness

The eeectiveness of a test data adequacy criterion for a given program and spec-iication is the probability that a test set satisfying the criterion will expose a fault. Experiments were performed to compare the eeectiveness of the mutation testing and all-uses test data adequacy criteria at various coverage levels, for randomly generated test sets. Large numbers of test sets were generated and executed, and for each, the proportion of mutants killed or defuse associations covered was measured. This data was used to estimate and compare the eeec-tiveness of the criteria. The results were mixed: at the highest coverage levels considered, mutation was more eeective than all-uses for ve of the nine subjects, all-uses was more eeective than mutation for two subjects, and there was no clear winner for two subjects. However, mutation testing was much more expensive than all-uses. The relationship between coverage and eeectiveness for xed-sized test sets was also explored and was found to be non-linear and, in many cases, non-monotonic.
What Discretion for Socially Responsible Engagement Do Top Manager Have?Issues and Perspectives of Corporate Governance

From a socio-political perspective, this article examines the influence of corporate governance mechanisms at the organizational level on the engagement and discretion of top managers with regard to corporate social responsibility (CSR). An exploratory, empirical and qualitative study was conducted among 20 French top managers of listed companies, and our results highlight two main contributions. First, we identified three "types" of corporate governance system, each with a set of perceived consequences for the CSR engagement and discretion of these managers. Second, for each of the governance systems, we characterized the voluntary aspect the top managers’ engagement in and discretion for CSR. Our research provides new insights into how the motivations of both top managers and the most salient stakeholders in corporate governance codetermine CSR engagement. Top management discretion becomes redefined around a game of power and influence within the corporate governance system, which we describe. In 2001, the European Commission (EC) defined corporate social responsibility (CSR) as "a concept whereby companies integrate social and environmental concerns in their business operations and in their interaction with their stakeholders on a voluntary basis. " This definition focused mainly on the freedom of businesses to choose whether or not to include social and environmental issues in their strategies. Since then, the definition has changed and in 2011 the EC redefined CSR as "the responsibility of enterprises for their impacts on society,” which is the working definition we use in this research. It should be noted that the phrase "on a voluntary basis" has disappeared. Does this mean that CSR has become one more response to the institutionalized pressures and obligations imposed by stakeholders in our society, similar to the process that occurs in all organizations? (Campbell, 2007). In fact, the notion of “voluntary” engagement has not disappeared from the issues of CSR (Fernando & Sim, 2011), and even though certain pressures inevitably push businesses to take CSR into account, other pressures exert an opposite effect (Johnson & Greening, 1999). Moreover, in an increasingly complex and uncertain context (Mercier, 2004), companies today are dealing with so many pressures coming from so many directions that it is often quite difficult to identify them, never mind prioritize them for strategic decision making (Lee, 2011). Whatever the company environment and even when the movement toward M@n@gement 2014, vol. 17(4): 237-262
Multivariate EEG Analysis Reveals Neural Correlates for the Differential Perception of Chord Progressions

Exploring a listener’s mental representation of tonal hierarchy typically uses several classes of tones or chords embedded in a musical context. Owing to this complexity, a gap exists between behavioral methods, such as the probe tone technique, and physiological studies using electroencephalography (EEG) that commonly require averaging over many stimulus presentations and thus are typically limited in the number of experimental conditions. Here, we propose a novel method for multivariate classification-based EEG feature extraction enhancing EEG multiclass differentiation in the domain of music perception. In a show-case application, we (a) investigate how 13 listeners rate the perceived harmonic distance of 11 classes of chord changes in a continuous stimulus train of major triad chords, (b) apply the proposed method to aggregate typical change-related components of event-related potentials into a compact 11-valued neural profile, and (c) compare both with various change representations derived from music theory. Although the behavioral profiles varied interindividually, showing influences of tonal categories and/or pitch distance, the event-related potential-based neural profiles revealed a dominant influence of pitch distance in 8/13 participants. Thus, a task-driven behavioral rating (reflecting tonal categories) indicates that pitch-based neural representations can be overridden in some participants, whereas in others they could dominate and lead to task-deviant (pitch-based) ratings. In summary, we demonstrate that multivariate analysis methods can extend the scope of music perception-related EEG studies with respect to the number of stimulus conditions at the single-participant level complementing established behavioral methods.
Impact of anatomical and functional severity of coronary atherosclerotic plaques on the transmural perfusion gradient: a [15O]H2O PET study.

BACKGROUND Myocardial ischaemia occurs principally in the subendocardial layer, whereas conventional myocardial perfusion imaging provides no information on the transmural myocardial blood flow (MBF) distribution. Subendocardial perfusion measurements and quantification of the transmural perfusion gradient (TPG) could be more sensitive and specific for the detection of coronary artery disease (CAD). The current study aimed to determine the impact of lesion severity as assessed by the fractional flow reserve (FFR) on subendocardial perfusion and the TPG using [(15)O]H2O positron emission tomography (PET) imaging in patients evaluated for CAD. METHODS AND RESULTS Sixty-six patients with anginal chest pain were prospectively enrolled and underwent [(15)O]H2O myocardial perfusion PET imaging. Subsequently, invasive coronary angiography was performed and FFR obtained in all coronary arteries irrespective of the PET imaging results. Thirty (45%) patients were diagnosed with significant CAD (i.e. FFR ≤0.80), whereas on a per vessel analysis (n = 198), 53 (27%) displayed a positive FFR. Transmural hyperaemic MBF decreased significantly from 3.09 ± 1.16 to 1.67 ± 0.57 mL min(-1) g(-1) (P < 0.001) in non-ischaemic and ischaemic myocardium, respectively. The TPG decreased during hyperaemia when compared with baseline (1.20 ± 0.14 vs. 0.94 ± 0.17, P < 0.001), and was lower in arteries with a positive FFR (0.97 ± 0.16 vs. 0.88 ± 0.18, P < 0.01). A TPG threshold of 0.94 yielded an accuracy to detect CAD of 59%, which was inferior to transmural MBF with an optimal cutoff of 2.20 mL min(-1) g(-1) and an accuracy of 85% (P < 0.001). Diagnostic accuracy of subendocardial perfusion measurements was comparable with transmural MBF (83 vs. 85%, respectively, P = NS). CONCLUSION Cardiac [(15)O]H2O PET imaging is able to distinguish subendocardial from subepicardial perfusion in the myocardium of normal dimensions. Hyperaemic TPG is significantly lower in ischaemic myocardium. This technique can potentially be employed to study subendocardial perfusion impairment in more detail. However, the diagnostic accuracy of subendocardial hyperaemic perfusion and TPG appears to be limited compared with quantitative transmural MBF, warranting further study.
Adaptive Kalman filter with GLBP feature for low resolution face tracking

Face tracking is useful for many applications, such as video conferencing, gaming, surveillance, facial expression analysis, and animated avatars for web communication. A good face tracker should work stably and accurately for different illuminations and environments, persons, head motions and face expressions. To perform tracking in an illumination-insensitive feature space, called the gradient logarithm field (GLF) feature space and Gabor local binary pattern (GLBP). The GLF feature mainly depends on the intrinsic characteristics of a face and is only marginally affected by the lighting source. In addition, the GLF with GLBP feature is a global feature and does not depend on a specific face model, and thus is effective in tracking low-resolution faces. Fast accurate face tracking by using adaptive kalman filter, it’s reduce the abrupt error and detection time. The proposed method work well significant illumination changes and outperforms many state-ofthe-art tracking algorithms.
Hierarchical channel router

The channel routing problem is a special care of the wire routing problem when interconnections have to be performed within a rectangular strip having no obstructions, between terminals located on opposite sides of the rectangle. We present here a new channel routing algorithm, based on reduction of the problem to the case of a (2 x n) grid and on consistent utilization of a "divide and conquer" approach. For the current implementation of the algorithm, the running time is proportional to N x n x log (m), where N is the number of nets, n is the length of the channel (number of columns) and m is the width of the channel (number of tracks). Traditional technological restrictions are assumed, i.e. net terminals are located on vertical grid lines, two wiring layers are available for interconnections - one layer is used exclusively for vertical segments, another for horizontal and vias are introduced for each layer change. This algorithm consistently outperforms several known routers in quality of wiring. We tested the algorithm on several benchmark problems. One of them - Deutsch's "difficult example" - was routed with only 19 horizontal wiring tracks (the absolute minimum for this case), whereas all other known routers required 20 or more tracks.
Towards cheap, accurate polymorphism detection

Polymorphism, along with inheritance, is one of the most important features in object-oriented languages, but it is also one of the biggest obstacles to source code comprehension. Depending on the run-time type of the receiver of a message, any one of a number of possible methods may be invoked. Several algorithms for creating accurate call-graphs using static analysis already exist, however, they consume significant time and memory resources. We propose an approach that will combine static and dynamic analysis and yield the best possible precision with a minimal trade-off between used resources and accuracy.
Network-Constrained Multiperiod Auction for a Pool-Based Electricity Market

This paper presents a multiperiod electricity auction market tool that explicitly takes into account transmission congestion and losses as well as intertemporal operating constraints, such as start-up costs, ramp rates, and minimum up and down times that may be included in any generating unit's composite bid. This approach, which requires only existing mixed-integer linear solvers, provides the market operator with a valuable tool for scheduling participants in a competitive market where transparency, fairness, and confidentiality of participants' data are of paramount concem. Under this framework, only network data is of public domain; producers are not required to reveal corporate data, and they have more flexibility in specifying the structure of their composite bid. This paper demonstrates and illustrates through numerical studies using test systems that an efficient and fair competitive electricity market can be implemented taking into account network constraints and losses.
Kazuistika pacienta s Huntingtonovou chorobou

Kazuistika popisuje připad 59leteho pacienta s neuropsychiatrickým onemocněnim – Huntingtonovou chorobou projevujici se z pocatku předevsim přiznaky psychicke poruchy. Pacient byl dlouhodobě psychiatricky lecen ambulantně, a nakonec byl odeslan k hospitalizaci na Psychiatrickou kliniku pro podezřeni na obsedantně-kompulzivni poruchu. Během hospitalizace byl pacient řadně vysetřen neurologem. Take byla doplněna rodinna anamneza, ktera byla do te doby nejasna. Na zakladě těchto kroků bylo vysloveno podezřeni na Huntingtonovu chorobu. Pacient byl objednan na geneticke vysetřeni a předan do pece specializovane neurologicke ambulance, kde doslo k potvrzeni diagnozy.
Role of Web Mining Algorithms for Ranking Web Pages

The rate of the growth the web has been exponential in the past two decades. The advances that took place in the software and hardware particularly in the past decade are one of the vital factors for the advent growth of data on web. Web mining is application of data mining techniques to discover patterns from the web. Search engine is a software system/tool used to retrieve relevant data for a given query from the web. Page ranking algorithms play a chief role in the search engines. Hence the study of web mining, particularly search engines used in web mining has gained major interest amongst the researchers around the globe. This paper gives an overview of web mining and a distinctive survey of various web mining algorithms that are used in search engines for ranking web pages
The Emergence of Opinion Leaders in a Networked Online Community: A Dyadic Model with Time Dynamics and a Heuristic for Fast Estimation

We study the drivers of the emergence of opinion leaders in a networked community where users share information with each other. Our specific setting is that of Epinions.com, a website dedicated to user-generated product reviews. Epinions.com employs a novel mechanism in which every member of the community can include other members, whose reviews she trusts, in her “web of trust. ” This leads to the formation of a network of trust among reviewers with high in-degree individuals being the opinion leaders. Accordingly, we study the emergence of opinion leaders in this community using a network formation paradigm. We model network growth by using a dyad-level proportional hazard model with time-varying covariates. To estimate this model, we use Weighted Exogenous Sampling with Bayesian Inference (WESBI), a methodology that we develop for fast estimation of dyadic models on large network datasets. We find that, in the Epinions network, both the widely-studied “preferential attachment” effect based on the existing number of inlinks (i.e., a network-based property of a node) and the number and quality of reviews written (i.e., an intrinsic property of a node) are significant drivers of new incoming trust links to a reviewer (i.e., inlinks to a node). Interestingly, time is an important moderator of these effects — the number of recent reviews written has a stronger effect than the effect of the number of recent inlinks received on the current rate of attracting inlinks; however, the aggregate number of reviews written in the past has no effect, while the aggregate number of inlinks obtained in the past has a significant effect on the current rate of attracting inlinks. This leads to the novel and important implication that, in a network growth setting, intrinsic node characteristics are a stronger short-term driver of additional inlinks, while the preferential attachment effect has a smaller impact but it persists for a longer time. We discuss the managerial implications of our results for the design and organization of online review communities.The Online Technical Appendix for this paper is available at the following URL: http://ssrn.com/abstract=2206016