Miracle-dz/UniFAR-FTUs huggingface dataset:
System-on-Chip: Next Generation Electronics

The book provides a comprehensive and accessible source of the state-of-the-art information on existing and emerging SoC key research areas and will be invaluable source of information for graduate students and researchers. The book which has 25 chapters grouped into eight themes, provided by leading experts in the filed. Each chapter has background covering the basic principles, and extensive list of references. The themes are: 1. System level design, 2. Embedded Software, 3. Power reduction and management, 4. Reconfigurable computing, 5. Architectural synthesis, 6. Network on chip 7. Simulation and validation, 8. Manufacturing test
A Design Pattern Detection Plugin for Eclipse

It is well known that software maintenance and evolution are expensive activities, both in terms of invested time and money. Reverse engineering activities support the obtainment of abstractions and views from a target system that should help the engineers to maintain, evolve and eventually re-engineer it. An important task pursued by reverse engineering is design pattern detection, whose main objective is the identification of the design pattern instances that have been used in the implementation of a system, that let the practitioners focus on the overall architecture of the system without minding at the programming details it has been implemented with. In this context we propose an Eclipse plug-in called MARPLE (Metrics and Architecture Reconstruction Plug-in for Eclipse), which supports the detection of design patterns through the use of basic elements that are mechanically extracted from source code. The development of this platform is mainly based on the exploitation of the Eclipse framework, relying also on two plugins: Java development tools (JDT) for code analysis and the Graphical Editing Framework (GEF) for results visualization.
Compiling and executing finite domain constraints

Finite domain constraints are used for specifying and solving complex problems concerning resource allocation, scheduling, optimization, and veriica-tion; problems which are fundamental in industrial research and development. Our thesis develops new solver algorithms, compilation techniques, and programming methods for nite domain constraints. We deene a language FDC of nite domain constraints, which is closed under implication, conjunction, disjunction, negation and cardinality. FDC embeds a fair part of existing nite domain languages and is used as source language in the thesis. As target language we use FD, a language of index-icals, i.e. functions computing domains of variables. Two execution schemes for FDC are developed; one scheme is based solely on using indexicals to evaluate the constraints; the other is based on deep-guard concurrent constraint programming together with support for indexicals. In the indexical scheme, constraints in FDC are compiled into indexicals, where implication is treated as blocking, and disjunction as constructive. This is made possible by the support for conditional indexicals we have added to the original proposal for FD. Hence, the scheme requires no other support than a solver for conditional indexicals. The concurrent constraint scheme is based on AKL(FD), a deep-guard concurrent constraint programming language, which supports indexicals, and which performs conditional reasoning through entailment checking and constraint lifting. Using AKL(FD) we specify a scheme which executes implications and disjunctions in deep guards, and arithmetical constraints by conjunctions of library constraints, thereby subsuming the indexical scheme. We also develop some programming techniques speciic to AKL(FD), including disjunctive programming methods. The implementations of FD and AKL(FD) are described in detail, which include an optimized solver for indexicals, the emulator and the compiler for indexicals, the integration of FD with AKL, the search primitives and the compiler extensions added to AKL, entailment checking in AKL(FD), and constraint lifting. Also, the implementations are evaluated and shown to be competitive.
Valoración de opciones cuando la varianza no es constante

Resumen: En este trabajo se realiza evaluacion del valor de opciones financieras del tipo put y call europeas cuando los rendimientos del subyacente estan generados por procesos del tipo ARCH y GARCH, se comparancon los resultados obtenidos por el metodo de Black-Scholes que asume volatilidad constante. Para esto, se recurre a simulacion de Montecarlo, asi como de tecnicas econometricas para la estimacion de parametros. El campo de aplicacion es el mercado accionario colombiano. Se encuentra que la valoracion por el metodo de Black-Scholes subvalora el precio de las opciones. Abstract: This paper has the purpose to evaluate the valuation for put and call options when the performance of the underlying is generated by an ARCH and GARCH process, the results are compared against Black- Scholes method when the volatility is constant. For that, the Montecarlo Simulation is assumed and also some econometrics techniques for the parameters estimation. The application is focused for the Colombian stocks. The final results prove that the Black-Scholes method undervalues the option price.
Semántica interpretativa y textometría

