Miracle-dz/UniFAR-FTUs huggingface dataset:
Capturing Software Architecture Design Expertise with Armani

Armani is a language for capturing software architecture design expertise and specifying software architecture designs. This document describes the Armani language in detail with specifications for the language syntax and semantics, as well as examples illustrating common usage. Revision notes: Additional planned changes to this revision include: (a) elaboration of Appendix 1 so it is readable without reference to [OS97]; clearer exposition of Chs. 2-4 so terms are defined clearly before being used; (c) correction of miscellaneous typos, inconsistencies, and errors. The research reported here was sponsored by the Wright Laboratory, Aeronautical Systems Center, Air Force Materiel Command, USAF, and the Advanced Research Projects Agency (ARPA) under grants F33615-93-1-1330 and N66001-95-C-8623; and by National Science Foundation under Grant CCR-9357792 and a Graduate Research Fellowship. Support was also provided by the Kodak Corporation in the form of a Graduate Research Fellowship. Views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of Wright Laboratory, the US Department of Defense, the United States Government, or the National Science Foundation. The US Government is authorized to reproduce and distribute reprints for Government purposes, notwithstanding any copyright notation thereon. Capturing Software Architecture Design Expertise with Armani Version 2.3 Robert T. Monroe Originally published October, 1998 Last Revised September, 2000 CMU-CS-98-163
Adaptive Behavior Variations of a Robot using its own Emotions

Artificial emotion is the basic pre-requisite for the intelligence in navigation of our Robot. Five basic emotions such as Fear, Angry, Disgust, Happiness and Sadness are used as the key-tool in modifying the navigation of the robot. These emotions are generated as a result of sensor’s input to the robot. Fear is incurred when the robot faces obstacles in its path and it limits its speed in such crowded environments and makes an alternative path-plan to avoid the collisions. Anger is incurred, when the robot faces a large number of obstacles, it limits its speed and tries to push the obstacles away. Disgust helps the robot in finding the alternate paths rather than using the same path for repetitive travels. The robot faces sadness when it reaches a goal after a long time, due to the obstacles in its path and hence the robot finds an alternate path during its next travel which gives happiness to the robot which in-turn improves the speed of the robot. Thus all the emotions are used to improve the robot’s performance in terms of speed and reducing the number of collision counts. Key wordsArtificial emotions, Goals, Adaptive performance.
A 200 MIPS single-chip 1 k FFT processor

A device is described which is capable of converting real or complex data from the time domain into the frequency domain, or vice versa. Its integrated dual-port workspace RAM, coefficient ROM, and multiple-resource data path allow the computation of a 1024-point complex transform in less than 100 mu s. No external memory is needed. Multiple devices can be connected in parallel to further increase processing benchmarks. The device can also be used as the core processor in the construction of large (>1 k) one- or two-dimensional transforms, but with additional external memory. Provision is also made for the computation of real-only data transforms with commensurate reductions in calculation time. Six devices in parallel will allow a 1 k transform to be computed at 40-MHz sample rate, equivalent to a 200-MHz radix-2 butterfly rate and an 800-MHz multiplication rate. The processor fabricated in 1.4- mu m CMOS technology, is designed for shrinking to a 1 mu m process. The die size is 13.16 mm*13.66 mm, and the device is assembled in an 84-pin PGA package. Power dissipation is 3 W with a 40-MHz system clock. <<ETX>>
Online Security and Optimization Powered By Fingerprint in Online Voting System

