Miracle-dz/UniFAR-FTUs huggingface dataset:
COSMOS: a codesign approach for communicating systems

This paper presents COSMOS, a method for modeling and synthesis of complex communicating systems. COSMOS starts from a system-level specification based on an extended finite state machine model allowing for the specification of complex protocols. System-level synthesis is composed of three tasks: partitioning systems into inter-dependent sub-systems, inter-sub-system communication synthesis and architecture generation. The output is a flexible architecture model which includes both hardware and software components. The paper concerns a set of parallel processors communicating through well defined protocols. <<ETX>>
Trust building behaviour within the Balinese fresh produce industry

Regression analysis confirms that relational satisfaction communication and the availability of alternatives have a significant positive relationship on the development of trust between vegetable farmers and traders in Bali. While no relationship between power/dependence and a strong personal relationship was found to influence trust, themaking of relational investments by traders had a significant negative relationship on trust, suggesting that such investments provide farmers with few tangible benefits.
Finding Rumor Sources on Random Graphs

We consider the problem of detecting the source of a rumor (information diffusion) in a network based on observations about which set of nodes posses the rumor. In a recent work [10] by the authors, this question was introduced and studied. The authors proposed rumor centrality as an estimator for detecting the source. They establish it to be the maximum likelihood estimator with respect to the popular Susceptible Infected (SI) model with exponential spreading time for regular trees. They showed that as the size of infected graph increases, for a line (2-regular tree) graph, the probability of source detection goes to 0 while for d-regular trees with d 3 the probability of detection, say d, remains bounded away from 0 and is less than 1=2. Their results, however stop short of providing insights for the heterogeneous setting such as irregular trees or the SI model with non-exponential spreading times. This paper overcomes this limitation and establishes the effectiveness of rumor centrality for source detection for generic random trees and the SI model with a generic spreading time distribution. The key result is an interesting connection between a multi-type continuous time branching processes (an equivalent representation of a generalized Polya’s urn, cf. [1]) and the effectiveness of rumor centrality. Through this, it is possible to quantify the detection probability precisely. As a consequence, we recover all the results of [10] as a special case and more importantly, we obtain a variety of results establishing the universality of rumor centrality in the context of tree-like graphs and the SI model with a generic spreading time distribution.
Perceptually based approach to color quantization

The process of selecting a small number of representative colors from an image of higher color resolution is called color image quantization. The ultimate goal of color image quantization is to minimize visible distortion. While its application as a frame buffer technique requires that algorithm efficiency is crucial. In this paper, a significantly faster quantization strategy than previous methods: median cut, variance, or octree-based algorithms, etc., is suggested. The new perceptually algorithm integrated with gamma correction produces result approximately as accurate as previous methods. Overall, the new proposed method is a preferable tradeoff between the quantizer complexity and visible distortion of the quantized image.
Light-weight secrecy system using channels with insertion errors: Cryptographic implications

A model of an encryption approach is analyzed from an information-theoretic point of view. In the model, an attacker faces the problem of observing messages through a concatenation of a binary symmetric channel and a channel with randomly inserted bits. The paper points out to a number of security related implications resulting from employing an insertion channel. It is shown that deliberate and secret-key-controlled insertions of random bits into the basic ciphertext provide a security enhancement of the resulting encryption scheme.
On sequential decoding for the Gilbert channel

It is well known that the computational performance of sequential decoding deteriorates greatly when channel errors occur in clusters, as in Gilbert channels. A way of using sequential decoding to exploit the memory of a Gilbert channel that alleviates this problem is presented. A Fano-like metric matched to this channel is used. The method is investigated by simulating sequential decoding utilizing the stack algorithm. The simulations confirm the feasibility of the technique. >
SocialAware: Context-aware multimedia presentation via mobile social networks

Date The final copy of this thesis has been examined by the signatories, and we find that both the content and the form meet acceptable presentation standards of scholarly work in the above mentioned discipline. The rise of online social networking and mobile computing presents a unique opportunity for context-aware computing. In this thesis, I present a framework for building social-networking-enabled context-aware services, called SocialAware, and two prototype applications that implement this architecture. The first application, called SocialAwareTunes, is a context-aware music jukebox player that plays music which reflects the preferences of a group of co-located users. The second application, called SocialAwareFlicks, is a context-aware video system that plays movie trailers which reflect the preferences of one or more users watching a video display together. These two prototype applications demonstrate the feasibility of the SocialAware framework, and point to the potential for some interesting future work. Dedication To my family and friends, who are my invaluable advisors. v Acknowledgements Many people were helpful in the creation of this thesis, and I'm grateful to all of them. I'd like to thank my advisor, Rick Han, for his guidance throughout this work. Thanks to my committee members, Leysia Palen and Shiv Mishra, for their feedback and support. A number of fellow graduate students were helpful along the way. In particular, Aaron Beach stands out. Our collaborative efforts have proved invaluable. Finally, I thank my family and friends for their patience, support, and understanding .
N-Phenylpropyl-N′-(3-methoxyphenethyl)piperazine (YZ-185) Attenuates the Conditioned-Rewarding Properties of Cocaine in Mice

