Miracle-dz/UniFAR-FTUs huggingface dataset:
A Practitioner's Handbook for Real-time Analysis-guide to Rate Monotonic Analysis for Real Time Systems. Symbolic Model Checking for Event-driven Real-time Systems. Acm Toplas

Annex Although a deep explanation of 29] is out of the scope of this paper, the following list remarks the simpliications and observations that are possible under our modeling assumptions: |The resulting "priority proole", under the modeling constraints formerly presented (no interruption handler, context switching or other run time overhead), has the following key property that simpliies the procedure: the priority of the rst sub task (the task's static priority) is the lowest priority of all the subtasks priorities (Pmin i = Pmin i (j) 8 j). According to the referred work this means that there is no diierence between the analysis of the rst job of a "busy period" and the rest of them. |All branches of a task begin with at least a common subtask. |If we are analyzing any subtask, the rest of the tasks can be classiied into three types (the general version handles 5 types) : Higher priority tasks (all their branches have greater or equal priority than the subtask being analyzed), lower priority ones (all subtasks of all branches has less priority than the subtask being analyzed) and tasks which have a blocking segment (there is at least one subtask in some branch with priority greater or equal than the base priority of task i). Thus, there is no Single preemptive tasks and blocking segments are easily determined. |Although we work with tasks composed by branches, they can be analyzed taking as the computational requirement the maximum computational requirement of any branch. To calculate the blocking term we take the maximum segment with a priority greater or equal than priority of task i among all branches of all tasks with a blocking segment. Automatic Veriication of Real-Time Designs 13 with harmonic periods 27] or even some constraints on control ow which came from data treatment not appearing in our abstract model. This proposal in some sense, enlarges the applicability of scheduling theory to prove other kind of requirements. We also show how known scheduling results could help in reducing the complexity of models and their analysis. The complementation of both research areas seems highly recommendable.a tool suite for the automatic veriication of real-time systems. Table I. Components needed to solve the queries Query Components States Trans Clocks Bounded 1 sampler1 j Analizer j net j avm 86 196 6 Bounded 2 environment j cc j queue j cm 196 744 8 Freshness sampler1 j …
Relative Depth Estimation from Hyperspectral Data

This paper addresses the problem of relative depth estimation using spatial defocus and spectral chromatic aberration presented in hyperspectral data. Our approach produces merged relative sparse depth map using two different methods. The first method constructs a histogram descriptor for edge pixels in each spectral band image. Due to the spectral chromatic aberration, different edge statistical information can be extracted from each band even at the same location. Variance among histogram bins provides input data for band-wise spatial defocus calculation. These band-wise statistical data are later combined to give the first sparse depth map. The second approach uses difference of neighboring spectral vectors to estimate relative depth. The two sparse maps with distinguishing features are finally combined and optimized to generate final sparse depth map. During the last step, normalization and smoothing are used to guarantee better consistency among edge pixels. Experimental results show that our method can generate better sparse depth map than alternative methods which operate on RGB images.
Problem Complexity Research from Energy Perspective

Computational complexity is a particularly important objective. The idea of Landauer principle was extended through mapping three classic problems (sorting,ordered searching and max of N unordered numbers) into Maxwell demon thought experiment in this paper. The problems'complexity is defined on the entropy basis and the minimum energy required to solve them are rigorous deduced from the perspective of energy (entropy) and the second law of thermodynamics. Then the theoretical energy consumed by real program and basic operators of classical computer are both analyzed, the time complexity lower bounds of three problems'all possible algorithms are derived in this way. The lower bound is also deduced for the two n*n matrix multiplication problem. In the end, the reason why reversible computation is impossible and the possibility of super-linear energy consumption capacity which may be the power behind quantum computation are discussed, a conjecture is proposed which may prove NP! =P. The study will bring fresh and profound understanding of computation complexity.
Working out an example with CEGAR S hubham S ahai S rivastava

In this article we will briefly introduce the abstraction refinement approach (CEGAR) [1] [2], developed by Clarke et. al. CEGAR is an automatic iterative abstraction refinement technique for symbolic model checking. We will work with an example, and will demonstrate how the different steps of CEGAR algorithm work to generate an abstract model, which is free from the spurious counterexample encountered.
A New Parallel Approach to the Block Lanczos Algorithm for Finding Nullspaces over GF ( 2 )

Its goal is to propose a new parallel algorithm to calculate the nullspace of a given huge matrix, in the field of GF(2). This parallel algorithm is mainly based on the Block Lanczos algorithm, but it presents a new way for distributing the matrix elements as well as minimizing the communication time. This thesis contains the necessary theoretical background and concludes with experimental results. First of all, I wish to thank my supervisor, Rob Bisseling, for his guidance and inspiration. I would like to thank my brother, János Flesch, for the support he has given me during the last years.
An online learning framework for predicting the taxi stand's profitability

Taxi services play a central role in the mobility dynamics of major urban areas. Advanced communication devices such as GPS (Global Positioning System) and GSM (Global System for Mobile Communications) made it possible to monitor the drivers' activities in real-time. This paper presents an online learning approach to predict profitability in taxi stands. This approach consists of classifying each stand based according to the type of services that are being requested (for instance, short and long trips). This classification is achieved by maintaining a time-evolving histogram to approximate local probability density functions (p.d.f.) in service revenues. The future values of this histogram are estimated using time series analysis methods assuming that a non-homogeneous Poisson process is in place. Finally, the method's outputs were combined using a voting ensemble scheme based on a sliding window of historical data. Experimental tests were conducted using online data transmitted by 441 vehicles of a fleet running in the city of Porto, Portugal. The results demonstrated that the proposed framework can provide an effective insight on the characterization of taxi stand profitability.
Optimal ancilla-free Pauli+V approximation of z-rotations

We describe a new efficient algorithm to approximate z-rotations by ancilla-free Clifford+V circuits, up to a given precision epsilon. Our algorithm is optimal in the presence of an oracle for integer factoring: it outputs the shortest Clifford+V circuit solving the given problem instance. In the absence of such an oracle, our algorithm is still near-optimal, producing circuits of V-count m + O(log(log(1/epsilon))), where m is the V-count of the third-to-optimal solution. A restricted version of the algorithm approximates z-rotations in the Pauli+V gate set. Our method is based on previous work by the author and Selinger on the optimal ancilla-free approximation of z-rotations using Clifford+T gates and on previous work by Bocharov, Gurevich, and Svore on the asymptotically optimal ancilla-free approximation of z-rotations using Clifford+V gates.
b 1-Subunit of the Ca 2 +-activated K + channel regulates contractile activity of mouse urinary bladder smooth muscle

are present in many types of smooth muscle, including urinary bladder smooth muscle (UBSM) (Klöckner & Isenberg, 1985; Brading, 1992; Markwardt & Isenberg, 1992; Heppner et al. 1997; Herrera et al. 2000). These channels are activated by membrane depolarization and by intracellular Ca, and are blocked with high affinity by the scorpion venom toxin, iberiotoxin (Galvez et al. 1990; Suarez-Kurtz et al. 1991). As the only member of the voltage-dependent potassium channel family that is activated by both voltage and Ca, the BK channel is uniquely suited to serve as a Ca–voltage signal integrator in the modulation of membrane excitability. In UBSM, BK channels have been demonstrated to play an important role in controlling membrane potential and excitability (Heppner et al. 1997), and to regulate contraction and relaxation (Suarez-Kurtz et al. 1991; Herrera et al. 2000).
Memory Servers for Multicore Systems

In multicore systems, tasks can be significantly delayed due to contention for access to shared physical resources. Due to the complexity of the underlying hardware arbitration, analyzing resources such as DRAM main memory is challenging. In particular, compositional delay bounds tend to be highly pessimistic, while non- compositional bounds are tighter but prevent independent subsystem development. To address this issue, in this paper we introduce a novel memory server for multicore real-time systems under partitioned fixed-priority scheduling. Similar to a hierarchical server, our memory server regulates the amount of resource (bandwidth) that a group of tasks is allowed to consume, but the server interface is modified to account for the properties of delay analysis. We show how to derive schedulability conditions for each server and for the system as a whole. Our technique can support multiple memory regulation implementations and delay analyses, while significantly improving system schedulability compared to the unregulated case.
A Cartometric Analysis of the Terrain Models of Joachim Eugen Müller (1752-1833) Using Non-contact 3D Digitizing and Visualization Techniques

This article assesses the accuracy of the terrain models of Joachim Eugen Muller (1752–1833) in relation to modern digital elevation data using non-contact 3D digitizing techniques. The results are objective testimony to the skill and endeavour of Joachim Eugen Muller. Using techniques primitive by modern standards, Muller provided Johann Henry Weiss (1758–1826) with data of hitherto unparalleled quality that were essential to the production of the Atlas Suisse par Meyer et Weiss. The results also demonstrate that non-contact 3D digitizing techniques not only provide a suitable data-capture method for solid terrain model analysis but are also a means of preserving digital facsimiles of such precious artefacts.
Implementing a Model of Human Plausible Reasoning

This paper describes the current state of implementation of a cognitive computer model of human plausible reasoning, based on the theory of plausible reasoning described by Collins and Michalski. Our goal is to use the simulation as a means of testing and refining the theory. This requires developing appropriate memory organization and search techniques to support of this style of inference, finding ways to estimate similarity in specific contexts and investigating ways of combining the sometimes contradictory conclusions reached when inferences of different types are used to answer questions.
Theoretical Validity and Psychological Reality of the Grammatical Code

One interpretation of the competence-performance distinction is that the grammar is a knowledge base consulted by the performance systems. We argue for an alternative interpretation, according to which the grammar and the performance systems are theories of the same object, but at different levels of description. This does not mean that the grammar is reduced to the performance systems. It is fundamental in explaining properties of these systems, as it expresses constraints on their design that generalize across specific computational procedures. We base our argument on considerations of computational effi ciency, a comparison with other information-processing systems and evolutionary considerations.
Back at the Crossroads: The Slippery Fish of Australian Retirement Income Policy

Australia's retirement income arrangements had reached a policy crossroad by the early 1980s. Not unlike the proverbial slippery fish, the goals and roles of its constituent elements were very difficult to grasp. The ensuing reforms of the 1980s and 1990s brought increasing coherence to these arrangements. Some of the more recent changes, however, have once again introduced policy slipperiness through creating a system that is at odds with the intent of the earlier reform efforts. Indeed, Australia's retirement income arrangements have morphed into a system whose function is no longer simply to protect workers from the loss of earned income arising from retirement. The 'zenith' of this situation was reached in July 2007 when the major changes in superannuation announced in the 2006 federal budget took effect. Thus, Australia is once again back at a policy crossroad as far as her retirement income arrangements are concerned.
Automatic Generation of Matching Function by Genetic Programming for Effective Information Retrieval

With the advent of the Internet, online resources are increasingly available. Many users choose popular search engines to perform an online search to satisfy their information need. However, these search engines tend to turn up many non-relevant documents, which make their retrieval precision very low. How to find appropriate ranking metrics to retrieve more relevant documents and fewer non-relevant documents for users remains a big challenge to the information retrieval community. In this paper, we propose a new framework that combines the merits of genetic programming and relevance feedback techniques to automatically generate and refine the matching functions used for document ranking. This approach overcomes the shortcoming of traditional ranking algorithms using a fixed ranking strategy. It also gives some new ideas and hints for information retrieval professionals.
ABILITY OF POLYMORPHONUCLEAR LEUKOCYTES TO ORIENT IN GRADIENTS OF CHEMOTACTIC FACTORS

P o l y m o r p h o n u c l e a r l eukocyte ( P M N ) chemotaxis has been examined under condi t ions which al low phase microscope observa t ions of cells r e spond ing to cont ro l led gradients of chemotac t i c factors . Wi th this visual assay, PMNs can be seen to or ient rap id ly and revers ibly to gradients of Nfo rmylme th iony l pept ides . The level of o r ien ta t ion depends upon the mean concen t ra t ion of pep t ide presen t as well as the concen t ra t ion gradient . The response al lows an es t imat ion of the b inding constant of the pep t ide to the cell. In op t imal gradients , PMNs can de tec t a 1% difference in the concent ra t ion of pep t ide . A t high cell densi t ies , PMNs incuba ted with active pep t ides or ient their locomotion away from the center of the cell popu la t ion . This o r ien ta t ion appea r s to be due to inact ivat ion of the pep t ides by the cells. Such inact ivat ion in vivo could he lp tO limit an in f l ammatory response .
Comparison of User-Directed and Automatic Mapping of the Planned Isocenter to Treatment Space for Prostate IGRT

Image-guided radiotherapy (IGRT), adaptive radiotherapy (ART), and online reoptimization rely on accurate mapping of the radiation beam isocenter(s) from planning to treatment space. This mapping involves rigid and/or nonrigid registration of planning (pCT) and intratreatment (tCT) CT images. The purpose of this study was to retrospectively compare a fully automatic approach, including a non-rigid step, against a user-directed rigid method implemented in a clinical IGRT protocol for prostate cancer. Isocenters resulting from automatic and clinical mappings were compared to reference isocenters carefully determined in each tCT. Comparison was based on displacements from the reference isocenters and prostate dose-volume histograms (DVHs). Ten patients with a total of 243 tCTs were investigated. Fully automatic registration was found to be as accurate as the clinical protocol but more precise for all patients. The average of the unsigned x, y, and z offsets and the standard deviations (σ) of the signed offsets computed over all images were (avg. ± σ (mm)): 1.1 ± 1.4, 1.8 ± 2.3, 2.5 ± 3.5 for the clinical protocol and 0.6 ± 0.8, 1.1 ± 1.5 and 1.1 ± 1.4 for the automatic method. No failures or outliers from automatic mapping were observed, while 8 outliers occurred for the clinical protocol.
HITIQA : A Question Answering Analytical Tool

† HITIQA (High Quality Interactive Question Answering) is currently being developed to assist analysts in finding answers to complex intelligence problems, efficiently and thoroughly. The system uses event-based, data-driven semantic processing and natural language dialogue, coupled with an advanced information visualization interface, to deliver accurate answers to the analyst's questions along with related contextual information. The first version of the system has undergone a series of preliminary evaluations with the analysts from the US Naval Reserve, producing valuable usage and performance data. These evaluations suggest that HITIQA creates a measurable cognitive augmentation effect for the analyst. The second more advanced version of the system is currently being implemented. HITIQA is an advanced question answering system that helps the analyst to produce higher quality reports for complex intelligence problems in less time and with lower cog-nitive load. The primary function of HITIQA is to supply composite answers to complex, exploratory questions such as " What is the state of development of long range missiles in North Korea? Can they reach the U.S.? " Submitting such questions to a conventional internet search produces tens of thousands of hits that include many related and unrelated documents of varying length and veracity. More questions may need to be asked along the way to fill information gaps or to explore related topics such as production capabilities or missile technology proliferation, etc. Each time a question is posed, substantial effort must be applied to retain relevant facts, note contradictions, ignore repetitions and discard unrelated and unreliable sources. The problem is not usually lack of information; more often it is too much in-formation—fragmented, indirectly related, sometimes mis-leading—and the lack of skilled assistance to help the analyst wade through it. HITIQA does not return long lists of documents, as keyword search does; instead, it retains only the most relevant passages and assembles them into a coherent composite answer. HITIQA selects its answer more carefully, too: keyword match may be a reasonable indication of potential relevance, but until we know why these words are found together, answer precision is likely to be low. In order to improve accuracy, HITIQA performs named entity extraction from candidate text passages and then uses several pro-totypical event templates (called frames) to arrive at the most likely interpretation. The text passage is thus rendered into an event frame which assigns event roles to the entities found in text. The list of available roles varies …
Social Welfare and Behavioral Public Policies

In this work I discuss several key aspects of welfare economics and policy analysis and I propose two original contributions to the growing field of behavioral public policymaking. After providing a historical perspective of welfare economics and an overview of policy analysis processes in the introductory chapter, in chapter 2 I discuss a debated issue of policymaking, the choice of the social welfare function. I contribute to this debate by proposing an original methodological contribution based on the analysis of the quantitative relationship among different social welfare functional forms commonly used by policy analysts. In chapter 3 I then discuss a behavioral policy to contrast indirect tax evasion based on the use of lotteries. I show that the predictions of my model based on non-expected utility are consistent with observed, and so far unexplained, empirical evidence of the policy success. Finally, in chapter 4 I investigate by mean of a laboratory experiment the effects of social influence on the individual likelihood to engage in altruistic punishment. I show that bystanders’ decision to engage in punishment is influenced by the punishment behavior of their peers and I suggest ways to enact behavioral policies that exploit this finding.
A shared polyhedral cache for 3D wide-I/O multi-core computing platforms

3D-Stacked IC (3D-SIC) based on Through-Silicon-Vias (TSV) is an emerging technology that enables heterogeneous integration and high bandwidth low latency interconnection. In this paper we propose a 3D novel cache architecture that leverages a wide TSV-based data link distributed on the entire memory array to support two orthogonal interfaces: (i) a vertical one, with a large data width, and, (ii) a side one, with a lower data width, but with more bank-type access ports, which reduces the bank conflict probability. Our simulations indicate that our proposal substantially outperforms planar counterparts in terms of access time, energy, and footprint while providing high bandwidth, low bank conflict rate, and an enriched access mechanism set.
An Improved Non-Local Filter for Image Denoising

An improved image denoising algorithm based on Non- Local Means (NLM) framework is proposed in this paper. The NLM estimates pixel values by a weighted mean of pixels in the corresponding searching area. The weight of each pixel is computed by a similarity function. The main idea of NLM is a searching area and a similarity function. The similarity function is a Euclidean distance function which is weighted by the standard Gaussian kernel. We modified the similarity function to become a flexible Euclidean distance function depending on image noise to balance smoothness in homogeneous areas and importance of the center pixel. We extend the searching area to the searching space, which not only covers a block of the image but also includes a dimension of pixel value space. This extension renders our proposed approach to exclude most of irrelevant pixels in the searching area which often disturb thin structures.
Job Stability, Earnings, Marital Stability: How Are They Related?

This study examines the interplay between job stability, earnings, and marital instability. We analyze the sequence of jobs, marriages, divorces, and remarriages among young men and ask: 1) Do job stability, high wages, and the career advancement of young men promote marriage and marital stability? 2) What are the consequences of marriage and marital stability for achieving high levels of job stability and occupational success? We develop a Dynamic Selection Control model in which young men make sequential choices about work and family, and estimate the model using a dynamic maximum likelihood (ML) approach that takes account of self-selection, simultaneity and heterogeneity. The data come from the 1979-1994 National Longitudinal Survey of Youth (NLSY79). We find job change and job stability are associated with lower wages and that both reduce the likelihood of getting married and remaining married. While taking account of labor market impacts on job stability and wages, we find robust evidence running from marriage to higher job stability and higher earnings. The evidence of a marriage premium on wages is robust.