Este artículo se apoya en una discusión informal sostenida de manera recurrente entre François Rastier y la autora del artículo, relativa a la pertinencia del acercamiento textométrico a los principios de la semántica interpretativa. En una primera aproximación, la textometría parece condenada a una representación demasiado trillada del texto: saco de palabras (ellas mismas entendidas como simples cadenas de caracteres), eliminación eventual de los hápax (que podrían ser lugares de singularidades significativas), tratamiento estadístico cuantitativo… Y, sin embargo, según el propio François Rastier, existe la experiencia notable de observa cómo el cálculo del intervalo-reducción pone en evidencia, en el mismo texto, las formas claves para la interpretación de una novela de Maupassant. Hay también en la “influencia interpretativa” los enriquecedores resultados de las tesis de Mathieu Valette con la hiperbase y los de Damon Mayafre. En efecto, ¿podemos ubicar adecuaciones esenciales entre la teoría de la semántica interpretativa y los principios fundadores del acercamiento textométrico? El lugar central de los textos en todas las etapas del análisis, la preocupación de permanecer lo más cerca posible del texto y evitar toda preconcepción reductora, el papel determinante del contexto global construido por el corpus de referencia, el funcionamiento diferencial de los cálculos contrastivos como de las selecciones… La apuesta sería hacer el balance de estas fuertes connivencias.Finalmente, la textometría suscita actualmente nuevas propuestas y nuevos desarrollos: sin duda, la semántica interpretativa puede alimentar la reflexión teórica subyacente y participar tanto en la concepción de funcionalidades pertinentes como en la elaboración de referencias metodológicas y la puesta a punto de interfaces. Pues, tanto para la textometría como para la semántica interpretativa, es en el marco de una actividad de recorrido del corpus como se construye y se afirma poco a poco un sentido.
Semi-implicit method of fast active contour models using iterative method for edge detection

In computational vision research, low-level tasks such as edge detection, stereo matching, and motion tracking have been widely emphasis as autonomous bottom-up processes. Active contours have also been widely applied for various applications in medical image processing. Semi-implicit AOS is very stable constraint on the size of the time step associated with explicit numerical schemes and will be adopted in our implementation. The proposed algorithm using iterative methods such as Jacobi, Gauss-Seidel and SOR will be implementing in object edge detection experiments performed on MRI images. MATLAB has been chosen as computational platform for the experiment implementation. It is well suited and widely used in the medical image processing for the monitoring and detection. The experimental results of the edge detection on medical images are illustrated in analysis section. As the conclusion the iterative method is the alternative scheme instead using direct method for accurate contours tracking of the medical image processing.
An event detection framework in video sequences based on hierarchic event structure perception

In this paper, we propose a framework for event detection based on hierarchic event structure perception. In order to modeling and recognizing semantic event, it is necessary to organize the spatial and temporal visual information into a meaningful representation. The main purpose of this paper is not to detect event in special domain, but to construct general event detection framework in perceptual manner and to provide meaningful unit in different semantic granularity. Specially, in the first stage fine-grained segmentation is preformed by bottom up processing that characteristics of salient regions serve as direct cues to identify temporal boundaries. Furthermore, top-down recognition module detects coarse-grain event by using HMMs to combine prior knowledge with spatio-temporal descriptors of fine-grain unit. The experimental results using different types of video sequences are presented to demonstrate the efficiency and accuracy of our proposed algorithm.
UniNE at FIRE 2010: Hindi, Bengali, and Marathi IR

In participating in this second FIRE evaluation campaign, our rst objective is to analyze the retrieval eectiveness of various indexing and search strategies when dealing with corpora written in Hindi, Bengali and Marathi languages. As a second goal, we have developed new and more aggressive stemming strategies for both Marathi and Hindi languages. We have compared their retrieval eectiveness with both light stemming strategy orn-gram language-independent approach. As another language-independent indexing strategy, we have evaluated the trunc-n method in which the indexing term is formed by considering only the rst n letters of each word. To evaluate these solutions we have used various IR models including models derived from Divergence from Randomness (DFR), Language Model (LM) as well as Okapi, or the classical tf idf vector-processing approach. For all three languages studied, our experiments tend to show that IR models derived from Divergence from Randomness (DFR) paradigm tend to produce the best overall results. For these languages, our various experiments demonstrate also that either an aggressive stemming procedure or the trunc-n indexing approach produces better retrieval eectiveness when compared to other word-based or language-independent approaches. Applying the Z-score as data fusion operator after a blind-query expansion tends also to improve the MAP of the merged run over the best single IR system.
Semiotic Criteria for Evaluating Instructional HyperMedia.