Election is a process in which voters choose their representatives and express their preferences for the way that they will be governed. Using the decade old voting system to collect votes is no longer considered efficient due to the various recurring errors. The advancement of information and telecommunications technologies allow for a fully automated online computerized election process. An electronic voting system defines rules for valid voting and gives an efficient method of counting votes, which are aggregated to yield a final result. Correctness, robustness to fraudulent behaviors, coherence, consistency, security, and transparency of voting are all key requirements for the integrity of an election process. Moreover, electronic voting systems can improve voter identification process by utilizing biometric recognition which provides more security. Biometrics is becoming an essential component of personal identification solutions, since biometric identifiers cannot be shared or misplaced, and they represent any individual’s identity. Fingerprint matching is a significant part of this process. The value of democracy is voting. The importance of voting is trust that each vote is recorded and tallied with an accuracy and impartiality. Online voting process is live and easier approach and it secure through fingerprints which have been used for identification over the time. However, because of the complex distortions among the different impression of the same finger in real life, fingerprint recognition is still a challenging problem for this. Hence study says, the authors and researcher are interested in designing and analyzing the Online Voting System based on the fingerprint minutiae which is the core in current modern approach for fingerprint analysis. The advancement of information and telecommunications technologies should allow for a fully automated online computerized for the election process the new design is analyzed by conducting short election among the polling for any person for selecting their representative among them. Various analysis predicted that the proposed online voting system resolves many issues of the current system with the help of biometric technology. Taking ovs as consideration
Qualidade física do solo e produtividade da cana-de-açúcar sob sistemas de preparo do solo

Avancos na ciencia do solo tem possibilitado o desenvolvimento de indicadores que avaliam e caracterizam de forma critica e com maior sensibilidade a qualidade fisica do solo em favor do crescimento da cana-de-acucar (Saccharum spp.). O Objetivo deste trabalho foi avaliar a influencia do preparo mecanizado na qualidade fisica do solo e no potencial de resposta da cana-de-acucar submetida a regime de sequeiro no Estado de Pernambuco, Brasil. Foi conduzido um experimento com delineamento em blocos ao acaso, com quatro repeticoes. Cada bloco continha duas unidades experimentais (parcelas) e os tratamentos consistiram no sistema de manejo do solo: com preparo e sem preparo. Em laboratorio (ex situ), foram avaliados os atributos fisico-hidricos: densidade do solo, estabilidade de agregados (via umida), porosidade total e sua distribuicao por tamanho, condutividade hidraulica saturada, bem como as curvas de retencao de agua no solo e resistencia do solo a penetracao; sendo este ultimo tambem determinado em campo (in situ). A partir dos ensaios em laboratorio, foram obtidos os dados para calcular os modelos: Agua Disponivel, Intervalo Hidrico Otimo, Integral Water Capacity, Integral Energy, Indice S e Indice H. Adicionalmente, foi avaliado o potencial de resposta da cana-de-acucar considerando parâmetros biometricos (produtividade) e tecnologicos (qualidade). Apos 17 meses de sua realizacao, nao se obteve evidencia de que o preparo mecanizado tenha favorecido propriedades estruturais do solo como densidade e agregacao. No entanto, tal sistema promoveu um acrescimo na porosidade total do solo, modificando sua distribuicao por tamanho. Concomitantemente, houve um aumento na condutividade hidraulica saturada do solo o que diminuiu sua capacidade de armazenagem, comprometendo a disponibilidade hidrica para a cana-de-acucar, evidenciando e aumentando seu comportamento ja coesivo. Em contrapartida, o preparo mecanizado do solo ampliou o Intervalo Hidrico Otimo, mas nao o suficiente para indicar uma boa qualidade fisica, sendo a resistencia do solo a penetracao a principal restricao. Alem do mais, os valores de Integral energy foram semelhantes entre tratamentos. Com relacao a cultura, o preparo mecanizado do solo nao influenciou a produtividade da cana-de-acucar nem sua qualidade.
Online optimization in routing and scheduling

