Miracle-dz/UniFAR-FTUs huggingface dataset:
Advanced Urban Transport: Automation Is on the Way

The automobile played a major part in the 20th century development of urban (now mostly suburban) organization and became fundamental to its operation. We must now think about a new form of urban transport to meet the 21st century's challenges. In Europe, several programs are looking at technologies based on automated transport over existing and possibly new road infrastructures. These transport systems require a hierarchical network with very-high-capacity links, along with medium- and low-capacity links, optimization, and demand control. The objective is to provide door-to-door transport to anyone (or anything) at any time but at different costs, depending on the modes used. CyberCars is one of several European projects that have begun developing these technologies. CyberCars are fully automated road vehicles
Hypothermia After Cardiac Arrest: Feasibility and Safety of an External Cooling Protocol

Background—No proven neuroprotective treatment exists for ischemic brain injury after cardiac arrest. Mild-to-moderate induced hypothermia (MIH) is effective in animal models. Methods and Results—A safety and feasibility trial was designed to evaluate mild-to-moderate induced hypothermia by use of external cooling blankets after cardiac arrest. Inclusion criteria were return of spontaneous circulation within 60 minutes of advanced cardiac life support, hypothermia initiated within 90 minutes, persistent coma, and lack of acute myocardial infarction or unstable dysrhythmia. Hypothermia to 33°C was maintained for 24 hours followed by passive rewarming. Nine patients were prospectively enrolled. Mean time from advanced cardiac life support to return of spontaneous circulation was 11 minutes (range 3 to 30); advanced cardiac life support to initiation of hypothermia was 78 minutes (range 40 to 109); achieving 33°C took 301 minutes (range 90 to 690). Three patients completely recovered, and 1 had partial neurological recovery. One patient developed unstable cardiac dysrhythmia. No other unexpected complications occurred. Conclusions—Mild-to-moderate induced hypothermia after cardiac arrest is feasible and safe. However, external cooling is slow and imprecise. Efforts to speed the start of cooling and to improve the cooling process are needed.
Multistage decoding-aided channel estimation and equalization for DVB-H in single-frequency networks

In single-frequency network (SFN) broadcasting systems, the presence of several transmitters translates into an equivalent channel with relevant sparsity in the delay domain, which may significantly impair the error performance. In DVB-H systems this channel sparsity, coupled with the time variation due to mobile users, renders the channel estimation task very challenging, especially when only a moderate complexity is tolerated at the receiver side. To solve this problem, this work proposes a new low-complexity multistage channel estimation technique that exploits the data at the output of the channel decoder, as well as a simple parallel intercarrier interference (ICI) canceller. The proposed scheme iteratively estimates data and channel in a joint fashion, and also includes a regularization-based preprocessing stage to specially deal with severe channel sparsity. Simulation results show that our low-complexity scheme is adequate for practical implementations of fast-mobility DVB-H receivers in all SFN scenarios.
Partial synthesis through sampling with and without specification

In this paper, we present techniques for partial synthesis through sampling mostly for combinational circuits. Here partial synthesis means that most parts of the target circuits are fixed whereas the missing portions must be logic synthesized from scratch. By modeling the missing portions with Look Up Table (LUT) or uninterpreted function (UF), their synthesis and verification problems can be formulated as Quantified Boolean Formulae (QBF). We solve these QBF by repeatedly applying a two step procedure i.e., synthesizing circuits from sample simulation results (necessary conditions) followed by formal verification on the synthesized ones with their specifications for the entire circuits (sufficient conditions). If a circuit is not correct, a counter example is automatically generated which is added to the sampling in the next iteration. With state-of-the-art combinational formal equivalence checkers, our experiments show that large circuits having more than hundreds of thousands of gates can be successfully processed with small numbers of repetitions (in the order of hundreds). Next, we extend the techniques in such a way that no formal specifications nor formal verifiers are available, but only simulation models are used for "correct" partial synthesis. This is achieved by searching for multiple different solution circuits for missing portions which behave the same for the sampled inputs but differently with another input. By repeating this process, we can narrow down the search space, and the solution circuit may become only one which should be the "correct" partial synthesis. We show successfully experimental results with small numbers of repetitions for circuits where 32-inputs/32-outputs sub-circuits are missing.
Phishing Secrets: History, Effects, Countermeasures

