Miracle-dz/UniFAR-FTUs huggingface dataset:
Capital Market Reactions to the Passage of the Financial Services Modernization Act of 1999

The Financial Services Modernization Act of 1999, also known as the Gramm-Leach-Bliley Act (GLBA), removed most of the remaining barriers between financial companies. Stock market reactions to the passage of GLBA vary across financial sectors and company size. Specifically, we find negative returns for foreign banks, thrifts and finance companies; insignificant returns for banks; and positive returns for investment banks and insurance companies. Additionally, larger non-depository firms have higher returns. The return variation reflects resolution of uncertainty surrounding the final provisions of GLBA, competitive pressures, and expectations of future business combinations. Potential gains from business combinations may arise from economies of scope, market power, and/or from an implicit extension of government guarantees to banking affiliates.
TransCom: Transforming stream communication for load balance and efficiency in networks-on-chip

Recent work has examined using application-specific knowledge of streaming communication to optimize network routing (for throughput/performance) and/or design (for simpler hardware). Previous techniques have assumed that the communication streams are directly mapped to networks-on-chip. In contrast, this paper explores the use of communication transformations (TransCom) to achieve higher throughput via better network load balance and more efficient network utilization while retaining the communication semantics of the original streaming application. Specifically, we propose two transformations: stream fission and stream fusion. (While fission and fusion transformations have been applied to computation in streaming programs, we are the first to propose these transformations for stream communication.) Fission splits communication streams in to multiple streams that may be routed over independent network paths to achieve better network load balance. Fusion targets multicast communication and fuses multiple streams to effectively capture the well-known benefits of tree-based multicast, which include more efficient link utilization. Both techniques can be integrated in an integer linear program formulation that is solved at compile time. Evaluations with a suite of StreamIT benchmarks show that TransCom achieves significant performance improvement (nearly 60% on average) over prior application-specific (non-transformed) routing techniques.
Face Verification Across Age Progression Using Discriminative Methods

Face verification in the presence of age progression is an important problem that has not been widely addressed. In this paper, we study the problem by designing and evaluating discriminative approaches. These directly tackle verification tasks without explicit age modeling, which is a hard problem by itself. First, we find that the gradient orientation, after discarding magnitude information, provides a simple but effective representation for this problem. This representation is further improved when hierarchical information is used, which results in the use of the gradient orientation pyramid (GOP). When combined with a support vector machine GOP demonstrates excellent performance in all our experiments, in comparison with seven different approaches including two commercial systems. Our experiments are conducted on the FGnet dataset and two large passport datasets, one of them being the largest ever reported for recognition tasks. Second, taking advantage of these datasets, we empirically study how age gaps and related issues (including image quality, spectacles, and facial hair) affect recognition algorithms. We found surprisingly that the added difficulty of verification produced by age gaps becomes saturated after the gap is larger than four years, for gaps of up to ten years. In addition, we find that image quality and eyewear present more of a challenge than facial hair.
An efficient VLSI architecture for nonbinary LDPC decoder with adaptive message control

A new decoder architecture for nonbinary low-density parity check (LDPC) codes is presented in this paper to reduce the hardware operational complexity and power consumption. Adaptive message control (AMC) is to achieve the low decoding complexity, that dynamically trims the message length of belief information to reduce the amount of memory accesses and arithmetic operations. A new horizontal nonbinary LDPC decoder architecture is developed to implement AMC. Key components in the architecture have been designed with the consideration of variable message lengths to leverage the benefit of the proposed AMC. Simulation results demonstrate that the proposed nonbinary LDPC decoder architecture can significantly reduce hardware operations and power consumption as compared with existing work with negligible performance degradation.
Limits of Interpretivism

As a matter of history, the term "interpretivism" was current only for a short time in the 1970s and has since been largely replaced by the term "textualism. " But "interpretivism" still survives, partly as a matter of rhetoric: one who calls himself an "interpretivist" implies that what distinguishes him from others who see things differently is that he "interprets" the law while they do something else, and presumably something less legitimate. This paper responds to the contention of one self-described interpretivist (Justice Stephen Markman of the Michigan Supreme Court) that interpretivism is a strategy for constitutional interpretation that follows the constitutional text, respects original meanings, establishes known and stable rules in advance of particular cases, and keeps judges within their traditional role. The paper argues that the foregoing goals are regularly in tension with one another. In the rhetoric of judicial politics, a theorist or a judge sometimes claims to be doing all of these things - and thus "interpreting" the Constitution - while theorists or judges who see things differently do something other than (and presumably less legitimate than) "interpreting" the Constitution. In reality, all judges must frequently compromise some of these aims to better achieve the others, whether consciously or otherwise.
Power Efficiency Metrics for Geographical Routing In Multihop Wireless Networks

 Abstrac t - A number of energy-aware routing protocols are proposed to provide the energy efficiency of routes in multihop wireless networks.A Localized Energy-Aware Restricted Neighborhood routing (LEARN), can guarantee the energy efficiency of its route if it can find the route successfully. The study of its critical transmission radius in random networks can guarantee that LEARN routing finds a route for any source and destination pairs asymptotically almost surely. Extending this proposed routing into three-dimensional (3D) networks by deriving its critical transmission radius in 3D random networks. In geographical routing schemes ,where each network node is assumed to know the coordinates of itself and all its adjacent nodes, and each message carries the coordinates of its target. The LEARN technique is to find the efficient path, and propose and analyze several randomized geographic routing algorithms which work well for 3D network topologies. For all networks graphs, present a technique to geographically capture the surface of holes in the network, which leads to 3D routing algorithm and heuristic algorithm shows performance analysis in the wireless networks.