In this thesis we study online optimization problems in routing and scheduling. An online problem is one where the problem instance is revealed incrementally. Decisions can (and sometimes must) be made before all information is available. We design and analyze (polynomial-time) online algorithms for a variety of problems. We utilize worst-case competitive ratio (and relaxations thereof), asymptotic and Monte Carlo simulation analyses in our study of these algorithms. The focus of this thesis is on online routing problems in arbitrary metric spaces. We begin our study with online versions of the Traveling Salesman Problem (TSP) and the Traveling Repairman Problem (TRP). We then generalize these basic problems to allow for precedence constraints, capacity constraints and multiple vehicles. We give the first competitive ratio results for many new online routing problems. We then consider resource augmentation, where we give the online algorithm additional resources: faster servers, larger capacities, more servers, less restrictive constraints and advanced information. We derive new worst-case bounds that are relaxations of the competitive ratio. We also study the (stochastic) asymptotic properties of these algorithms – introducing stochastic structure to the problem data, unknown and unused by the online algorithm. In a variety of situations we show that many online routing algorithms are (quickly) asymptotically optimal, almost surely, and we characterize the rates of convergence. We also study classic machine sequencing problems in an online setting. Specifically, we look at deterministic and randomized algorithms for the problems of scheduling jobs with release dates on single and parallel machines, with and without preemption, to minimize the sum of weighted completion times. We derive improved competitive ratio bounds and we show that many well-known machine scheduling algorithms are almost surely asymptotically optimal under general stochastic assumptions. For both routing and sequencing problems, we complement these theoretical derivations with Monte Carlo simulation results. Thesis Supervisor: Patrick Jaillet Title: Edmund K. Turner Professor
Modeling embedded systems and SoCs - concurrency and time in models of computation

Preface 1. Introduction 2. Behavior and Concurrency 3. The Untimed Model of Computation 4. The Synchronous Model of Computation 5. The Timed Model of Computation 6. MoC Interfaces 7. Tightly Coupled Process Networks 8. Nondeterminism and Probability 9. Applications 10. Concluding Remarks
Low level watermarking of VLSI designs for intellectual property protection

We propose a method for watermarking, called "fingermarking", for integrated circuit design at the physical design level. The watermark is embedded in the transistor layout, making our method applicable to digital, analog, and mixed-signal SOC designs. We show that a robust watermark can be applied to many designs, and can be implemented with little or no cost in circuit area or performance.
The Cognitive Characteristics of Communication with Artificial Agents

– The emergence of relationships between humans and artificial things in the home is analyzed from the perspective of attachment emotion. In this paper, we compare the cognitive activities of owners with attachment emotions and owners without attachment emotions; focusing in particular on the contrasts between owners of a toy doll with strong long-term attachment and short-term owners of a home robot who have not formed attachment. The method employed is protocol analysis which has been extended to the analysis of fan letters and interviews. The results indicate that attachment functions (a) to make human think more positively about things, (b) to elicit a specific action tendency, (c) to evoke the sense of subjective well-being, and (d) to enhance pro-social cognition.
Model regulator based individual wheel braking control

Yaw stability control systems are important components of active safety systems for road transport. A model regulator based yaw stability control system that was previously implemented and tested very successfully as a steering controller is adapted to work as an individual wheel braking controller in this paper. A two track nonlinear vehicle model is used to test the individual wheel braking actuated model regulator developed here. Simulation results are used to demonstrate the achievement of good yaw disturbance moment rejection by the proposed controller.
Electronic Serials Usage Patterns as Observed at a Medium-Size University: Searches and Full-Text Downloads.

As the number of electronic serials available to libraries continues to increase while library budgets remain either stagnant or on the decrease, it becomes necessary to evaluate the use of a library’s electronic collection. In 2006, usage statistics were evaluated at Laurentian University, Canada, to provide direction to collection development and identify high-cost low-use electronic serials. Searches and full-text downloads were studied. A sharp increase in use was observed in and around 2004 which can be explained by the introduction, in Ontario, of the ‘double cohort’, by the rapid increase in the number of electronic resources subscribed to at Laurentian, and by the adoption of OpenURL technology. Heavily used electronic serials are identified. Turnaways, connections by IP address and Bradford’s 20:80 rule are also examined. The application of a cost-per-download ratio provided a practical method for identifying underused products.
Identifikasi elemen-elemen mikro kapabilitas dinamis sensing untuk pengembangan inovasi di usaha kecil dan menengah industri kreatif