This paper presents the results of a study performed over phishing threats and vulnerabilities present in nowadays authentication environments. The main goal of this paper is to present our solution, the anti-phishing model which can be applied to any web environment, and not just to e-banking or the financial sector, without limitations nor additional requirements. We start presenting a brief history of phishing, common solutions, some statistics about phishing attempts, social impact and monetary losses and our patented anti-phishing model. Following is an explanation about how different vulnerabilities have been addressed such as Man-In-The-Middle attacks, phishing, pharming, SQL injection, social engineering, format string attacks, buffer overflow, brute force and many other vulnerabilities. The proposed method has been the basis of a PhD thesis aimed at defining a model for secure operation of an Internet Banking environment, even in the presence of malware on the client side. The authentication model is based on a mutual multi-factor authentication process where both entities must be authenticated with more than one authentication factor. The proposed model has been designed to be easily applicable with minimum impact to the current Internet banking systems. Its goal is to be resistant to the nowadays too frequent phishing and pharming attacks, and also to more classical ones like social engineering or man-in-the-middle attacks. The key point of this model is the need for multi-factor mutual authentication, instead of simply basing the security on the digital certificate of the financial entity, since in many cases users are not able to discern the validity of a certificate, and may not even pay attention to it. Thanks to the rules defined in this proposal, the security level of the Web Banking environment will increase and customers’ trust will be enhanced, thus allowing a more beneficial use of this service. The proposed model has been simulated in order to demonstrate its effectiveness and feasibility.
Image completion using structural priority belief propagation

A new image completion algorithm called Structural Priority Belief Propagation (SPBP) is presented to deal with LDV based image completion in this paper. LDV completion is a new form of image completion based on another large displacement view (LDV) of the same scene, no wonder, it has the potential of repairing large unknown region with salient structure information. In order to complete such unknown region, SPBP makes two important extensions over existing Priority-BP: dynamic weight of structural consistency and structural priority inheritance so as to propagate linear structure with correct priority, meanwhile it promotes texture propagation adhering to a global optimization scheme. Experimental results demonstrate that SPBP can obtain more satisfactory results than other LDV completion algorithms and it also performs well for traditional single image completion.
Presynaptic Regulation of Glutamate Release in the Ventral Tegmental Area During Morphine Withdrawal

The regulation of glutamate (Glu) release from the excitatory input to dopamine cells in the ventral tegmental area (VTA) during acute withdrawal from morphine was studied in slices from animals treated for 6–7 d with morphine. EPSCs were inhibited by opioid agonists acting at μ-subtype receptors but not by selective δ- or κ-subtype agonists. The opioid inhibition was reduced by 65% with the potassium channel blocker 4-aminopyridine (4-AP; 100 μm) and a 12-lipoxygenase inhibitor, baicalein (5 μm), suggesting that opioids acted via a transduction pathway involving activation of a voltage-dependent potassium conductance by lipoxygenase metabolites as has been shown in the periaqueductal gray (Vaughan et al., 1997). During withdrawal, neither the potency nor the efficacy ofd-Ala-Met-enkephalin-Gly-ol (DAMGO) were changed; however, the blockade of μ-opioid inhibition by both 4-AP and baicalein was reduced. In addition, the potency of baclofen to depress EPSCs by GABA-B receptors and the effects of the GABA-uptake inhibitor NO-711 (10 μm) were increased in withdrawn rats. Finally, group 2 (but not group 4 or 1) metabotropic glutamate receptor-mediated presynaptic inhibition was also enhanced in morphine-withdrawn rats. These results suggest that one of the consequences of withdrawal from chronic morphine is an enhanced presynaptic inhibition of the excitatory inputs to the dopamine cells of the VTA. Inhibition of glutamate release during acute withdrawal would add to the inhibition of dopamine cells that is mediated by an augmented release of GABA (Bonci and Williams, 1997).
CTC1 increases the radioresistance of human melanoma cells by inhibiting telomere shortening and apoptosis

Melanoma has traditionally been viewed as a radioresistant cancer. However, recent studies suggest that under certain clinical circumstances, radiotherapy may play a significant role in the treatment of melanoma. Previous studies have demonstrated that telomere length is a hallmark of radiosensitivity. The newly discovered mammalian CTC1-STN1-TEN1 (CST) complex has been demonstrated to be an important telomere maintenance factor. In this study, by establishing a radiosensitive/radioresistant human melanoma cell model, MDA-MB-435/MDA-MB-435R, we aimed to investigate the association of CTC1 expression with radiosensitivity in human melanoma cell lines, and to elucidate the possible underlying mechanisms. We found that CTC1 mRNA and protein levels were markedly increased in the MDA-MB-435R cells compared with the MDA-MB-435 cells. Moreover, the downregulation of CTC1 enhanced radiosensitivity, induced DNA damage and promoted telomere shortening and apoptosis in both cell lines. Taken together, our findings suggest that CTC1 increases the radioresistance of human melanoma cells by inhibiting telomere shortening and apoptosis. Thus, CTC1 may be an attractive target gene for the treatment of human melanoma.
e-Government in rural India: An insight into the sustainability issues of telecentres