Profilin regulates the activity of p42POP, a novel Myb-related transcription factor

Profilins, regulators of cytoplasmic actin dynamics, also bind to several nuclear proteins but the significance of these interactions is mostly unclear. Here, we describe a novel Myb-related transcription factor, p42POP, as a new ligand for profilin and show that profilin regulates its activity. p42POP comprises a unique combination of domains and is widely expressed in mouse tissues. In contrast to many other Myb proteins, it contains only one functional tryptophan-cluster motif. This is followed by an acidic domain, a leucine zipper that mediates dimerization and functional nuclear import and export signals that can direct p42POP to either the nuclear or the cytoplasmic compartment. Binding to profilins is mediated by a proline-rich cluster. p42POP-profilin complexes can be precipitated from cell lysates. In transfected cells displaying p42POP in the nucleus, nuclear profilin is markedly increased. When p42POP is anchored at mitochondrial membranes, profilin is targeted to this location. Hence, in a cellular environment, p42POP and profilin are found in the same protein complex. In luciferase assays, p42POP acts as repressor and this activity is substantially reduced by profilins, indicating that profilin can regulate p42POP activity and is therefore involved in gene regulation.
TRACK YOURSELF AND SHARE WITH US. DIGITAL SELF-TRACKING AS A SOCIAL PRACTICE.

Mobile and Wearable devices makes self-tracking as a practice of systematically recording information about one´s life easier than ever before. Self-tracking confirms the cultural expectations of the importance of self-awareness, reflection and responsibility and gives the users tools for managing themselves and improving their lives. Besides the automatization of collection and data processing especially the manifold ways of sharing individual life data forms the innovative character of modern self-tracking applications. People can share their individual measurements with other users on social media, blogs or in other forms of online or offline communities. Therefore, self-tracking may not be analyzed as an individual practice but have to be seen as a profound social and communicative practice. Despite a body of literature is beginning to emerge that addresses the social, cultural and political dimensions of self-tracking, only a few studies analyze systematically motivational and social factors for self-tracking. This research gap should be filled with findings from a two-step qualitative study: Users of self-tracking applications report their self-tracking behavior in a diary and are interviewed about their usage experiences, motives and sharing behavior of self-tracking data. Based on the diary and interview data the presentation intends to show why self-tracking can be seen as an expression of how the “rules” of the internet can change self-experiences and the way how personal data is handled.
Tracking of multiple moving objects under outdoor environment using color-based particle filter

Object tracking is a challenging problem due to the presence of noise, occlusion, clutter and dynamic change in the scene other than the motion of object of interest. A variety of tracking algorithms has been proposed and implemented to overcome these difficulties, but there are still some problems need to be covered. This paper proposed an algorithm to track the moving objects employing a color-based particle filter considering the single object and multiple objects in outdoor environment. We rely on Bhattacharya distance to measure the similarity between the color distribution of the target model and particles. We propose also a target-model update condition, ensuring the proper tracking object. The method is capable to track successfully the object in different outdoor environment in the presence of occlusion, clutter and dynamic change. Some experimental results and data show the feasibility and the effectiveness of our method.
Large scale inference in the Infinite Relational Model: Gibbs sampling is not enough

The stochastic block-model and its non-parametric extension, the Infinite Relational Model (IRM), have become key tools for discovering group-structure in complex networks. Identifying these groups is a combinatorial inference problem which is usually solved by Gibbs sampling. However, whether Gibbs sampling suffices and can be scaled to the modeling of large scale real world complex networks has not been examined sufficiently. In this paper we evaluate the performance and mixing ability of Gibbs sampling in the Infinite Relational Model (IRM) by implementing a high performance Gibbs sampler. We find that Gibbs sampling can be computationally scaled to handle millions of nodes and billions of links. Investigating the behavior of the Gibbs sampler for different sizes of networks we find that the mixing ability decreases drastically with the network size, clearly indicating a need for better sampling strategies.
Improving the surface brightness-color relation for early-type stars using optical interferometry

