Miracle-dz/UniFAR-FTUs huggingface dataset:
Skeletonization via Distance Maps and Level Sets

A level set approach for computing solutions to incompressible two-phase ow. A viscosity solutions approach to shape-from-shading. SIAM. 19 Proof: Every simply connected shape has a simply connected skeleton 20]. Only circles have skeletons that are single points. Therefore, the skeletons of all other simply connected shapes have at least two end points. The proof follows immediately from Lemma 4. 2 18 Let us prove the rst statement: All points propagating from the arc segments quench each other at the center of the original maximal disk. Assume by contradiction that a propagating arc segment point p 0 meets the another propagating boundary point before it meets any other propagating arc segment point. This implies that the maximal disk touching point p 0 in the new shape has a smaller radius then the maximal disk. This cannot happen, since any such disk is contained in the maximal disk, which is contained in both new shapes. We now show that pairs of generating points on the boundary of the full shape cannot be separated into diierent new shapes. Assume by contradiction that two points that generated a skeleton point of the full shape are located each on the boundary of a diierent new shape. In that case the radius connecting one of those points with the skeleton point corresponding to it must intersect one of the radii connecting the center of the maximal disk to either p or q, in contradiction to Corollary 2. p and q are the points generating the original maximal disk, see Figure 8. To prove the second statement we must show that in the new shapes, each boundary point is quenched by its original twin from the full shape. This is so since otherwise it must be quenched by another point from the boundary of the new shape. But this is impossible: it will not be quenched by another point that belongs to the full shape since it did not happen in the full shape at the rst place; it will not be quenched by a point from the newly introduced circular segments, since we have shown that all the arc segment points are quenched together. 2 The following corollary is a direct consequence of Lemma 3. Corollary 3 The center of a maximal disk that touches the boundary in two separate points, connects two diierent parts of the skeleton. The two parts are the skeletons of …
Oversampling and transmission of hidden information

The lack of uniqueness arising by oversampling of Fourier coefficients is shown to provide a way of transmitting hidden information. A basic encoding/decoding system, developed on the basis of such a possibility, is discussed. The system is devised with the double purpose of: (a) enabling the transmission of an arbitrary signal and (b) allowing for the transmission of a hidden embedded code.
Novel power grid reduction method based on L1 regularization

Model order reduction exploiting the spectral properties of the admittance matrix, known as the graph Laplacian, to control the approximation accuracy is a promising new class of approaches to power grid analysis. In this paper we introduce a method that allows a dramatic increase in the resulting graph sparsity and can handle large dense input graphs. The method is based on the observation that the information about the realistic ranges of port currents can be used to significantly improve the resulting graph sparsity. In practice, port currents cannot vary unboundedly and the estimates of peak currents are often available early in the design cycle. However, the existing methods including the sampling-based spectral sparsification approach [11] cannot utilize this information.We propose a novel framework of graph Sparsification by L1 regularization on Laplacians (SparseLL) to exploit the available range information to achieve a higher degree of sparsity and better approximation quality. By formulating the power grid reduction as a sparsity-inducing optimization problem, we leverage the recent progress in stochastic approximation and develop a stochastic gradient descent algorithm as an efficient solution. Using established benchmarks for experiments, we demonstrate that SparseLL can achieve an up to 10X edge sparsity improvement compared to the spectral sparsification approach assuming the full range of currents, with an up to 10X accuracy improvement. The running time of our algorithm also scales quite favorably due to the low complexity and fast convergence, which leads us to believe that our algorithm is highly suitable for large-scale dense problems.
A Fusion of Real and Virtual Information for Aiding Aircraft Pilotage in Low Visibility

Low visibility is the single most critical factor affecting both the safety and capacity of worldwide aviation operations. Enhanced Vision System (EVS) and Synthetic Vision System (SVS) are new assistant systems designed with the goal of eliminating poor visibility conditions as a causal factor to civil aircraft accidents and delays. Due to their great potential, both EVS and SVS have been drawing dramatic attention from academia to industry all over the world and they are moving from laboratory to practical application. In China, however, the progress is comparatively slow because of the costly and limited experimental resources. This paper reports on the preliminary work for developing EVS and SVS including the pioneer flight test in China for civil aviation use and its data analysis. A novel concept of merging real and virtual vision together is put forward in this paper. Index Terms—Low visibility, EVS, SVS, Fusion
INFLUENCE OF SPECIFIC VOIP TRANSMISSION CONDITIONS ON SPEAKER RECOGNITION PROBLEM