In this paper, an attempt is made to understand the sustainability issues of telecentres by taking a case of `Akshaya' project, Kerala, India. In literature, telecentres are often associated with financial sustainability as the only parameter to judge the success of an ICT enabled project. This paper discusses other sustainability parameters such as environment, social, technological, services, institutional and staff, in the light of `Akshaya' project. The research concludes that sustainability parameters are inter-linked with each other and influence overall sustainability of telecentres.
A temperature-aware virtual submesh allocation scheme for noc-based manycore chips

Various continuous and non-continuous submesh allocation schemes have been proposed for traditional mesh-connected multiprocessor systems. Discussions of these schemes are limited to issues such as fragmentation, system performance and algorithmic complexity. NoC-based manycore chips with mesh topology are envisaged to enter the domain of parallel computing and cores of them are allocated to applications in the forms of submeshes. However, unlike the processors in traditional systems, these cores may face severe runtime thermal non-uniformities and a promising strategy to avoid these thermal crises is keeping good heat balance throughout chips at runtime. One opportunity for good heat balance is to include thermally favorable cores when submeshes are allocated. This requires a suitable temperature sensitive submesh allocation scheme for manycore chips. We propose a novel temperature-aware virtual submesh allocation scheme for NoC-based manycore chips. This scheme considers transient temperatures of cores when OSes allocate submeshes. Further, this scheme accommodates jobs with dynamically constructed virtual submeshes that are different from physical submeshes in existing schemes. In a virtual submesh, cores belonging to a virtual column (row) may come from different physical columns (rows). When chosen into virtual submeshes, cores with lower temperatures are preferred to ones with higher temperatures. Thus, cores which are not occupied and not overheated are considered for allocation; overheated cores can cool down during an idle or sleeping period. Our scheme aims to accommodate a job with a virtual submesh with low average temperature, called a cool virtual submesh. Our scheme constructs a cool virtual submesh in steps to reduce complexity since finding an optimal submesh allocation is NP-complete. Firstly, we adopt algorithm, namely GCR, to construct a suitable-sized virtual submesh for a job J. If submeshes by GCR can not satisfy the request of this job even after switching request orientation, our scheme keeps this job waiting. Secondly, we construct a cool virtual submesh based on the virtual submesh constructed by GCR if it satisfy the request of this job. We dynamically construct "areas" with left and right boundaries. A local optimal cool virtual column which is the virtual column having the lowest average temperature of cores is to be searched in each of these areas. We search local optimal cool virtual columns one by one from right to left. We model this searching problem as finding the shortest weighted paths of a directed network. We develop an algorithm, namely TA_Local_Opt_Col, to solve the problem using dynamic programming approach. Finally, a cool virtual submesh is formed by combining the local optimal cool virtual columns found in these areas. From this cool virtual submesh, a suitable-sized submesh with the lowest average temperature is allocated for J at one of its "corners".
Toward the Evidence of the Accretion Disk Emission in the Symbiotic Star RR Telescopii

In this Letter, we argue that in the symbiotic star RR Telescopii, the existence of an accretion disk around the hot companion is strongly implied by the characteristic features exhibited by the Raman-scattered O VI lines around 6830 and 7088 Å. High degrees of polarization and the double-peaked profiles in the Raman-scattered lines and the single-peak profiles for other emission lines are interpreted as line-of-sight effects, where the H I scatterers near the giant star see an incident double-peaked profile and an observer with a low inclination sees single-peak profiles. It is predicted that different mass concentrations around the accretion disk that is formed by a dusty wind may lead to the disparate ratios of the blue peak strength to the red counterpart observed in the 6830 and 7088 Å features. We discuss the evolutionary links between symbiotic stars and bipolar proto-planetary nebulae and conclude that the Raman-scattering processes may play an important role in the investigation of the physical properties of these objects.
Evolving neural networks: Is it really worth the effort?

The idea of using simulated evolution to create neural networks that learn faster and generalize better is becoming increasingly widespread. However, such evolutionary processes are usually extremely computationally intensive. In this paper, I present an empirical study to investigate whether the improved performance obtained really does justify the extra effort, and whether it might be possible to extract some general principles from existing evolved networks that can be applied directly to our hand-crafted networks.
Partial Perception and Approximate Understanding

Abstract What is discussed in the present paper is the assumption concerning a human narrowed sense of perception of external world and, resulting from this, a basically approximate nature of concepts that are to portray it. Apart from the perceptual vagueness, other types of vagueness are also discussed, involving both the nature of things, indeterminacy of linguistic expressions and psycho-sociological conditioning of discourse actions in one language and in translational contexts. The second part of the paper discusses the concept of conceptual and linguistic resemblance (similarity, equivalence) and discourse approximating strategies and proposes a Resemblance Matrix, presenting ways used to narrow the approximation gap between the interacting parties in monolingual and translational discourses.
Can Twitter Predict Royal Baby's Name ?