Penelitian-penelitian terdahulu telah banyak menganalisis bagaimana kapabilitas dinamis dapat mendukung inovasi. Penelitian-penelitian tersebut mayoritas mengamati bagaimana kapabilitas dinamis digunakan untuk mendukung inovasi. Namun demikian, sepertinya elemen-elemen mikro dari kapabilitas dinamis belum pernah dilakukan analisis di penelitian-penelitian yang ada. Penelitian ini bertujuan untuk menganalisis elemen-elemen mikro dari kapabilitas sensing di usaha kecil dan mengenah yang berlokasi di Yogyakarta, Indonesia. Desain penelitian studi kasus dipilih untuk mendapatkan pemahaman yang mendalam mengenai mengapa dan bagaimana elemen-elemen mikro dari sensing dapat mendukung inovasi yang dilakukan oleh perusahaan. Data dikumpulkan melalui interview, observasi, analisis dokumen, dan kunjungan perusahaan. Reliabilitas data penelitian ini dapat dijamin dengan menggunakan teknik triangulasi. Seperti disarankan di literatur, serangkaian teknik dan prosedur digunakan untuk meyakinkan bahwa penelitian ini memenuhi kriteria validitas. Beberapa teknik tersebut diantaranya pattern matching, penggunaan replication lgoic, dan menggunakan beberapa nara sumber sekaligus. Dari hasil data analisis, diperoleh hasil bahwa tingkat inovasi yang berbeda memerlukan penekanan mikro elemen sensing yang berbeda. Perusahaan yang lebih inovatif memerlukan sensing yang lebih intensif sensing dibandingkan dengan perusahaan yang kurang inovatif. Di bagian akhir artikel ini, beberapa arahan untuk penelitian lanjutan disajikan sebagai panduan bagi para peneliti.
Robust swing up control of double pendulum

Inverted pendulums are typical examples of unstable system and have been used for the verification of designed control systems and/or control education in laboratories. In particular, the control of a double inverted pendulum has been known as a good example to show the power of the modern control theory. In this paper we consider about robust state transfer control method of a double pendulum, i.e., swing up control of the pendulum from the hanging position to the upright position. First, we propose a control method based on a energy principle. Secondly, a more robust control method in which the state transfer is realized through a limit cycle is presented. The effectiveness of the proposed methods is shown by the experiments.
MOOIDE : natural language interface for programming MOO environments

MOOIDE is an interface to allow novice users to program a MOO environment using natural language. Programming the MOO involves a variety of tasks like creating objects and their states, assigning verb actions to objects, and programming behavior that changes states of objects and generates messages. Once the MOO is programmed, other users can interact with the objects for entertainment or educational purpose. To make MOO programming easier and more accessible to novice programmers, our natural language interface allows users to describe different MOO programming tasks in English. These include adding objects, object properties, states and relationships between objects. They also include verbs through which behaviors are accessed in the MOO. Users can use English to describe decision statements, loops, conditions and other typical programming constructs. Earlier systems focused on addressing parsing issues in programming. However, those systems lacked commonsense knowledge. MOOIDE brings commonsense features to natural language programming in addition to parsing. Commonsense reasoning allows MOOIDE to automatically include typical object properties, verb affordances and affordance rules as well as typical verb effects. Such augmentation of natural language programming with commonsense reasoning capabilities can help make programming significantly more intuitive to novice programmers.
Dynamic Object Path Detection in a Network of Surveillance Cameras

