Miracle-dz/UniFAR-FTUs huggingface dataset:
Method of improved hardware redundancy for automotive system

Performance improvements in transistors have also brought about lower threshold voltages and tighter noise margins. Therefore, microprocessors are becoming more vulnerable to transient faults, and Lockstep is a technology that has been developed to provide a good method to address such transient faults. In Lockstep, two processors perform and compare the same computation during every cycle. Consequently, transient faults can be detected with a high fault-detection rate. However, this technique only gives a warning of wrong information or executes a reset simply by comparing replications of the data in the cores. Thus, they are not appropriate for real-time systems used in the automotive industry. To this end, we propose a method to provide hardware redundancy in a system. This system uses an extra core and a voting algorithm when a fault occurs, and it is appropriate for real-time systems.
Mixed-Initiative Goal Manipulation

Mixed-initiative planning systems attempt to integrate human and AI planners so that the synthesis results in high-quality plans. In the AI community, the dominant model of planning is search. In state-space planning, search consists of backward and forward chaining through the effects and preconditions of operator representations. Although search is an acceptable mechanism to use in performing automated planning, we present an alternative model to present to the user at the interface of a mixed-initiative planning assistant. That is, we propose to model planning as a goal-manipulation task. Here planning involves moving goals through a hyperspace in order to reach equilibrium between available resources and the constraints of a dynamic environment. The users can establish and "steer" goals through a visual representation of the planning domain. They can associate resources with particular goals and shift goals along various dimensions in response to changing conditions as well as change the structure of previous plans. Users need not know the details of the underlying technology, even when search is used within. This article empirically examines user performance under both the search and the goal-manipulation models of planning and shows that many users do better with the latter.
Lack of Entrepreneurial Skills and the Complexity of Technological Progress

In standard endogenous growth models, the higher the research e¤ort the higher is the innovation rate of the economy. Innovating, however, is a complex process that requires an entrepreneur to implement a valuable invention. Hence when research and entrepreneurial skills compete in the allocation of aggregate resources, the relation between growth and R&D is hump-shaped. This paper proposes a model of endogenous growth in which returns to R&D can be decreasing since research e¤ort crowds out more socially useful entrepreneurial skills. When so, innovation should be promoted by encouraging entrepreneurship rather than research. JEL Classi.cation: O32, O40, J24.
Holomorphic mappings between hyperquadrics with small signature difference

In this paper, we study holomorphic mappings sending a hyperquadric of signature $\ell$ in ${\Bbb C}^n$ into a hyperquadric of signature $\ell'$ in ${\Bbb C}^N$. We show (Theorem 1.1) that if the signature difference $\ell'-\ell$ is not too large, then the mapping can be normalized by automorphisms of the target hyperquadric to a particularly simple form and, in particular, the image of the mapping is contained in a complex plane of a dimension that depends only on $\ell$ and $\ell'$, and not on the target dimension $N$. \ We also prove a Hopf Lemma type result (Theorem 1.3) for such mappings.
Detection of courtesy amount block on bank checks

This paper discusses a technique for locating the courtesy amount block on bank checks. In the analysis and recognition process, connected components in the image are identified first. Then, strings are constructed on the basis of proximity and horizontal alignment of characters. Next, a set of rules and heuristics are applied to these strings to choose the correct one. The chosen string is only accepted if it passes a verification test, which includes an attempt to recognize the currency sign. A deterministic finite automaton system is then used for segmenting the handprinted courtesy amount. Finally, the separated components are passed on to a neural network based recognition system.
Exposed Die-Top Encapsulation Molding for an Improved High- Performance Flip Chip BGA Package

The recent advancement in high- performance semiconductor packages has been driven by the need for higher pin count and superior heat dissipation. A one-piece cavity lid flip chip ball grid array (BGA) package with high pin count and targeted reliability has emerged as a popular choice. The flip chip technology can accommodate an I/O count of more than five hundreds500, and the die junction temperature can be reduced to a minimum level by a metal heat spreader attachment. None the less, greater expectations on these high-performance packages arose such as better substrate real estate utilization for multiple chips, ease in handling for thinner core substrates, and improved board- level solder joint reliability. A new design of the flip chip BGA package has been looked into for meeting such requirements. By encapsulating the flip chip with molding compound leaving the die top exposed, a planar top surface can be formed. A, and a flat lid can then be mounted on the planar mold/die top surface. In this manner the direct interaction of the metal lid with the substrate can be removed. The new package is thus less rigid under thermal loading and solder joint reliability enhancement is expected. This paper discusses the process development of the new package and its advantages for improved solder joint fatigue life, and being a multichip package and thin core substrate options. Finite-element simulations have been employed for the study of its structural integrity, thermal, and electrical performances. Detailed package and board-level reliability test results will also be reported
Meaningful Inner Link Objects for Automatic Text Categorization