Sigma receptor antagonists diminish the effects of cocaine in behavioral assays, including conditioned place preference. Previous locomotor activity experiments in mice determined that the sigma receptor ligand YZ-185 (N-phenylpropyl-N′-(3-methoxyphenethyl)piperazine) enhanced cocaine-induced hyperactivity at a lower (0.1 μmol/kg) dose and dose-dependently attenuated cocaine-induced hyperactivity at higher (3.16–31.6 μmol/kg) doses. The present study investigated the effect of YZ-185 on cocaine's conditioned-rewarding properties in mice. YZ-185 (0.1, 0.316, 3.16, and 31.6 μmol/kg) did not have intrinsic activity to produce conditioned place preference or aversion. A higher (31.6 μmol/kg) YZ-185 dose, but not lower (0.1–3.16 μmol/kg) YZ-185 doses, prevented the development of place preference to cocaine (66 μmol/kg). YZ-185 did not alter the expression of cocaine place preference. To further characterize YZ-185's behavioral profile, its effects in the elevated zero maze and rotarod procedures were also determined; YZ-185 produced no significant change from baseline in either assay, indicating that the sigma receptors probed by YZ-185 do not regulate anxiety-like or coordinated motor skill behaviors. Overall, these results suggest that YZ-185 is a sigma receptor antagonist at the 31.6 μmol/kg dose and demonstrate that sigma receptors can mediate the development of the conditioned-rewarding properties of cocaine.
Buzzenger: Asynchronous (Time-Sliced) Missed Call Duration Messaging

We describe the Buzzenger project, a mobile phone based missed-call-duration interpretation project that makes use of a time-sliced messaging communication protocol useful for transmitting small data packets that can form complete messages at no cost. This project takes the basic beeping habits (missed calling/flashing) and extends them into a formalized messaging protocol. This can be particularly useful for sending small structured messages at no cost where useful applications can be developed for emergency situations, feedback, etc. where the user doesn’t have sufficient funds (phone credit) to place a call or send an SMS.
Reducing Asset Weights' Volatility by Importance Sampling in Stochastic Credit Portfolio Optimization

The objective of this paper is to study the effect of importance sampling (IS) techniques on stochastic credit portfolio optimization methods. I introduce a framework that leads to a reduction of volatility of resulting optimal portfolio asset weights. Performance of the method is documented in terms of implementation simplicity and accuracy. It is shown that the incorporated methods make solutions more precise given a limited computer performance by means of a reduced size of the initially necessary optimization model. For a presented example variance reduction of risk measures and asset weights by a factor of at least 350 was achieved. I finally outline how results can be mapped into business practice by utilizing readily available software such as RiskMetrics� CreditManager as basis for constructing a portfolio optimization model that is enhanced by means of IS. Dieser Beitrag soll die Auswirkung der Anwendung von Importance Sampling (IS) Techniken in der stochastischen Kreditportfoliooptimierung aufzeigen. Es wird ein Modellaufbau vorgestellt, der zu einer deutlichen Reduktion der Volatilitat der Wertpapieranteilsgewichte fuhrt. Durch eine Darstellung der verhaltnismasig einfachen Berucksichtigung der Importance Sampling Technik im Optimierungsverfahren sowie durch ein empirisches Beispiel wird die Leistungsfahigkeit der Methode dargelegt. In diesem Anwendungsbeispiel kann die Varianz der Schatzer sowohl fur die Risikomase als auch fur die optimalen Anteilsgewichte um einen Faktor von mindestens 350 reduziert werden. Es wird somit gezeigt, dass die hier vorgestellte Methode durch eine Reduktion der Grose des ursprunglich notwendigen Optimierungs-problems die Genauigkeit von optimalen Losungen erhoht, wenn nur eine begrenzte Rechnerleistung zur Verfugung steht. Abschliesend wird dargelegt, wie die Losungsansatze in der Praxis durch eine Ankopplung an existierende Softwarelosungen im Bankbetrieb umgesetzt werden konnen. Hierzu wird ein Vorgehen skizziert, das auf den Ergebnissen des Programms CreditManager von RiskMetrics ein Portfoliooptimierungsmodell aufbaut. Dieses wird um eine Importance Sampling Technik erweitert.
Expansion resetting for recovery from fatal error in Monte Carlo localization - comparison with sensor resetting methods

