Miracle-dz/UniFAR-FTUs huggingface dataset:
Solving design problems to add value

Value management is well established in construction to structure early project briefing and to agree satisficing project values and objectives among project stakeholders. Current practice concentrates on the consideration of value during project definition. This paper proposes Integral Value Engineering as a design management practice that considers value in design throughout project resolution and delivery. An expansion of value management principles is proposed to include the adoption of a problem-solving approach and value-adding tools. These can help assemble value-adding frameworks in which design activity is more explicitly focused on project values. The use of problem solving frameworks to relate design method and outcome to project values is described and the notion of documenting these relationships to create a value-adding audit trail introduced. Integral Value Engineering is defined as the consideration of value when solving design problems, irrespective of the project stage in which they occur or their technical nature. The adaptability of the problem solving approach is discussed, together with its ability to accommodate the extensive variability in problem scope and concurrency in construction projects. The role of individual design engineers as practitioners of Integral Value Engineering is also described; this focuses on collaborative forums to incorporate the expertise of specialised suppliers. A web-based Value-Adding Toolbox is described to disseminate value-adding tool descriptions, methods and examples within a single organisation or managed value chain. The paper concludes that, for integral value engineering to be effective, suitable metrics must be identified to monitor the extent to which technical design solutions satisfy overall project values. This would allow responsive mechanisms to be defined so that design development can be managed throughout project duration to ensure that the satisficing values initially defined by value management at project outset will be delivered.
HTML 4.0 Specification

This specification defines the HyperText Markup Language (HTML), version 4.0, the publishing language of the World Wide Web. In addition to the text, multimedia, and hyperlink features of the previous versions of HTML, HTML 4.0 supports more multimedia options, scripting languages, style sheets, better printing facilities, and documents that are more accessible to users with disabilities. HTML 4.0 also takes great strides towards the internationalization of documents, with the goal of making the Web truly World Wide. HTML 4.0 is an SGML application conforming to International Standard ISO 8879 -Standard Generalized Markup Language [ISO8879] [p.323] . Status of this document This document has been reviewed by W3C Members and other interested parties and has been endorsed by the Director as a W3C Recommendation. It is a stable document and may be used as reference material or cited as a normative reference from another document. W3C’s role in making the Recommendation is to draw attention to the specification and to promote its widespread deployment. This enhances the functionality and interoperability of the Web. W3C recommends that user agents and authors (and in particular, authoring tools) produce HTML 4.0 documents rather than HTML 3.2 documents (see [HTML32] [p.325] ). For reasons of backwards compatibility, W3C also recommends that tools interpreting HTML 4.0 continue to support HTML 3.2 and HTML 2.0 as well. 1 HTML 4.0 Specification
GENETIC ALGORITHM BASED DESIGN AND IMPLEMENTATION OF MULTIPLIERLESS TWO- DIMENSIONAL IMAGE FILTERS

The invention is a handgun in which the spring-loaded slide is replaced by an electric motor, engageable only upon an authorized user entering an access code. A combination rechargeable battery and keypad engages the butt of the handle where the magazine well is located and includes an electrical plug the fits into the handle, making an electrical connection between the battery and a microprocessor in the handgun. Entering the proper code on the keypad allows the microprocessor to complete the circuit between the battery and a motor that actuates the slide. When the device is not in use, the magazine having been removed, the motor then moves the slide rearward, ejecting any cartridge in the chamber, and maintains the slide in a position where the chamber is always open, thereby making obvious to anyone that the gun is not loaded.
PDDL-the planning domain definition language

This manual describes the syntax of PDDL, the Planning Domain Definition Language, the problem-specification language for the AIPS-98 planning competition. The language has roughly the the expressiveness of Pednault’s ADL [10] for propositions, and roughly the expressiveness of UMCP [6] for actions. Our hope is to encourage empirical evaluation of planner performance, and development of standard sets of problems all in comparable notations.
ATOM: Automatic Transaction-Oriented Memoization