The paper presents the problem of signal degradation in packet-based voice transmission and its influence on the voice recognition correctness. The Internet is evolving into universal communication network which carries all types of traffic including data, video and voice. Among them the Internet telephony, namely VoIP is going to be an application of a great importance and that is why it is so important to assess how specific conditions and distortions of the Internet transmission (speech coding and most of all packet loss and delay) can influence speaker recognition problem. The Gaussian Mixture Models classification, the feature extraction, the Internet speech transmission standards and the signal degradation methodology applied in the tested system were overviewed. The experiments carried out for two most commonly applied encoders (G.711 and G.723) and three network conditions (poor, average and with no packet loss) revealed a minor significance of the packet loss problem in the tested text-independent system.
Managing N Inputs and the Effect on N Losses Following Excretion in Open-Dirt Feedlots in Nebraska

Nutrition will play an important role in meeting the environmental challenges of beef cattle feedlots. Nutritionists are continually refining protein requirements, and have recently adopted a new metabolizable protein (MP) system to more efficiently use nitrogen (N) and allow more accurate diet formulation. Protein requirements vary by animal age and weight during the finishing period. Our hypothesis was that formulating diets with the MP system would decrease N inputs and lead to decreased excretion and losses. Comparing industry average diets (13.5% crude protein) to phase-fed diets formulated to not exceed MP requirements decreased N inputs by 10 to 20% for calves and yearlings without affecting average daily gain. Decreasing inputs led to a concomitant decrease in N excretion (12 to 21%) and losses (15 to 33%) in open-dirt feedlot pens. N losses are variable with time of year, with averages of 60 to 70% of excreted N lost during the summer months and 40% lost during the November to May feeding periods. Protein requirements are being refined continually as more research data are collected. However, formulation to meet protein requirements, but not exceed them, is an important nutritional management option for feedlots to become sustainable.
Mapping and Scheduling of Tasks and Communications on Many-Core SoC Under Local Memory Constraint

There has been extensive research on mapping and scheduling tasks on a many-core SoC. However, none considers the optimization of communication types, which can significantly affect performance, energy consumption, and local memory usage of the SoC. This paper presents an approach to automatic mapping and scheduling of tasks and communications on a many-core SoC. The key idea is to decide the type of each communication between message passing and shared memory when we do the mapping and scheduling. By assigning a proper type to each communication, we can optimize the energy consumption, performance, or energy-delay product. To solve the optimization problem, the approach adopts a probabilistic algorithm coupled with some heuristics. To enhance throughput of the system, it performs software pipelined scheduling of the tasks using a modified iterative modulo scheduling technique. Experiments show that our algorithm achieves on average 50.1% lower energy consumption, 21.0% higher throughput, and 64.9% lower energy- delay product, compared to shared memory only communication.
Analysis of Cell-Counting Based Attack Against Tor

The onion router (TOR) allows to hide your identity various software under this categories are available that allows online anonymity. It doesn't allow network surveillance or traffic analysis to get tracked but most of these software used equal size cells (512B). In this paper we are analysing counting attacks against TOR which allows us to identify anonymous communication among user. Firstly we need to buy one onion router then attacker can include special signal i.e. cell counting into network traffic. We have developed this system against TOR and experimental result shows the effectiveness of algorithms and allows detecting TOR networks.
The International Trade Network in Space and Time

This paper studies how the structure of the International Trade Network (ITN) changes in geographical space and along time. We employ geographical distance between countries in the world to filter the links in the ITN, building a sequence of sub-networks, each one featuring trade links occurring at similar distance. We then test if the topological properties of ITN subnetworks change as distance increases. We find that distance strongly impacts, in non-linear ways, the topology of the ITN. We show that the ITN is disassortative at long distances while it is assortative at short ones. Similarly, the main determinant of the overall high ITN clustering level are triangular trade triples between geographically close countries. This means that trade partnership choices are differentiated over different distance ranges. Such evidence robustly arises over time and after one controls for the economic size and income of trading partners.
What Is the Impact of Heterogeneous Knowledge about Fundamentals on Market Liquidity and Efficiency: An ABM Approach