Today, automated camera surveillance systems play a major role in securing public and private premises to ensure security and to reduce crime by detecting behavioral changes of moving objects. The important goal of such a surveillance system is to reduce human intervention while at the same time, provide accurate detection of moving objects. Many researchers have attempted to automate different aspects of camera surveillance such as tracking humans, traffic controlling, ground surveillance, etc. However, a system that overcomes overall difficulties that arise in the task of object detection and object tracking has not been developed because of high variance in the problem domain. The proposed system tracks the path of a locked object through a network of cameras. In contrast to traditional methods where the operators have to switch the screens manually to find the target objects, the proposed technique, once locked to an object; automatically tracks it through a camera network and generates the path on a map. We propose to use stereo cameras to enhance the detection and tracking of objects in 3D space.
4 A proof-theoretic approach to the design of object-based mobility

With the advent of technologies to realise parallel computing in mobile sometimes portable platforms, it is now possible to fulfil requirements related to the very dynamic and mutable user location. Designing the required applications calls for improved formal methods to treat mobility while assuring correctness. In this paper, we argue that mobile systems can be specified and verified in an effective modular manner using a logic which allows us to deal with object creation and reconfiguration. Capitalising on our previous work on the specification and verification of actor systems using a temporal logic of objects, here we show that our approach can be used to formally design location dependent applications.
A Hybrid Multimedia Contents Recommendation Procedure for a New Item Problem in M-commerce

Currently the mobile web service is growing with a tremendous speed and mobile contents are spreading extensively. However, it is hard to search what the user wants because of some limitations of cellular phones. And the music is the most popular content, but many users experience frustrations to search their desired music. To solve these problems, this research proposes a hybrid recommendation system, MOBICORS-music (MOBIle COntents Recommender System for Music). Basically it follows the procedure of Collaborative Filtering (CF) system, but it uses Contents-Based (CB) data representation for neighborhood formation and recommendation of new music. Based on this data representation, MOBICORS-music solves the new item ramp-up problem and results better performance than existing CF systems. The procedure of MOBICORS-music is explained step by step with an illustrative example.
C++ Network Programming: Systematic Reuse with ACE and Frameworks, Vol. 2

Do you need to develop flexible software that can be customized quickly? Do you need to add the power and efficiency of frameworks to your software? The ADAPTIVE Communication Environment (ACE) is an open-source toolkit for building high-performance networked applications and next-generation middleware. ACE's power and flexibility arise from object-oriented frameworks, used to achieve the systematic reuse of networked application software. ACE frameworks handle common network programming tasks and can be customized using C++ language features to produce complete distributed applications.C++ Network Programming, Volume 2, focuses on ACE frameworks, providing thorough coverage of the concepts, patterns, and usage rules that form their structure. This book is a practical guide to designing object-oriented frameworks and shows developers how to apply frameworks to concurrent networked applications. C++ Networking, Volume 1, introduced ACE and the wrapper facades, which are basic network computing ingredients. Volume 2 explains how frameworks build on wrapper facades to provide higher-level communication services.Written by two experts in the ACE community, this book contains: An overview of ACE frameworks Design dimensions for networked services Descriptions of the key capabilities of the most important ACE frameworks Numerous C++ code examples that demonstrate how to use ACE frameworksC++ Network Programming, Volume 2, teaches how to use frameworks to write networked applications quickly, reducing development effort and overhead. It will be an invaluable asset to any C++ developer working on networked applications. 0201795256B11152002
Real and apparent time clues to the speed of dialect diffusion

In contrast with the traditional dialect atlas, the glottogram simultaneously displays geographical differences and age differences in language usage.1 There are two techniques for ascertaining the absolute chronology of linguistic change: real time and apparent time techniques. The typical technique for the apparent time is the comparison of two dialect maps of different age groups. There is another technique for considering geographical and age differences at the same time. This technique, called the “glottogram”, has the merit of offering clues for the speed of diffusion. In this paper, several examples of dialect maps and glottograms showing speed of diffusion will be observed. The speed of diffusion within one community may be somewhat more than three generations or around 100 years. In the same period of one century, the changes typically proceed 100 km from the community.