Though Monte Carlo localization is a popular method for mobile robot localization, it requires a method for recovery of large estimation error in itself. In this paper, a recovery method, which is named an expansion resetting method, is newly proposed. A blending of the expansion resetting method and another, which is called the sensor resetting method, is also proposed. We then compared our methods and others in a simulated RoboCup environment. Typical accidents for mobile robots were produced in the simulator during trials. We could grasp the characteristics of each method. Especially, the blending method was robust against the kidnapped robot problems.
AXTAR: mission design concept

The Advanced X-ray Timing Array (AXTAR) is a mission concept for X-ray timing of compact objects that combines very large collecting area, broadband spectral coverage, high time resolution, highly flexible scheduling, and an ability to respond promptly to time-critical targets of opportunity. It is optimized for submillisecond timing of bright Galactic X-ray sources in order to study phenomena at the natural time scales of neutron star surfaces and black hole event horizons, thus probing the physics of ultradense matter, strongly curved spacetimes, and intense magnetic fields. AXTAR's main instrument, the Large Area Timing Array (LATA) is a collimated instrument with 2-50 keV coverage and over 3 square meters effective area. The LATA is made up of an array of supermodules that house 2-mm thick silicon pixel detectors. AXTAR will provide a significant improvement in effective area (a factor of 7 at 4 keV and a factor of 36 at 30 keV) over the RXTE PCA. AXTAR will also carry a sensitive Sky Monitor (SM) that acts as a trigger for pointed observations of X-ray transients in addition to providing high duty cycle monitoring of the X-ray sky. We review the science goals and technical concept for AXTAR and present results from a preliminary mission design study.
An architecture exploration framework for DSP applications

Advances in chip technology have enabled integrating many functional units on a single chip. This led to the emergence of the concept of system-on-chip (SoC) which is used extensively in the development of advanced embedded systems. Embedded systems are widely used today in different digital signal processing (DSP) applications that usually require high computation power and tight constraints. Using SoC technology increases the challenges facing the designer to choose the optimal design. A tool that helps explore different architectures is required to design an efficient system. In this paper we propose an implementation of an architecture exploration frame-work based on a multi-objective evolutionary algorithm (MOEA) for DSP applications. The design space is based on an experimental core library, and an analytical evaluation approach is used to speedup fitness calculation. Results obtained indicate that the proposed approach is valid and efficient for solving the architecture exploration problem.
Reducing International Risk through Quantity Contracts

We investigate a tool which small manufacturers engaging in international supply contracts can use to dampen the variations in their income caused by exchange rate uctuations. The method we study involves contractual speci cations for a minimum purchase quantity with the buyer. The particular case we consider is that of a smaller manufacturer providing a product to a large overseas corporation, where transactions are conducted in the manufacturer's domestic currency. The large corporation employs a periodic review inventory policy with back orders, incorporating unit, holding and penalty costs which may be statedependent. The state is the current exchange rate, which varies in a Markovian manner according to one of three considered models (random walk, mean reverting, and momentum). Demands for products arrive randomly and may also be state dependent, to a degree determined by the rate of pass through of exchange rate e ects. We rst establish that the optimal policy for the corporation is an order up to policy with state dependent thresholds. After establishing this, we use computer experimentation to investigate the e ect increasing the minimum purchase quantity has. This minimum order quantity transfers some of the cash ow variance to the customer, which in turn drives the corporation's holding/penalty costs up. To counteract this, the corporation will expect a discount from the smaller supplier. This gives rise to a mean/standard deviation frontier for the supplier's cash ow. We also study the e ects of increasing exibility in order quantity, increased supplier capacity, and the interactions between these two factors. GSIA Working Paper # 1997-42
Modified posterior vertebral column resection for Kümmell disease

Rationale: Kümmell's disease is defined as delayed traumatic vertebral collapse disease in which patients develop a kyphosis after asymptomatic minor spinal trauma. Both anterior approach and posterior approach have been reported, however, there is no standard treatment for Kümmell's disease. Patient concerns: We described a successful modified posterior vertebral column resection in a patient with Kümmell's disease. A 65-year-old woman reported persistent back pain for almost three months. Diagnoses: Kümmell's disease was diagnosed based on computer tomography (CT) and magnetic resonance imaging (MRI). Interventions: Modified posterior vertebral column resection combined with short-segment fixation was designed to treat this disease. Outcomes: The procedure was successful without any complications. Patient reported that symptoms were obviously improved in one week after operation. Lessons: Modified posterior vertebral column resection combined with short-segment fixation is an effective treatment option for Kümmell's disease.
CD47 Promotes Neuronal Development through Src- and FRG/Vav2-Mediated Activation of Rac and Cdc42