This paper studies the effect of investor's bounded rationality on market dynamics. In an order driven market, we consider a few-types model where two risky assets are traded. Agents differ by their behavior, knowledge, risk aversion and investment horizon. The investor's demand is defined by a utility maximization under constant absolute risk aversion. Relaxing the assumption of perfect knowledge of the fundamentals enables to identify two components in a bubble. The first one comes from the unperceived fundamental changes due to trader's belief perseverance. The second one is generated by chartist behavior. In all simulations, speculators make the market less efficient and more volatile. They also increase the maximum amount of assets exchanged in the most liquid time step. However, our model is not showing raising average volatility on long term. Concerning the fundamentalists, the belief perseverance has a stabilization impact on the trading price. The closer the anchor is to the true fundamental value, the more efficient the market is, because the prices change smoothly.
Pre-emptive Flow Installation for Internet of Things Devices within Software Defined Networks

The predicted prevalence of both Internet of Things (IoT) based devices and the concept of Software Defined Networking (SDN) as a new paradigm in networking, means that consideration is required for how they will interact. Current SDN implementations operate on the principle that on receiving an unrecognised packet, a switch will query a centralised controller for a corresponding rule. Memory limitations within current switch devices dictate that this rule can only be stored for a short period of time before being removed, thus making it likely that the relatively infrequent data samples sent from IoT devices will have a transmission interval longer than this timeout. This paper proposes a Pre-emptive Flow Installation Mechanism (PFIM) that dynamically learns the transmission intervals of periodic network flows and installs the corresponding rules within a switch, prior to the arrival of a packet. A proof-of-concept implementation shows this to have a significant effect on reducing the delay experienced by these flows.
The Role of Environmental Dynamics in Building a First Mover Advantage Theory

We advance first mover advantage (FMA) theory by examining how the pace of market evolution and technology evolution potentially enables or disables FMA. Integrating several streams of literature, we elaborate on the interplay among these two environmental (macro) conditions and the “isolating mechanisms” that underpin FMA. We model these dynamics to help researchers negotiate the current debate, arising from conflicting empirical evidence, on the conditions necessary for FMA to exist.
Review of the present technologies concurrently contributing to the implementation of the Internet of Things (IoT) paradigm: RFID, Green Electronics, WPT and Energy Harvesting

This paper summarizes the most important technologies, concurrently participating to build the technological platform needed for a realistic implementation of the Internet of Things (IoT) paradigm. At the present state of the evolution of IoT, these technologies are mostly: Radio Frequency IDentification (RFID), Green Electronics (GE), Wireless Power Transfer (WPT) and Energy Harvesting (EH). This contribution briefly explains the reason for that, and shows a collection of scientific contributions which can be seen as examples. The deep description of the proposed systems can be found in the relative referenced papers.
Logic-based event recognition

Abstract Today's organizations require techniques for automated transformation of their large data volumes into operational knowledge. This requirement may be addressed by using event recognition systems that detect events/activities of special significance within an organization, given streams of ‘low-level’ information that is very difficult to be utilized by humans. Consider, for example, the recognition of attacks on nodes of a computer network given the Transmission Control Protocol/Internet Protocol messages, the recognition of suspicious trader behaviour given the transactions in a financial market and the recognition of whale songs given a symbolic representation of whale sounds. Various event recognition systems have been proposed in the literature. Recognition systems with a logic-based representation of event structures, in particular, have been attracting considerable attention, because, among others, they exhibit a formal, declarative semantics, they have proven to be efficient and scalable and they are supported by machine learning tools automating the construction and refinement of event structures. In this paper, we review representative approaches of logic-based event recognition and discuss open research issues of this field. We illustrate the reviewed approaches with the use of a real-world case study: event recognition for city transport management.
A Comparison of Brain Gene Expression Levels in Domesticated and Wild Animals

Domestication has led to similar changes in morphology and behavior in several animal species, raising the question whether similarities between different domestication events also exist at the molecular level. We used mRNA sequencing to analyze genome-wide gene expression patterns in brain frontal cortex in three pairs of domesticated and wild species (dogs and wolves, pigs and wild boars, and domesticated and wild rabbits). We compared the expression differences with those between domesticated guinea pigs and a distant wild relative (Cavia aperea) as well as between two lines of rats selected for tameness or aggression towards humans. There were few gene expression differences between domesticated and wild dogs, pigs, and rabbits (30–75 genes (less than 1%) of expressed genes were differentially expressed), while guinea pigs and C. aperea differed more strongly. Almost no overlap was found between the genes with differential expression in the different domestication events. In addition, joint analyses of all domesticated and wild samples provided only suggestive evidence for the existence of a small group of genes that changed their expression in a similar fashion in different domesticated species. The most extreme of these shared expression changes include up-regulation in domesticates of SOX6 and PROM1, two modulators of brain development. There was almost no overlap between gene expression in domesticated animals and the tame and aggressive rats. However, two of the genes with the strongest expression differences between the rats (DLL3 and DHDH) were located in a genomic region associated with tameness and aggression, suggesting a role in influencing tameness. In summary, the majority of brain gene expression changes in domesticated animals are specific to the given domestication event, suggesting that the causative variants of behavioral domestication traits may likewise be different.
Cost and Benefits of Adopting Euro