This report describes hypermedia as a non-linear interlinked representation of textual, graphic, visual and audio material, that enables students to connect large bodies of information while developing analytical skills necessary to think critically about this information. It is noted that the use of microcomputers for hypermedia instruction represents an instructionally innovative way for studente to manage information. The paper focuses on the use of a semiotic checklist to evaluate instructional hypermedia using HyperCard. Five semiotic criteria are presented and discussed: (1) intertexuality/intermediality, which emphasizes the linking of text directly with the author, its reactors, and its audience; (2) decentering and recentaring, which involves the user making his/her own interests the center of learning rather than the author's vision of the computer software; (3) mediating networking and navigating, in which learners control their own paths through the situated relations; (4) negotiating expert and novice boundaries, which emphasizes the necessity for instructional designers to account for the differences in expert and novice knowledge representations; and (5) boundaries of individual work, in which the boundaries of text are weakened by nonsequential reading and thinking. It is concluded that the increasing ease of access for users and the ease of development for non-programming as well as programming instructional designers requires systematic evidence on hypermedia's instructional dimensions. A criteria checklist is included. (47 references) (DB) *********************************************************************** Reproductions supplied by EDRS are the best that can be made from the original document. *********************************************************************** U.S. DEPARTMENT OF EDUCATION Office ol Educational Research and Improvement EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) CI This document has been reproduced as received from the person or organization originating it r Minor changes have been rn: de to improve reproduction quality Points ol pew or opinions staled in this docu ment do not necessarily represent official OERI position or policy Semiotic Criteria for Evaluating Instructional Hyper Media
Book Reviews: Challenges in Natural Language Processing

Preface Symposium participants Part I. Challenging Problems: 1. Critical changes for natural language processing Madeleine Bates, Robert J. Bobrow and Ralph M. Weischedel Part II. Building a Lexicon: 2. The contribution of lexicography B. T. Sue Atkins 3. The contribution of linguistics Beth Levin 4. The contribution of computational lexicology Branimar K. Boguraev Part III. Semantics and Knowledge Representation: 5. Events, situations and adverbs Robert C. Moore 6. Natural language, knowledge representation and logical form James F. Allen Part IV. Discourse: 7. Getting and keeping the center of attention Rebecca J. Passonneau 8. Surface structure, intonation and discourse meaning Mark Steedman Part V. Spoken Language Systems: 9. Prosody, intonation and speech technology Janet Pierrehumbert Part VI. Conclusion: 10. The future of computational linguistics Madeleine Bates and Ralph M. Weischedel Author index Subject index.
Strategi E-Pemasaran di dalam TransformasiPemasaran Penerbitan Buku

E-dagang adalah satu proses ekonomi baru yang melibatkan urusan jual beli, pemindahan atau pertukaran barangan, perkhidmatan dan/atau maklumat melalui jaringan komputer termasuk Internet. Melihat kepada apa yang dinyatakan oleh pelopor pengurusan tentang e-dagang, kesan sebenar revolusi Internet baru sahaja mula dirasai. Dengan itu, kajian berbentuk ulasan terperinci ini adalah untuk meneroka penggunaan strategik e-pemasaran dalam transformasi industri penerbitan. Ia membincangkan bagaimana strategi e-pemasaran menghasilkan transformasi industri penerbitan dari satu saluran tunggal pemasaran kepada pemasaran secara besar-besaran. Ia menghuraikan tentang strategi-strategi pengurusan dalam penggunaan teknologi-teknologi maklumat baru dalam pasaran dunia, tentang anjakan kuasa kompetitif antara pelbagai tingkat sepanjang rantaian bekalan industri penerbitan termasuk pembangunan-pembangunan semasa dalam e-pemasaran dari tempat pandangan pemegang saham implikasi-implikasi dan impak serta kemungkinan senario persekitaran perniagaan masa depan industri penerbitan. Kata Kunci: pemasaran, e-dagang, e-pemasaran, strategi pemasaran, model rantaian nilai, penerbitan buku.
Home Subnet Prefix or the Home Agent discovery for Mobile IPv6

The invention refers to an apparatus of the type for automatic identification and registration of bottles of different sizes and/or shapes advanced one after the other along a path, at least some bottles having glass of a high light transparency. The bottles pass through the ray path of a light source-photocell arrangement forming a detector unit. According to the invention, the detector unit comprises a matrix having a universally and systematically grouped array of photo cells in the side and height directions of the bottles, each of said photo cells being actuable by a different and directed light ray from a point-shaped light source, and being, by means of a programming unit, programmable to respond in predetermined patterns, corresponding to the bottle types to be identified, a plurality of detecting operations being performed at points determined by the matrix while a bottle is advanced a certain distance.
Hierarchical Document Clustering