This paper presents a novel approach for automatic text categorization. The mainstream of the research on rule-based classifier regards document as a container of term, and generates rules by using the term distribution in documents. General speaking, there must be existed some kind of semantic relevance between term and paragraph in a document. We call it Meaningful Inner Link Objects-MILO which must be varied with different semantics of a document itself. While this paper concentrates on using these MILOs that associate with semantic relevance for text categorization, hence we focus on two problems: (1) finding the best MILOs which associate with semantic relevance; and (2) using these specific MILOs to build a classifier for text categorization. From the experiment results, our proposed classification approach base on MILO has a better accuracy while other state of the art technique without considering the relevance between term and paragraph.
Grapevine Rootstocks Differentially Affect the Rate of Ripening and Modulate Auxin-Related Genes in Cabernet Sauvignon Berries

In modern viticulture, grafting commercial grapevine varieties on interspecific rootstocks is a common practice required for conferring resistance to many biotic and abiotic stresses. Nevertheless, the use of rootstocks to gain these essential traits is also known to impact grape berry development and quality, although the underlying mechanisms are still poorly understood. In grape berries, the onset of ripening (véraison) is regulated by a complex network of mobile signals including hormones such as auxins, ethylene, abscisic acid, and brassinosteroids. Recently, a new rootstock, designated M4, was selected based on its enhanced tolerance to water stress and medium vigor. This study investigates the effect of M4 on Cabernet Sauvignon (CS) berry development in comparison to the commercial 1103P rootstock. Physical and biochemical parameters showed that the ripening rate of CS berries is faster when grafted onto M4. A multifactorial analysis performed on mRNA-Seq data obtained from skin and pulp of berries grown in both graft combinations revealed that genes controlling auxin action (ARF and Aux/IAA) represent one of main categories affected by the rootstock genotype. Considering that the level of auxin tightly regulates the transcription of these genes, we investigated the behavior of the main gene families involved in auxin biosynthesis and conjugation. Molecular and biochemical analyses confirmed a link between the rate of berry development and the modulation of auxin metabolism. Moreover, the data indicate that this phenomenon appears to be particularly pronounced in skin tissue in comparison to the flesh.
MoteLab: a wireless sensor network testbed

As wireless sensor networks have emerged as a exciting new area of research in Computer Science, many of the logistical challenges facing those who wish to develop, deploy, and debug applications on realistic large-scale sensor networks have gone unmet. Manually reprogramming nodes, deploying them into the physical environment, and instrumenting them for data gathering is tedious and time-consuming.To address this need we have developed MoteLab, a Web-based sensor network testbed. MoteLab consists of a set of permanently-deployed sensor network nodes connected to a central server which handles reprogramming and data logging while providing a web interface for creating and scheduling jobs on the testbed. MoteLab accelerates application deployment by streamlining access to a large, fixed network of real sensor network devices; it accelerates debugging and development by automating data logging, allowing the performance of sensor network software to be evaluated offline. Additionally, by providing a web interface MoteLab allows both local and remote users access to the testbed, and its scheduling and quota system ensure fair sharing.We have developed and deployed MoteLab at Harvard and found it invaluable for both research and teaching. The MoteLab source is freely available, easy to install, and already in use at several other research institutions. We expect that widespread use of MoteLab will accelerate and improve wireless sensor network research.
Feature-based unsupervised clustering for supplier categorization

This paper outlines the feature-based unsupervised clustering for supplier categorization. Traditionally, when categorizing suppliers, companies have considered factors such as price, quality, flexibility etc. An enterprise is considered for design and manufacture with the objective of acquiring & developing a sophisticated technological base for systems and enlarging & expanding production of components. In this scenario, our intuition lies in supplier categorization based upon the selected features of suppliers. Lastly, we present results of segmentation of supplier data.
The Performance of MANET Routing Protocols for Scalable Video Communication