Euro zone is the largest economic integration of a currency area that the world had seen since the unification of the United States into a monetary union under the dollar, over two centuries earlier. This paper investigates the circumstances under which it is beneficial to participate in a currency area. We examine some key comparisons that can be made between Europe and the United States, particularly as it relates to the United States as a model for Europe, and also examines some key steps that policymakers could take to move Europe closer to fulfilling the criteria for being an optimal currency area. The aim of the paper is to examine both, costs and benefits associated with forming of European monetary union. The ultimate conclusion is that the euro zone is not an optimal currency area, albeit significant advancements towards it were made past the introduction of the euro, in terms of inflation convergence, financial integration and intra-trade intensification. Yet, the criteria of labor mobility, wage flexibility, fiscal and political integration, are far from being satisfied. Keywords: Optimal Currency Area, Euro Zone, Financial Integration, Monetary Politics
Air Muscle Actuated Low Cost Humanoid Hand

The control of humanoid robot hands has historically been expensive due to the cost of precision actuators. This paper presents the design and implementation of a low-cost air muscle actuated humanoid hand developed at Curtin University of Technology. This hand offers 10 individually controllable degrees of freedom ranging from the elbow to the fingers, with overall control handled through a computer GUI. The hand is actuated through 20 McKibben-style air muscles, each supplied by a pneumatic pressure-balancing valve that allows for proportional control to be achieved with simple and inexpensive components. The hand was successfully able to perform a number of human-equivalent tasks, such as grasping and relocating objects.
Classi cation of Color Edges in Video intoShadow-Geometry , Highlight , or Material

We aim at using color information to classify the physical nature of a color edge. To achieve physics-based edge classiication, we propose a taxonomy of color invariant edges. Further, we present a framework for automatic color edge detection and noise-adaptive thresholding derived from sensor noise analysis and propagation. Then, a parameter-free color edge classiier is introduced labeling color transitions into the following edge types: (1) shadow, geometry or shading edges, (2) highlight edges, (3) material edges. The proposed method is empirically veriied for video showing complex real world scenes.
Construction of a pseudo-random generator from any one-way function

There are many natural examples of conjectured one-way functions, whereas pseudo-random generators have a number of important applications, including the construction of a private key cryptosystem that is provably secure. We show how to construct a pseudo-random generator from any one-way function. Our constructions make extensive use of hashing to extract and smooth entropy from a one-way function.
Unifying Themes for Selection on Any Network

In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is ? the number of processors (p). Our deterministic algorithm runs on any network in timeO(n/plog logp+Tpslogn), whereTpsis the time needed for sortingpkeys usingpprocessors. On the other hand, our randomized algorithm runs in an expected time ofO((n/p+Tpsparse) log logp) on any network, whereTpsparseis the time needed for collecting and sortingp1? sample keys usingpprocessors. (Here ? is a constant <1). Application of the above algorithms on the mesh and the hypercube yields better results than known before. We have implemented our randomized algorithm on the Connection Machine CM2. Experimental results obtained are promising. In this paper we also report our implementation details.
Senior Project : Parallel Programming

After years of technological advances the speed of single processors are beginning to meet their physical limitations. Thus, parallel programming has become an increasingly important tool in scientific research and commercial industries. This paper includes an exploration of how the size and number of calculations in various problems benefit from parallelization in a distributed-memory MIMD environment.
Forward-scaling, serially equivalent parallelism for FPGA placement

Placement run-times continue to dominate the FPGA design flow. Previous attempts at parallel placement methods either only scale to a few threads or result in a significant loss in solution quality as thread-count is increased. We propose a novel method for generating large amounts of parallel work for placement, which scales with the size of the target architecture. Our experimental results show that we nearly reach the limit of the number of possible parallel swaps, while improving critical-path-delay 4.7% compared to VPR. While our proposed implementation currently utilizes a single thread, we still achieve speedups of 13.3x over VPR.