Over the last decades the object-oriented paradigm evolved to the point that, nowadays, it is the preferred approach for software development. In this programming paradigm, objects maintain internal state that influence the objects’ behaviors and, in general, this state changes over time. This differentiating characteristics of object-oriented programs difficult the application of techniques commonly used in other programming paradigms. One such example is memoization, a well-known technique for improving the performance of pure functional programs in a transparent way and without changing their semantics. The difficulty of applying memoization in object-oriented imperative programs results, precisely, from the fact that a method’s behavior may depend on shared state values or produce side-effects. Something that does not what happen in functional contexts. In this dissertation, I propose an extended memoization approach that builds on the support provided by a Software Transactional Memory (STM) to remove many of the limitations of traditional memoization. I argue that my extended automatic memoization system (ATOM) is the first to suit the needs of objectoriented programming. I show how memoization can be implemented almost for free in systems that use an STM, and present the reasons why this synergy can be particularly useful in transactional contexts. I validate the usefulness of memoizing object-oriented programs by applying memoization to the STMBench7 benchmark, a standard benchmark developed for evaluating STM implementations. The memoized version of the benchmark shows up to a 14-fold increase in the throughput for a read-dominated workload. Palavras Chave Keywords
BRS Isis: nova cultivar de uva de mesa vermelha, sem sementes e tolerante ao míldio.

A 'BRS Isis' e uma nova cultivar de uva de mesa vermelha, sem sementes, cujas caracteristicas vem atender algumas das principais demandas do setor viticola no Brasil. E tolerante ao mildio e se adapta bem as condicoes de clima tropical do Brasil. Destaca-se ainda, pela alta fertilidade de gemas, aderencia das bagas ao engaco e tamanho natural de bagas, que apresentam textura firme e sabor neutro.
Error Analysis in Multi-Agent Control Systems

Any cooperative control scheme relies on some measurements which are often assumed to be exact to simplify the analysis. However, it is known that in practice all measured quantities are subject to error, which can deteriorate the overall performance of the network significantly. This work proposes a new measurement error analysis in the control of multi-agent systems. In particular, the connectivity preservation of multi-agent systems with state-dependent error in distance measurements is considered. It is assumed that upper bounds on the measurement error and its rate of change are available. A general class of distributed control strategies is then proposed for the distance-dependent connectivity preservation of the agents in the network. It is shown that if two neighboring agents are initially located in the connectivity range, they are guaranteed to remain connected at all times. Furthermore, the formation control problem for a team of single-integrator agents subject to distance measurement error is investigated using navigation functions. Collision, obstacle and boundary avoidance are important features of the proposed strategy. Conditions on the magnitude of the measurement error and its rate of change are derived under which a new error-dependent formation can be achieved anywhere in the space. The effectiveness of the proposed control strategies in consensus and containment problems is demonstrated by simulation.
The Explanation Issue in Multi-Agent Systems

Multi-Agent Systems (MASs) are used in different domains in recent years. They are considered as a newparadigm for conceptualizing, designing, and implementing software systems. They present a promising approach for creating softwares related to human society’s studies, industrial applications, computernetworks, etc. However, they still encounter major difficulties related to the high level of complexity that canbe attained at real and large scale. In such complex systems, we need to understand what really happens andhow the goal has been reached. So, an efficient methodology to explain agent reasoning in these systems hasbecome a necessity. In this paper, we underline the importance of explanation in MAS and we present our contribution in this context.
Feature discovery for problem solving systems

Since Samuel's work on checkers over thirty years ago, much effort has been devoted to learning evaluation functions automatically from examples. Many methods have been developed that, given examples of problem states paired with their desired evaluations, can induce an evaluation function from them. However, all such methods are sensitive to the set of features chosen to represent the examples. If the features do not capture those aspects of the examples that are significant for problem solving, the learned evaluation function may be inaccurate or inconsistent. Typically, good feature sets are handcrafted carefully, and a great deal of time and effort goes into refining and tuning them. Very little work has been done on automatically generating sets of features for problem solving domains, or on explaining why known features are useful. This dissertation presents a method for generating features for problem solving domains. It employs both a declarative problem specification and examples of state evaluations, and so combines aspects of both analytical and empirical learning. The feature set is developed iteratively: features are generated, then evaluated, and this information is used to develop new features in turn. Both the contribution of a feature and its computational expense are considered in determining whether and how to develop it further. This method has been applied to two problem solving domains: the Othello board game and the real-world domain of telecommunications network management. Empirical results show that the method is able to generate many known features, several novel features, and to improve concept accuracy in both domains.
An investigation of tone in Walungge

Copyright © and Moral Rights for this thesis are retained by the author and/or other copyright owners. A copy can be downloaded for personal non‐commercial research or study, without prior permission or charge. This thesis cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder/s. The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.
Hash-based Secure Sensor Network Programming Method without Public Key Cryptography