Mobile Ad-hoc Networks (MANETs) operate without infrastructure where nodes can move randomly. Therefore, routing in MANETs is a challenging task. In this paper we evaluate the performance of three important MANET routing protocols: Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR) when employed to forward scalable video contents. AODV and DSR are reactive protocols in that routing paths are established once needed. On the other hand, OLSR is a proactive routing protocol where routing information is exchanged and maintained continuously. The goal of the performance evaluation in this study is to assess the performance of AODV, DSR and OLSR in communicating scalable video contents. In the simulation part of this paper, a real video sequence is communicated where the characteristics and quality of the video decoded at receiver nodes are evaluated. NS2 along with extensions and other evaluation frameworks have been used to assess the performance of the MANET routing protocols when used for scalable video communication. The framework allows starting from a raw video that is encoded, packetized, transmitted through a network topology and collected at receiver to be decoded, played, and evaluated. Delay and timing constraints are taken into consideration when decoding the received video packets.
Severity assessment from an animal's point of view

Die Beurteilung der Belastung im Tierversuch stellt eine komplexe ethische und biomedizinische Herausforderung dar. Die Anforderungen an die Versuchstierkunde bezuglich der Belastungseinschatzung steigen stetig. Derzeit fehlen jedoch wissenschaftliche uberprufbare Messparameter um die Belastungen aus Sicht der Tiere einschatzen zu konnen. Die Interpretation von Verhaltensdaten und physiologischer Parameter im Zusammenhang mit tierlichem Wohlergehen ist nicht immer eindeutig; anstelle valider wissenschaftlicher Kriterien tritt mitunter ein „Bauchgefuhl“ des Beurteilenden. Dieser Ubersichtsartikel diskutiert die besondere Bedeutung, die Tiere selbst bei Belastungseinschatzung zu „befragen“. In Wahlversuchen konnen die Tiere zwischen verschiedenen Ressourcen wahlen. Die Bevorzugung eines Gutes gegenuber einem anderen fuhrt dann aber nicht zwangslaufig zu Leid, wenn das Tier keinen Zugang zum praferierten Gut hat. Um die Praferenzen der Tiere besser beurteilen zu konnen, besteht ein dringender Bedarf fur aussagekraftigere Praferenztests. Ferner konnen Tiere ublicherweise nicht frei entscheiden, ob sie an bestimmten Versuchen teilnehmen wollen. In Tierversuchen getestet zu werden, konnte den emotionalen Status der Tiere messbar beeintrachtigen. Zwar sind die inneren emotionalen Zustande nicht immer offensichtlich, sie konnen jedoch mit Hilfe des Erwartungsvalenztests experimentell sichtbar gemacht werden. Dieses Verfahren gibt Aufschluss uber die Erwartungshaltung der Tiere gegenuber zukunftigen Ereignissen, anthropomorph formuliert, ob sie die Zukunft eher „optimistisch“ oder „pessimistisch“ sehen. Eine Erweiterung dieses Erwartungsvalenztests fur Mause konnte eine umfassendere Belastungseinschatzung moglich machen, die auch die emotionalen Zustande der Tiere berucksichtigt. Die hier vorgeschlagenen Methoden zielen auf eine Belastungseinschatzung aus Sicht der Tiere ab, indem deren Praferenz und Erwartungsvalenz mit einbezogen werden.
Face recognition based on Two-Dimensional Discriminant Locality Preserving Projection

Locality Preserving Projection is a method which can extract the feature and reduce dimensionality effectively, which has been widely used in face recognition. However, it is also an unsupervised method, and it is an image vector-based method, needing to covert the face image into a vector. This conversion not only breaks the local structural information, but also brings lots of problems, such as the dimension of these converted vectors is too high and encounters the small sample size problem. And it is also an unsupervised method and has no directly relation to classification. In order to improve the performance of LPP, we present a method named Two-Dimensional Discriminant Locality Preserving Projection for extracting the feature and reduce dimensionality and apply it in face recognition. Experimental results on ORL and Yale databases suggest that the proposed 2DDLPP provides a better way to solve these problems and achieves lower error rates.
Estimating Trade Policy Models: An Empirical Study of Protection Policy in Turkey

This paper has two aims. A specific goal is to examine the determinants of protection policy in Turkey. A second, broader goal is to test the recent insights of the political economy models of trade policy and assess their contribution to the empirical investigation of associations between protection rate and industry characteristics. The paper develops a stylized model that captures the key common results of the new political economy models of trade policy, which show that import penetration and price elasticity of import demand act as weights in the relationship between an industry's protection rate and its political characteristics. We find that adhering to the specific functional form that the theory generates substantially improves the explanatory power of industry characteristics in our econometric work on Turkish data. The results show that protection rate is higher for industries with smaller, less capital-intensive firms and low wage workers. Interestingly, these effects vanish when such firms are publicly owned. These outcomes suggest that the risk-mitigating role of trade barriers is an important factor driving government policy in Turkey. The finding implies that continued move toward openness to international trade require progress in fiscal systems or domestic and international institutions that can deal with the economic insecurities generated by globalization.
On-Board Perception and Motion Planning for Legged Locomotion over Rough Terrain