The aim of this work is to improve the SBC relation for early-type stars in the $-1 \leq V-K \leq 0$ color domain, using optical interferometry. Observations of eight B- and A-type stars were secured with the VEGA/CHARA instrument in the visible. The derived uniform disk angular diameters were converted into limb darkened angular diameters and included in a larger sample of 24 stars, already observed by interferometry, in order to derive a revised empirical relation for O, B, A spectral type stars with a V-K color index ranging from -1 to 0. We also took the opportunity to check the consistency of the SBC relation up to $V-K \simeq 4$ using 100 additional measurements. We determined the uniform disk angular diameter for the eight following stars: $\gamma$ Ori, $\zeta$ Per, $8$ Cyg, $\iota$ Her, $\lambda$ Aql, $\zeta$ Peg, $\gamma$ Lyr, and $\delta$ Cyg with V-K color ranging from -0.70 to 0.02 and typical precision of about $1.5\%$. Using our total sample of 132 stars with $V-K$ colors index ranging from about $-1$ to $4$, we provide a revised SBC relation. For late-type stars ($0 \leq V-K \leq 4$), the results are consistent with previous studies. For early-type stars ($-1 \leq V-K \leq 0$), our new VEGA/CHARA measurements combined with a careful selection of the stars (rejecting stars with environment or stars with a strong variability), allows us to reach an unprecedented precision of about 0.16 magnitude or $\simeq 7\%$ in terms of angular diameter.
Polynomial-time DC (POTDC) for sum-rate maximization in two-way AF MIMO relaying

The problem of sum-rate maximization in two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying is considered. Mathematically, this problem is equivalent to the constrained maximization of the product of quadratic ratios that is a non-convex problem. Such problems appear also in many other applications. This problem can be further relaxed into a difference-of-convex functions (DC) programming problem, which is typically solved using the branch-and-bound method without polynomial-time complexity guarantees. We, however, develop a polynomial-time convex optimization-based algorithm for solving the corresponding DC programming problem named polynomial-time DC (POTDC). POTDC is based on a specific parameterization of the problem, semi-definite programming (SDP) relaxation, linearization, and iterations over a single parameter. The complexity of the problem solved at each iteration of the algorithm is equivalent to that of the SDP problem. The effectiveness of the proposed POTDC method for the sum-rate maximization in two-way AF MIMO relay systems is shown.
Analysis of urban heat island effect using k-means clustering

The characteristics of the urban heat island effect were often examined using urban heat island intensity (UHII). We collected daily mean, maximum and minimum temperature data from the Kaifeng Weather Station in the Kaifeng City and Huibei Station in the surrounding rural area for 2004–2008. Daily UHIIs calculated from daily mean, maximum and minimum temperature were regarded as components of vectors in a 3-D space and they clustered using the k-means algorithm. Clustering results showed that there was usually a slight UHI for most days, while sometimes nocturnal UHI effect was significant. There were very few cases with extremely obvious UHI effect and cooling effect was unignorable. The clustering results confirmed the graphical interpretations. The clustering method presented in this paper provides an alternative way for analysis of UHI effect.
On decoding product lattices

A product lattice is a high-dimensional lattice constructed using two lower dimensional lattices, in equivalence to binary product block codes constructed from two lower dimensional binary block codes. However, decoding methods typically used for binary product codes do not necessarily apply to product lattices. In this work several approaches for decoding product lattices are presented. In particular, bounded-distance decoding, which relies on the fact that all the rows and columns of the product lattice are points in the component lattices, is detailed. This property of product lattices enables one to efficiently decode the product lattice by employing separate decoders for the (much smaller dimensional) component lattices. Measures for the efficiency of these decoding methods are derived, and it is shown, also by means of computer simulation, that they are comparable to known decoding methods of lattices both in terms of effective coding gain and complexity.
OBILE A REA M APPING R OBOT WITH 16 DOF

RAFI is a self-driven mapping robot with 16 Degrees-of-Freedom (DOF). Its software development, structural and electrical design and mechanical construction are presented in this paper. RAFI moves with wheels having differential type motion with 2DOF. The head has 3 DOF sufficient for volumetric mapping by rotating the head in different directions and both hands have 5 DOF to empower its grip and carrying. An 8-bit microcontroller is used to control all the motors. 4 Ultrasonic-rangefinders have been used for obstacle-detection and avoidance which are also interfaced with the same microcontroller. Its head is equipped with two identical webcams for stereoscopic vision for generating 3D map of the field of view after generating disparity map. To optimize the computational speed and mapping accuracy images of 640×480 resolution are 85% compressed and dynamic programming with image pyramiding by quadpyramid without sub-pixel estimation is pursued.
HUBUNGAN ANTARA KECERDASAN EMOSIONAL DENGAN INTENSI BERMEDIA SOSIAL PADA SISWA SMA NEGERI 11 SEMARANG