ABSTRACT Network programming or over-the-air programming is very important function for wireless sensor networks (WSN). Because sensor nodes are updated with wireless connection, there could be many security threats, so we need cryptographically strong protocol. Some researches solve this problem by adapting digital signature and hash function. But digital signature based PKI needs many computational overhead, therefore these may not be acceptable for wireless sensor node. In some typical circumstances, the sensor network can have a few kinds of restriction. For example, sensor nodes can synchronize the time among them. Or broadcast message can be received over single hop. In this paper, we propose new secure network programming method using only hash function instead of PKI-based digital signature, which can be applied in those circumstances. Categories and Subject Descriptors C.2. 2 [ Computer-Communication Networks ]: Network Protocols; D.4. 6 [ Operating Systems ]: Security and Protection
EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS

OF DISSERTATION EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS This thesis describes and develops two planarization algorithms for geographic routing and a geographic routing protocol for mobile ad hoc and sensor networks. As all nodes are mobile and there is no fixed infrastructure, the design of routing protocols is one of the most challenging issues in mobile ad hoc and sensor networks. In recent years, greedyface-greedy (GFG) geographic routing protocols have been widely used, which need nodes to construct planar graphs as the underlying graphs for face routing. Two kinds of planarization algorithms have been developed, idealized and realistic planarization algorithms, respectively. The idealized planarization algorithms make the ideal assumption that the original network graph is a unit-disk graph (UDG). On the other hand, the realistic planarization algorithms do not need the original network to be a UDG. We propose an idealized planarization algorithm, which constructs an Edge Constrained Localized Delaunay graph (ECLDel). Compared to the existing planarized localized Delaunay graph [42], the construction of an ECLDel graph is far simpler, which reduces the communication cost and saves the network bandwidth. We propose a Pre-Processed Cross Link Detection Protocol (PPCLDP), which generates a planar spanning subgraph of the original network graph in realistic environments with obstacles. The proposed PPCLDP outperforms the existing Cross Link Detection Protocol [32] with much lower communication cost and better convergence time. In GFG routing protocols, greedy routing may fail at concave nodes, in which case, face routing is applied to recover from the greedy routing failure. This may cause extra hops in routing in networks containing voids. We propose a Hill-Area-Restricted (HAR) routing protocol, which avoids the extra hops taken in the original GFG routing. Compared to the existing Node Elevation Ad hoc Routing [4], the proposed HAR guarantees the packet delivery and decreases the communication cost greatly.
Slackness-Based Co-Scheduling Hardware and Software Pipelines with Multiple Latency Sequences

Abstract Pipelining is by far one of the most used approaches for achieving higher instruction level parallelism. To exploit this parallelism, various scheduling algorithms were introduced. Co-scheduling hardware and software pipelines is a new approach for scheduling operations from different iterations of a loop (software pipelining) and reconfiguring the hardware pipelines to achieve higher instruction level parallelism. This scheduling algorithm is based on the slackness of the operation. In this paper, we extend the original co-scheduling algorithm and study the effect of the initial slackness of the operation. We introduce a method to select the most suitable latency sequence among the available latency sequences. Furthermore, we modify the selection criterion which is used to select an instruction for scheduling. The new criterion performs better than the original one. The new scheduling algorithm is implemented and compared with the original co-scheduling approach. We test the algorithm on different loops selected from various benchmarks. As high as 36.8% improvement was obtained for those loops which were either not scheduled or scheduled at a large initiation interval. Furthermore, we find that the initial slackness of an operation has a considerable effect on the final schedule.
Art of writing a Runge--Kutta code

The problem considered is the solution of u' = f(x,u) for x between a and b with u(a) given. Runge--Kutta methods and when to use them are briefly described. Choice of step size is important. Characteristics of several codes employing Runge--Kutta methods are listed; the characteristics vary. Aspects of the algorithms discussed include error control, step size, external limits, scale of the problem, computer arithmetic, accuracy, and output. Characteristics of the code RFK45 are given. (RWR)
Measurement of the Nuclear g Factor of Li8

Observation of the asymmetry in beta emission offers a means of measuring the polarization of very small samples of short-lived nuclei. If established resonance techniques are used to perturb the nuclear polarization due to the capture of polarized neutrons, the precise measurement of nuclear g factors should be possible in several cases which cannot be studied by conventional methods. The successful application of this idea to the case of Li/ sup 8/ is described. The target was a single crystal of LiF enriched in the isotope Li. (W.D.M.)
Using data structures within genetic programming