In this paper, we analyze the existence of possible correlation between public opinion of twitter users and the decision-making of persons who are influential in the society. We carry out this analysis on the example of the discussion of probable name of the British crown baby, born in July, 2013. In our study, we use the methods of quantitative processing of natural language, the theory of frequent sets, the algorithms of visual displaying of users' communities. We also analyzed the time dynamics of keyword frequencies. The analysis showed that the main predictable name was dominating in the spectrum of names before the official announcement. Using the theories of frequent sets, we showed that the full name consisting of three component names was the part of top 5 by the value of support. It was revealed that the structure of dynamically formed users' communities participating in the discussion is determined by only a few leaders who influence significantly the viewpoints of other users.
Earnings Management Behaviour: The Role of Pressure on Behaviour Performance

Manuscript type: Research paper.Research aims: This study aims to examine the impact of pressureon behaviour performance in the context of earnings management.Three specific key points were tested: whether pressure affects earningsmanagement behaviour; whether pressure has an interactioneffect with ethical orientation on earnings management and whetherpressure has an interaction effect with professional commitment onearnings management behaviour.Design/ Methodology/ Approach: This study employs a laboratoryexperiment which involves 102 undergraduate students as samples.The independent variable, pressure, is manipulated as follows: (1) nopressure is given and (2) pressure is given. The other two independentvariables are ethical orientation and professional commitmentwhich are measured by using the 5-point Likert scale. The dependentvariable, earnings management behaviour, is measured by using the7- point Likert scale.Research findings: The results reveal that there is a relationshipbetween individual ethical orientation and earnings managementbehaviour. The results also find that participants with a higher levelof professional commitment are less likely to engage in earningsmanagement. Moreover, it is observed that pressure has an effect onearnings management behaviour. In particular, there is an interaction effect between pressure and earnings management factors such asethical orientation and professional commitment.Theoretical contribution/ Originality: By investigating the effectof pressure on earnings management behaviour and by examiningthe interaction effect between pressure and ethical orientation andprofessional commitment, this study adds to current literature.While prior studies examined the elements of pressure causingindividuals to engage in earnings management behaviour, this studyexamines whether pressure, in the form of legal consequences andwritten justifications, could potentially reduce earnings managementbehaviour.Practitioner/ Policy implication: The results of this study arebeneficial to the management of organisations in recognising factorsthat may influence managers to perform earnings management.The results of this study can alert policy makers on the use ofpressure, which comes in the form of legal consequences and writtenjustifications, for minimising earnings management behaviour.Finally, the outcome of this study also benefits academicians suchthat they may want to consider reviewing other ethical orientationsand professional commitment components in their accounting syllabiso as to increase ethics and professionalism among accountingstudents.Research limitation: The participants of this research are studentswho had limited working experiences.Keywords: Earnings Management Behaviour, Ethical Orientation,Pressure, Professional Commitment.JEL Classification: M41
FEDC: Control Flow Error Detection and Correction for Embedded Systems without Program Interruption

This paper proposes a new technique called CFEDC to detect and correct control flow errors (CFEs) without program interruption. The proposed technique is based on the modification of application software and minor changes in the underlying hardware. To demonstrate the effectiveness of CFEDC, it has been implemented on an OpenRISC 1200 as a case study. Analytical results for three workload programs show that this technique detects all CFEs and corrects on average about 81.6% of CFEs. These figures are achieved with zero error detection /correction latency. According to the experimental results, the overheads are generally low as compared to other techniques; the performance overhead and the memory overhead are on average 8.5% and 9.1%, respectively. The area overhead is about 4% and the power dissipation increases by the amount of 1.5% on average.
A Theoretical Model for Routing Complexity

This paper introduces a formal model for studying the complexity of routing in networks. The aim of this model is to capture both time complexity and space complexity. In particular, the model takes into account the input and output facilities of routers. A routing program is a RAM-program with five additional instructions that allow to handle incoming and outgoing headers, and input and output ports. One of these five additional instructions, called release, captures the possible use of hardware facilities to speed up routing. Using our model, we show that there are routing functions which, if compacted, would require an arbitrarily large computation time to be decoded. The latency is the sum of the time (in bit-operation) required at every intermediate node to establish the route. We also show that, in any n-node network of diameter D, the latency is bounded by O(D+ n1=k logn), for every constant k 2. This latter result has to be compared with the latency of the routing tables which is Θ(D logn).