This paper addresses the issues of perception and motion planning in a legged robot walking over a rough terrain. The solution takes limited perceptual capabilities of the robot into account. A passive stereo camera and a 2D laser scanner are considered for sensing the terrain, with environment representations matching the uncertainty characteristics of these sensors. The motion planner adheres to the dual-representation concept by applying the A⋆ algorithm for strategic level planning on a coarse elevation grid from stereo data, and then using a RRTbased method to find a sequence of feasible motions on a more precise but smaller map obtained by using the laser data. Results of simulations and experiments on real data are provided.
Using Java for Discrete Event Simulation

A discrete event simulation library has been written in the Java language, based on the SIM++ library for C++. This allows live simulations to be incorporated into web pages and run remotely. This paper presents a performance comparison with the equivalent C++ simulator and discusses advantages and disadvantages of Java as a simulation language. 1 Motivation The primary purpose of writing simulations in the Java language was to allow \live diagrams" to be incorporated into documents describing the behaviour of computer architectures. Using Java, other people can experiment with a working simulation model by clicking on a web link. This contrasts with using a traditional simulation language written in Simula or C++, where exporting simulation code requires recompilation and installation on each diierent machine. Java incorporates the language features necessary for simulation, notably objects and threads. Current Java implementations compile down to an intermediate byte code, which is interpreted. Thus the main disadvantage of using Java is expected to be longer simulation run times compared with a native C++ compiler. This penalty is quantiied in section 6. SIM++, a discrete event simulation library for C++ written by Jade Simulations Inc 5] has been used for computer architecture simulations as
Boolean Factor Analysis of Multi-Relational Data

The Boolean factor analysis is an established method for analysis and preprocessing of Boolean data. In the basic setting, this method is designed for finding factors, new variables, which may ex- plain or describe the original input data. Many real-world data sets are more complex than a simple data table. For example almost every web database is composed from many data tables and relations between them. In this paper we present a new approach to the Boolean factor analy- sis, which is tailored for multi-relational data. We show our approach on simple examples and also propose future research topics.
A new design method for two-channel perfect reconstruction IIR filter banks

In this paper, a new method for designing perfect reconstruction (PR) two-channel causal stable IIR filter banks is introduced. It is based on a structure previously proposed by Phoong et al. (1995). By using a combination of allpass and linear-phase FIR functions, the bumping problem found in the conventional structural PR filter bank is significantly suppressed. The design problem is formulated as a polynomial approximation problem and is solved effectively using the Remez exchange algorithm. Filter banks with flexible stopband attenuation and system delay can readily be obtained using the proposed algorithm.
PARSe : Power-efficient Architecture for Resource-discovery and Small-transfers in Large-Scale Ad Hoc Networks

Resource discovery requests and small transfers are likely to constitute a significant portion of the flows in emerging classes of ad hoc networks. In these applications the query or transferred object is carried within the request message itself. Route discovery for such requests incurs much more communication overhead (and hence power) than the actual data transfer. Especially for large-scale networks, it is quite costly to establish shortest path routes for such types of requests. Existing approaches for routing in ad hoc networks attempt to find and maintain high quality routes. Such approaches may be suitable for prolonged transfers, but not for small ones. In this paper, we present a new architecture that is geared towards resource discovery and small transfers in large-scale ad hoc networks. In our approach we aim at reducing the total energy consumption of successful delivery as opposed to finding high quality routes. We do not assume knowledge of node locations. In our architecture, a mobile node knows information about nodes in its zone, up to R hops away. We introduce the notion of contacts that extend beyond the zone and act as short cuts to reduce the degrees of separation between the request source and the target. We introduce several protocols to implement different policies for the search. We also propose a simple mobility-based scheme for object replication. We evaluate the performance of our protocols, mainly in terms of energy consumption and request success rate. We carry out extensive simulations to investigate the design dimensions and to compare our architecture to other related protocols, including flooding and border-casting. Our results show that significant savings may be achieved using our contact-based PARSe technique. For large networks and high request rates, PARSe consumes as little as 5.5% of flooding energy and 13.5% of border-cast energy. The study also shows reasonable settings of parameters that work well for a wide range of network sizes, up to 32,000 nodes. Our protocols may be easily implemented using simple extensions to zone-routing protocols.