Provision of appropriately structured memory is shown, in some cases, to be advantageous to genetic programming (GP) in comparison with directly addressable indexed memory. Three "classic" problems are solved. The first two require the GP to distinguish between sentences that are in a context free language and those that are not given positive and negative training examples of the language. The two languages are, correctly nested brackets and a Dyck language (correctly nested brackets of different types). The third problem is to evaluate integer Reverse Polish (postfix) expressions. Comparisons are made between GP attempting to solve these problems when provided with indexed memory or with stack data structures.
Idea-Based Learning: A Course Design Process to Promote Conceptual Understanding

Synthesizing the best current thinking about learning, course design, and promoting student achievement, this is a guide to developing college instruction that has clear purpose, is well integrated into the curriculum, and improves student learning in predictable and measurable ways. The process involves developing a transparent course blueprint, focused on a limited number of key concepts and ideas, related tasks, and corresponding performance criteria; as well as on frequent practice opportunities, and early identification of potential learning barriers. "Idea-based Learning" takes as its point of departure the big conceptual ideas of a discipline that give structure and unity to a course and even to the curriculum, as opposed to a focus on content that can lead to teaching sequences of loosely-related topics; and aligns with notions of student-centered and outcomes-based learning environments.Adopting a backwards design model, it begins with three parallel processes: first, identifying the material that is crucial for conceptual understanding; second, articulating a clear rationale for how to choose learning outcomes based on student needs and intellectual readiness; and finally, aligning the learning outcomes with the instructional requirements of the authentic performance tasks. The resulting syllabi ensure cohesion between sections of the same course as well as between courses within a whole curriculum, assuring the progressive development of students skills and knowledge.Key elements of IBL include: * Helping students see the big picture* Building courses around one or more authentic performance tasks that illuminate the core concepts of the discipline* Clearly identifying performance criteria for all tasks* Incorporating practice in the competencies that are deemed important for students success* By placing the onus of learning on the student, liberating faculty to take on the role of learning coaches* Designing tasks that help students unlearn simplistic ideas and replace them with improved understandingsEdmund Hansen expertly guides the reader through the steps of the process, providing examples along the way, and concluding with a sample course design document and syllabus that illustrate the principles he propounds. "
The FISHEYE view: A new look at structured files

A diagnostic arrangement for controlling the isolation of the cause of fault conditions occurring in a data processor system having a pair of synchronously operating data processors for generating pairs of data signals, monitors the data signals for fault conditions and serves as a communication link between the processors. The arrangement includes an isolation control circuit for causing the pair of data processors to halt their normal processing operations and for causing them to initiate subsequently at least one series of predetermined operations and thus to generate sequentially a series of test signal conditions, a read only memory for storing correct signal conditions, and a matching circuit for comparing at least one of said second test signal conditions from the data processors with the correct signal condition stored in the read only memory to generate a match signal if the compared signal conditions are the same as the correct signal condition. A logic circuit detects a certain predetermined code contained in the correct signal condition stored in the read only memory and in response thereto controls selectively the series of predetermined operations of the data processors so that the data processors can either perform the entire series of operations in an uninterrupted manner, or can be incremented sequentially through a fewer number of the predetermined operational steps.
Potential Flow Theory and Operation Guide for the Panel Code PMARC

The theoretical basis for PMARC, a low-order panel code for modeling complex three-dimensional bodies, in potential flow, is outlined. PMARC can be run on a wide variety of computer platforms, including desktop machines, workstations, and supercomputers. Execution times for PMARC vary tremendously depending on the computer resources used, but typically range from several minutes for simple or moderately complex cases to several hours for very large complex cases. Several of the advanced features currently included in the code, such as internal flow modeling, boundary layer analysis, and time-dependent flow analysis, including problems involving relative motion, are discussed in some detail. The code is written in Fortran77, using adjustable-size arrays so that it can be easily redimensioned to match problem requirements and computer hardware constraints. An overview of the program input is presented. A detailed description of the input parameters is provided in the appendices. PMARC results for several test cases are presented along with analytic or experimental data, where available. The input files for these test cases are given in the appendices. PMARC currently supports plotfile output formats for several commercially available graphics packages. The supported graphics packages are Plot3D, Tecplot, and PmarcViewer.