The development of axons and dendrites is controlled by small GTP-binding proteins of the Rho family, but the upstream signaling mechanisms responsible for such regulation remain unclear. We have now investigated the role of the transmembrane protein cluster of differentiation 47 (CD47) in this process with hippocampal neurons. CD47-deficient neurons manifested markedly impaired development of dendrites and axons, whereas overexpression of CD47 promoted such development. Interaction of SH2 domain-containing protein tyrosine phosphatase substrate-1 (SHPS-1) with CD47 also induced the formation of dendritic filopodia and spines. These effects of CD47 were prevented by inhibition of either cell division cycle 42 (Cdc42) or Rac. In CD47-deficient neurons, autophosphorylation of Src was markedly reduced. In addition, overexpression of CD47 promoted the autophosphorylation of Src. Inhibition of Src family kinases indeed prevented CD47-promoted dendritic development. Inhibition of either FGD1-related Cdc42-guanine nucleotide exchange factor (GEF) (FRG) or Vav2, which is a GEF for Cdc42 and Rac and is activated by Src, also prevented the effects of CD47 on dendritic development. These results indicate that CD47 promotes development of dendrites and axons in hippocampal neurons in a manner dependent, at least in part, on activation of Cdc42 and Rac mediated by Src as well as by FRG and Vav2.
Mining interesting patterns from hardware-software codesign data with the learning classifier system XCS

Embedded systems are composed of both dedicated elements (hardware components) and programmable units (software components), which have to interact with each other for accomplishing a specific task. One of the aims of hardware-software codesign is the choice of a partitioning between elements that will be implemented in hardware and elements that will be implemented in software is one of the important step in design. In this paper, we present an application of the learning classifier system XCS to the analysis of data derived from hardware-software codesign applications. The goal of the analysis is the discovering or explicitation of existing interelationships among system components, which can be used to support the human design of embedded systems. The proposed approach is validated on a specific task involving a digital sound spatializer.
MeshToSS: Converting Subdivision Surfaces from Dense Meshes

The theoretical aspects are discussed of our developed software, MeshToSS, for the conversion to Loop subdivision surfaces of dense triangular meshes. This software generates subdivision surfaces that approximate to their original mesh. The output is either a control mesh or its subdivided mesh applied to the Loop subdivision scheme. Our simple approach for the conversion is based on a well-known mesh simplification technique that applies a sequence of edge collapse operations. We show that this enables fast and flexible conversion to subdivision surfaces.
Thematic Review Series: The Immune System and Atherogenesis. Molecular mechanisms regulating monocyte recruitment in atherosclerosis Published, JLR Papers in Press, June 16, 2005. DOI 10.1194/jlr.R500008-JLR200

Cardiovascular disease, a progressive disorder characterized by the accumulation of lipids in the artery wall, is a leading cause of death in Western societies. One of the initial events in atherogenesis involves the recruitment of inflammatory cells from the circulation into the developing lesion. Studies during the past decade have underscored the role of inflammatory mediators in disease initiation and progression. Critical progress has been made in our understanding of the complex mechanisms by which monocytes, macrophages, and T-cells accumulate in atherosclerotic plaques. Experimental research has identified several candidate adhesion proteins and chemokines that are critically involved in the recruitment process, and encouraging data provide a mechanistic framework for new therapeutic targets. This review provides an overview of our current understanding of the mechanisms that direct the recruitment of monocytes to, and their retention in, atherosclerotic lesions.
An effective cache overlapping storage structure for SMT processors

Simultaneous multithreaded (SMT) processors improve the instruction throughput by allowing fetching and running instructions from several threads simultaneously at a single cycle. With the number of running threads increasing, the performance of single thread degrades continually. One main reason of that is the competition of the limited cache resources among the threads and then causing the number of cache misses of the single thread increasing dramatically. In this paper, we propose an effective cache overlapping storage structure for SMT processors. The key idea is using several bits to encode the value of a data. If the value is a frequent value, it can be read or written through the encoding scheme and a table of frequent value. All the frequent values are encoded in a determined way. Then all the bytes that store frequent values in a cache line can be used to store other values at the same positions of a different line that maps to the same physical hardware. We find that this overlapping structure is useful for SMT processors to alleviate the cache competing problem of the threads and increasing the cache hit rates of them. Comparing with the other schemes, our scheme needs less hardware or organizes the cache in a different way, and can read and write without adding much latency. The implementation of our structure is simple. Execution-driven simulation results show that with a little hardware adding to the original cache our structure obtains a performance near to that obtained from a double sized one in an SMT processor.
On-Road Vehicle and Lane Detection

We implement lane detection using edge detection, Hough transforms, and vanishing point filtering in Hough space; the car detection is implemented by using histogram of oriented gradients feature descriptors and classified by linear support vector machines. Hard-negative mining is applied to alleviate detection of false positives; with the information of vanishing point along with prior knowledge such as the width of the lanes, we reconstruct the 3D ground plane and estimate the distance from the camera to the cars in the front from monocular vision. Keywords—Car detection, Lane detection, Hough transform, HOG, SVM, hard negative mining.