INTRODUCTION Document clustering is an automatic grouping of text documents into clusters so that documents within a cluster have high similarity in comparison to one another, but are dissimilar to documents in other clusters. Unlike document classification (Wang, Zhou, and He, 2001), no labeled documents are provided in clustering; hence, clustering is also known as unsupervised learning. Hierarchical document clustering organizes clusters into a tree or a hierarchy that facilitates browsing. The parent-child relationship among the nodes in the tree can be viewed as a topic-subtopic relationship in a subject hierarchy such as the Yahoo! directory. This chapter discusses several special challenges in hierarchical document clustering: high dimensionality, high volume of data, ease of browsing, and meaningful cluster labels. State-ofthe-art document clustering algorithms are reviewed: the partitioning method (Steinbach, Karypis, and Kumar, 2000), agglomerative and divisive hierarchical clustering (Kaufman and Rousseeuw, 1990), and frequent itemset-based hierarchical clustering (Fung, Wang, and Ester, 2003). The last one, which was recently developed by the authors, is further elaborated since it has been specially designed to address the hierarchical document clustering problem.
Milagro Version 2 An Implicit Monte Carlo Code for Thermal Radiative Transfer: Capabilities, Development, and Usage

We have released Version 2 of Milagro, an object-oriented, C++ code that performs radiative transfer using Fleck and Cummings' Implicit Monte Carlo method. Milagro, a part of the Jayenne program, is a stand-alone driver code used as a methods research vehicle and to verify its underlying classes. These underlying classes are used to construct Implicit Monte Carlo packages for external customers. Milagro-2 represents a design overhaul that allows better parallelism and extensibility. New features in Milagro-2 include verified momentum deposition, restart capability, graphics capability, exact energy conservation, and improved load balancing and parallel efficiency. A users' guide also describes how to configure, make, and run Milagro2.
Is the TOEFL exam aimed at everyone? Research considerations in the training and application of the TOEFL exam abroad

In recent years, the Educational Testing System organisation has developed two models of the computer-based Test of English as a Foreign Language (TOEFL). However, the computerization of the test has shown a number of problems according to the testees' origin. This paper suggests some of these problems after conducting short interviews with four TOEFL teachers; i.e. problems in delivery, interface design and test taking contextual validity (Weir, 2005). These aspects and those presented in other educational systems need to be addressed in further research. The fact that TOEFL is only a compulsory test for those who wish to pursue further education in the USA cannot prevent ETS from ignoring the potential problems of the current model in different parts of the world. Thus, further research on this topic needs to be carried out in Europe and elsewhere. This paper also serves as a starting point for countries and institutions that may be considering the implementation of computer or Internet-based applications for high-stakes testing such as university entrance examinations.
Experimental Validation of a Novel Fuzzy Classifier Performance

This paper validates a novel fuzzy classification methodology using the ELENA benchmark (ftp://ftp.dice.ucl.ac.be/ pub/neural-net/ELENA/databases). The main advantage of this methodology is the high accuracy with which it learns the topological structure of the features space. The fuzzy subsets built by the classifier approximate with a very small error the areas in the features space corresponding to different categories. Its accuracy also manifests through handling with fine precision the discrimination inside overlapping areas. These two properties of the fuzzy classifier have been confirmed by the testing results obtained on ELENA benchmark datasets.
Technical Trends in P2P-Based Communications

This paper outlines and analyses major P2P technologies currently being actively studied at various research organisations or already in use in both business and personal environments. Various technical features of P2P as well as its history and market trends are shown. P2P principles focussing on discovery and network-organisational mechanisms of major P2P systems such as JXTA, SIONet, Freenet, and Chord are first summarised. Also, other technical issues related to delivery, network control, security, digital rights management, and distributed computing are described. Then, P2P technologies to promote next-generation community networks with autonomous and intelligent characteristics are addressed. Based on these, P2P applications are analysed and some examples are shown. Studies of P2P traffic measurement, which is difficult by using traditional evaluation methods, are taken up to consider total network design in the P2P era.
Forward Static Program Slicing

Program slicing is a practical disintegration methodology that omits program modules that are irrelevant to a particular computation process based on a criterion known as the slicing criterion. The original program’s semantics is projected through the computation of an executable program formed by the left over modules called a slice. Using this methodology we can automatically determine the relevance of a module in a particular computation. Once such modules are ascertained amongst the program, the testing process takes considerably less effort and time because testing phase generally accounts for more than one third of time during the software development cycle. Slicing applications spread out through debugging methodologies to authentication of properties done through finite state models are appraised. Program slicing methodology reduces the effort of a software designer/coder and enthusiasts as well to directly get to the core of the problem. Forward slices contain all parts of the program that might be influenced by the variable. Static slicing may be used to identify these parts of the program that potentially contribute to the computation of the selected function for all possible programs inputs. Static slicing is helpful to gain a general understanding of these parts of the program that contribute to the computation to the selected function. In this project work, we have developed a forward static slicing algorithm. We have used file tracing to compute the forward static slices of a simple program. We have implemented our algorithm by using Java in net beans IDE on windows platform. The experimental results show that as the number of statements increase the slice computation time also increases raciprocally.