Perkembangan teknologi yang terjadi di Indonesia memberikan dampak baik positif dan negatif. Dampak positif yang terjadi adalah semakin update terhadap informasi terbaru. Akan tetapi, dampak negatifnya yaitu kesalahan dalam penggunaan media sosial yang menyebabkan timbulnya konflik. Penelitian ini merupakan penelitian korelasional yang bertujuan untuk mengetahui hubungan antara kecerdasan emosional dengan intensi bermedia sosial. Kecerdasan emosional yang tinggi merupakan hal penting karena akan memengaruhi perilaku bermedia sosial dengan tepat. Subjek penelitian terdiri dari 300 siswa SMA kelas X dan XI yang memiliki minimal dua media sosial serta aktif menggunakan media sosial. Sampel ditentukan dengan teknik cluster random sampling. Pengumpulan data menggunakan Skala Kecerdasan Emosional (31 aitem, α = 0,889) dan Skala Intensi Bermedia Sosial (22 aitem, α = 0,895). Analisis regresi sederhana menunjukkan adanya hubungan negatif yang signifikan antara kecerdasan emosional dengan intensi bermedia sosial (rxy = -0,287; p < 0,001), yang berarti bahwa semakin tinggi kecerdasan emosional maka semakin rendah intensi bermedia sosial. Kecerdasan emosional memberikan sumbangan sebesar 8,2% terhadap intensi bermedia sosial. Intensi bermedia sosial siswa SMA Negeri 11 Semarang sebagian besar berada pada kategori rendah (N=202;67,33%) dan kecerdasan emosionalnya sebagian besar berada pada kategori tinggi (N=212;70,67).
Learning rotation-aware features: From invariant priors to equivariant descriptors

Identifying suitable image features is a central challenge in computer vision, ranging from representations for low-level to high-level vision. Due to the difficulty of this task, techniques for learning features directly from example data have recently gained attention. Despite significant benefits, these learned features often have many fewer of the desired invariances or equivariances than their hand-crafted counterparts. While translation in-/equivariance has been addressed, the issue of learning rotation-invariant or equivariant representations is hardly explored. In this paper we describe a general framework for incorporating invariance to linear image transformations into product models for feature learning. A particular benefit is that our approach induces transformation-aware feature learning, i.e. it yields features that have a notion with which specific image transformation they are used. We focus our study on rotation in-/equivariance and show the advantages of our approach in learning rotation-invariant image priors and in building rotation-equivariant and invariant descriptors of learned features, which result in state-of-the-art performance for rotation-invariant object detection.
Eecient L O W-contention Parallel Algorithms

The queue read queue write qrqw parallel random access machine pram model permits concurrent reading and writing to shared memory locations but at a cost propor tional to the number of readers writers to any one memory location in a given step The qrqw pram model re#ects the contention properties of most commercially available par allel machines more accurately than either the well studied crcw pram or erew pram models and can be e ciently emulated with only logarithmic slowdown on hypercube type non combining networks This paper describes fast low contention work optimal randomized qrqw pram algorithms for the fundamental problems of load balancing multiple compaction gener ating a random permutation parallel hashing and distributive sorting These logarith mic or sublogarithmic time algorithms considerably improve upon the best known erew pram algorithms for these problems while avoiding the high contention steps typical of crcw pram algorithms An illustrative experiment demonstrates the performance advantage of a new qrqw random permutation algorithm when compared with the pop ular erew algorithm Finally this paper presents new randomized algorithms for integer sorting and general sorting Supported in part by NSF grant CCR and Texas Advanced Research Projects Grants and
Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work

We review recent work done by our group on applying genetic algorithms (GAs) to the design of cellular automata (CAs) that can perform computations requiring global coordination. A GA was used to evolve CAs for two computational tasks: density classi cation and synchronization. In both cases, the GA discovered rules that gave rise to sophisticated emergent computational strategies. These strategies can be analyzed using a \computational mechanics" framework in which \particles" carry information and interactions between particles e ects information processing. This framework can also be used to explain the process by which the strategies were designed by the GA. The work described here is a rst step in employing GAs to engineer useful emergent computation in decentralized multi-processor systems. It is also a rst step in understanding how an evolutionary process can produce complex systems with sophisticated collective computational abilities.