Miracle-dz/UniFAR-FTUs huggingface dataset:
3D segmentation of anisotropic structures using suitable moment-based 3D surface detection

This paper proposes an original approach to deal with 3D anisotropic medical databases by incorporating the anisotropic coefficient directly in the design of a 3D moment-based surface operator. This approach is based on a new continuous 3D surface model in order to adapt to information deficiency in the direction corresponding to the lowermost resolution, and avoid interpolation difficulties by using only the original slices. Results on synthetic and real data show the efficiency of the operator in detecting surfaces accurately. <<ETX>>
Symulator sieciowy do badania algorytmów protokołu TCP

Modelowanie protokołu TCP zwi zane jest z rozwojem Internetu i rozpowszechnianiem si TCP jako dominuj cego protokołu transportowego. Protokół TCP/IP jest standardowym rodkiem globalnej ł czno ci internetowej, umo liwiaj cym komunikowanie si ró nych lokalnych urz dze oraz sieci. Protokół ten podlega ci głej ewolucji, gdy pojawiaj si coraz to nowe problemy zwi zane z jego wydajno ci . Nieustannie ukazuj si coraz to nowsze modele skupiaj ce si na okre lonych aspektach protokołu lub opisuj ce jego działania w sposób bardziej ogólny [1-3]. D c do przy pieszenia działania Internetu jako cało ci i poszukuj c nowych rozwi za , nale y tu odwoła si do modeli matematycznych opisuj cych jego działanie, a dokładniej do tworzenia symulatorów jego pracy. Takie symulatory, tworzone w oparciu o istniej ce modele matematyczne protokołu TCP, umo liwiaj badanie wpływu okre lonych parametrów wej ciowych na działanie sieci jako cało ci.
Untangling BioOntologies for Mining Biomedical Information

Biomedical research generates a vast amount of information that is ultimately stored in scientific publications or in databases. The information in scientific texts is unstructured and thus hard to access, whereas the information in databases, although more accessible, often lacks in contextualization. The integration of information from these two kinds of sources is crucial for managing and extracting knowledge. By structuring and defining the concepts and relationships within a biomedical domain, BioOntologies have taken a key role in this integration. This chapter describes the role of BioOntologies in sharing, integrating and mining biological information, discusses some of the most relevant BioOntologies and illustrates how they are being used by automatic tools to improve our understanding of life.
Say It With Charts: The Executive's Guide to Visual Communication

In this third edition, Gene Zelazny provides a portolio of over 80 complete charts, including pie, bar, column, line and dot charts, plus a new dictionary of 150 visual images that can be used to visualize non-quantitative ideas such as forces at work, interaction, leverage, and barriers. Other convey flow structure and process. Say It With Charts will help you choose the chart form that will work best and translate data and ideas into visual concepts. 4-color insert.
GTH-UPM system for search on speech evaluation

This paper describes the GTH-UPM system for the Albayzin 2014 Search on Speech Evaluation. Teh evaluation task consists of searching a list of terms/queries in audio files. The GTH-UPM system we are presenting is based on a LVCSR (Large Vocabulary Continuous Speech Recognition) system. We have used MAVIR corpus and the Spanish partition of the EPPS (European Parliament Plenary Sessions) database for training both acoustic and language models. The main effort has been focused on lexicon preparation and text selection for the language model construction. The system makes use of different lexicon and language models depending on the task that is performed. For the best configuration of the system on the development set, we have obtained a FOM of 75.27 for the deyword spotting task.
Changes in Student Attitudes and Student Computer Use in a Computer-Enriched Environment

Abstract The pedagogic usefulness of the computer is examined by focusing on student attitudes and use of computers in a “computer-enriched” environment. Our analysis uses data from three years of a five-year longitudinal study at Wake Forest University. The results indicate that a computer-enriched environment is positively correlated with student attitudes toward computers in general, their role in teaching and learning, and their ability to facilitate communication. In addition, there were few changes in attitudes for students who did not have seamless access to the network. This study concludes that a networked institution where students have easy access can foster positive attitudes toward the use of computers in teaching and learning.
Foundations of Functional Programming

The binary trees, denoted by B, whose branch nodes contain natural numbers, are generated by the grammar where n ranges over natural numbers. Although this question concerns the encoding of binary trees as λ-terms, you may use the encodings of other well-known data structures, such as booleans and pairs, provided you state the properties assumed. Give an encoding of binary trees as λ-terms by defining as λ-terms (a) Leaf and Br, used to construct the λ-terms corresponding to binary trees; (b) isLeaf, which tests whether a λ-term corresponds to a leaf or a branch node; (c) value, fstsubtree and sndsubtree, used to identify respectively the natural number and the two subtrees at a branch node. Justify your answer by describing the behaviour of isLeaf, value, fstsubtree and sndsubtree: for example, the reduction isLeaf(Leaf) true describes part of the behaviour of isLeaf. [8 marks] Consider the function treeadd defined inductively on the structure of binary trees by Give and justify a λ-term which encodes treeadd, using the λ-term Y ≡ λf. (λx.f (xx))(λx.f (xx)). [6 marks] Give the λ-term for the infinite binary tree whose branch nodes consist of zeros at even depths and ones at odd depths, as pictured below: 0 1 1 0 0 0 0 1 1 1 1 1 1 1 1. [6 marks]
Indier than thou: On creative professions, chefs, and the sacralization of margins

The notion of professions and professionalism often assumes a hierarchy of achievement, even a meritocracy (Abbott, 1998; Derber et al., 1990), where the true professionals will rise and the mediocre will at best occupy a vague middle position. For instance, the best oncologist is assumed to be one that all in the business know of, and also one that is most likely to be known by the outside world. Even though we rarely state things so bluntly, the best professionals – the most professional ones of all – are meant to occupy the tip of the pyramid and be the exemplars against which all others are measured. Such a perspective of professionalism, one of pure and generally accepted meritocracy, has as its core the notion that professions can be objectively assessed, regardless of whether this assessment is internal (i.e. done by fellow professionals) or external (i.e. done by laymen, customers or the interested public).
Classification of Nonstationary Power Signals using Support Vector Machine and Extreme Learning Machine

The classification of nonstationary signals in a noisy environment is a difficult task. In this paper a modified version of S-Transform technique has been proposed for classification of power signal disturbances. The S-Transform is a signal processing technique which is used for visual localization, detection, pattern classification. S-Transform has good ability in gathering high frequency signals and suppressing the lower frequency signal. The S-Transform has been used to extract features from the nonstationary power disturbance signals.The extracted features are fed as the input support vector machine classifier for power signal disturbance pattern classification. To enhance the pattern classification accuracy the extreme learning classifier has been proposed and comparison results has been presented.
Supervisory Control and the Design of Intelligent User Interfaces

In this discussion, the authors begin with their assumptions about the design of intelligent user interfaces and the need to support situation awareness and action planning. Relevant cognitive research in attention and decision-making strategies are then discussed. A discussion of how the user interface is intended to work is then presented. Focus of the discussion is on a framework for an intelligent user interface.
World Wide Web Robot for Extreme Datamining with Swiss-Tx Supercomputers

This paper discusses the software and hardware issues of designing a highly parallel robot for extreme datamining on the Internet. As a sample application, a World Wide Web server count experiment for Switzerland and Thailand is presented. Our platform of choice is the SwissTx, a supercomputer built from commodity components that runs NT and COMPAQ tru64 UNIX. Hardware and software of this machine are discussed and benchmark results presented. They show that NT is a feasible choice even under the given extreme conditions. Using statistical modelling for optimizing the search process, the inevitable bandwidth problem is reduced to some extent to a computation problem. We suggest that our approach to Web robots is a robust bet for a multitude of future Internet applications which might lead to a large-scale and cost-efficient usage of Web robots.
How to recommend music to film buffs: enabling the provision of recommendations from multiple domains

In broad terms, Recommender Systems use machine learning techniques to process historical data about their user's interests, encoded in user profiles. Once the algorithms used have been trained on user profiles, their output is used to compile a ranked list of all resources available for recommendation, based on each profile. Collaborative Filtering is the most widespread method of carrying this out, building on the intuition that similar people will be interested in the same things. The point of failure in this approach lies in that similarity can only be assessed between users that have expressed their preferences on a common set of resources. This requirement prohibits the sharing of preference data across different systems, and causes additional problems when new resources for recommendation become available, or when new users subscribe to the system. I propose that the difficulty can be overcome by identifying and exploiting semantic relationships between the resources available for recommendation themselves. Moreover, systems that are able to assess the strength of the relationship between any two resources can provide recommendations from multiple domains. For example, music recommendations can be made based on a person's film taste if strong semantic relationships can be identiffed between certain films and the music he/she listens to. As such the contributions made by this dissertation can be summarised in the following: 1. Facilitating the comparison of heterogeneous resources The use of Wikipedia is proposed for this purpose, under the assumption that hyper-links between articles in Wikipedia convey latent semantic relationships between the concepts they describe. Thus, a methodology for projecting domain resources onto Wikipedia has been developed. The assumption is then validated by showing evidence that the projections are successful in retaining similarity between domain resources, in three independent domains. 2. Enabling the provision of recommendations from multiple domains The aforementioned projections encode the links present in Wikipedia articles that are found to correspond to domain resources, and can be viewed collectively as a graph. In addition, the Internet is populated with social networks of people who express their preferences on a given set of resources in the form of ratings. Members of such communities are included as nodes in the graph and ratings regarding domain resources represented as edges. A reversible Markov chain model was implemented to describe the probabilities associated with the traversal of edges in the integrated graph. Nodes that represent resources and other concepts the user is known to be interested in are then identified in the graph. Using these nodes as a starting point, the resource nodes most likely to be reached after an arbitrarily large number of edge traversals are considered the most relevant to the user and are recommended. Experimental results show that the framework is successful in predicting user preferences in domains different to those of the input.
In VitrAm. In VITRo AniMats, a behavioural simulation model

In this paper, we will describe our behavioural simulation system. We will present its differences and its place with regard to other simulation systems. To define an animation, the operator designs characters and sensors. Then, he writes the behaviour with inference rules like PROLOG ones. We extend the model to integrate a graphical interface. One or more operators can also be integrated in the same way as other autonomous characters. But these extensions are used to design applications of virtual reality and telepresence. <<ETX>>
Empiricist solutions to nativist puzzles

How much knowledge of language is innate and how much is learned through experience? The nativist view endorses that human language acquisition is guided by innate rules ("Universal Grammar"), while the empiricist view assumes that language acquisition is the product of abstractions from stored exemplars. Despite the apparent opposition between these views, the essence of the debate lies in the relative contribution of prior knowledge and linguistic experience. The main goal is then to establish the minimal prior knowledge needed for language acquisition to take place. In this paper we will focus on a couple of hard linguistic phenomena that have for a long time been considered "parade cases of an innate constraint": auxiliary fronting and binding. We show that these linguistic facets can be learned without assuming specific constraints or principles and without presuming that they have been literally seen in the data. Instead, we will demonstrate that these phenomena can be learned either from simpler sentences in a corpus of child-directed speech or emerge from a specific parsing strategy.
A low-power SRAM using improved charge transfer sense amplifiers and a dual-Vth CMOS circuit scheme

In this paper we propose an improved version of the charge transfer sense amplifier (CT sense amp) which completely compensates the threshold voltage (Vth) difference of MOSFETs. We also present a dual-Vth CMOS circuit scheme that enables high speed operation and low leakage power consumption at low supply voltage. A low-power, low-voltage 2 k/spl times/16 b SRAM macro was designed and fabricated using a 0.25 /spl mu/m process. It showed stable operation with an access time of 7.0 ns and power consumption of 3.9 mW at 1.0 V (boost 1.5 V), 100 MHz, 85/spl deg/C.
Design and simulation of a multilayer Halbach magnet for NMR

Halbach magnet is a type of permanent magnet generating a relatively high and homogeneous magnetic field. It is suitable for Nuclear Magnetic Resonance (NMR) studies of small volume chemical or biological samples. In this article, the model of a Halbach magnet made from an odd number of cylindrical layers is proposed for the first time. Then after the optimization of interlayer distances for odd layers Halbach cylinders, the model is verified by the simulation with a magnet inner radius of 30 mm and an outer radius of 49 mm. Moreover, the disturbance of uniformity in 5 mm DSV (Diameter of Spherical Volume) is presented with errors in magnetic strength and angular variation. As a result, a minimum uniformity of 46 ppm inside a 5 mm DSV is achieved, while it increases practically in the presence of magnetic blocks errors. The good performance of the Halbach magnet with odd layers may find potential applications in NMR. © 2015 Wiley Periodicals, Inc. Concepts Magn Reson Part B (Magn Reson Engineering) 45B: 134–141, 2015
Performance Balance and Idle Time Utilization in Hadoop MapReduce Framework

— Enormous information is all over. MapReduce is one of the procedures utilized by Big information. MapReduce is a parallel and one of the famous processing procedures used to process and register extensive scale information. MapReduce uses space based framework to build execution and use asset to finish execution of undertakings. To build execution and assets distribution MapReduce system utilizes three unique ideas like Dynamic Hadoop Slot Allocation which helps in preconfiguration of spaces to assignments for speedier execution. These procedure helps in using spaces by both guide assignments and lessen undertakings. The other system called Speculative Execution Performance Balancing is utilized to enhance execution by recognizing the stragglers in the procedures. This aides in enhancing the group proficiency and in addition execution tradeoff for both single and different executions of employments in an entirety. The other method called postponement booking would be utilized to enhance information region at the expense of reasonableness. Contrasting and Hadoop information region ought to be enhanced with ease, so we add to a system called Slot PreScheduling. This Slot PreScheduling enhances information area without effect on reasonableness. At long last utilizing all these three strategies we frame a regulated assignment framework for execution of errands and in a roundabout way enhance use of unmoving time spaces. At long last, by consolidating all procedures together, we frame a regulated opening designation framework, that can enhance the execution of MapReduce employments and uses the unmoving time significantly for quicker execution of undertakings be using whatever number assets as would be prudent.
Adapting search structures to scene characteristics for ray tracing

Ray tracing is an important and popular rendering technique in computer graphics for synthesizing photorealistic images. However, ray tracing, if not carefully done, can be a computationally expensive technique. A great deal of research has focused on discovering efficient ways to perform ray tracing. An important approach to controlling the computational expense has been the use of geometric search structures to prevent needless ray-object intersection calculations. Search structures in current use take advantage of scene characteristics in a variety of ways to enhance ray tracing performance. Constraints in their construction can cause inefficiencies and consequent degradation in performance. Performance comparisons between search structures using timing benchmarks have shown that no single existing search structure performs best on all scene models. A knowledge of search structure performance prior to rendering is therefore important to selecting a search structure for a given scene. A thorough understanding of the ways in which search structures succeed in enhancing performance on various types of scenes can also be expected to lead to improvements in existing techniques. We present new results in adapting search structures to scene characteristics for improving the performance of ray tracing. A cost model is developed for evaluating search structures currently being used in ray tracing. The model has been successfully used to terminate search structure construction, thus making it unnecessary to set termination parameters in advance. The model has also been used with limited success to compare the performance of different search structures for a given scene. A detailed experimental study of some of the important properties of search structures has been performed. This has resulted in a new adaptive search structure that is based on k-d trees, a multi-dimensional binary search structure which outperforms existing methods. Its high performance is primarily due to the fact that it combines the advantages of such structures based on space partitioning and those based on bounding volumes. The greater flexibility of this search structure allows it to terminate automatically at a point where further subdivision would result in no additional benefits. Finally, this search structure has been used to render volume models from scientific applications such as medical imaging and molecular modeling. Its advantages over traditional volume rendering techniques have been demonstrated.
High-resolution monitoring of internal layers at NGRIP

A key variable in assessing the mass balance of an ice sheet is accumulation rate. Currently, accumulation rate is determined from sparsely distributed ice cores and pits. There are uncertainties in existing accumulation rates derived from these cores and pits. The authors developed an ultra wideband frequency modulated continuous wave (FMCW) radar for mapping internal layers, from known volcanic events, in the ice for estimating accumulation rate from high-resolution radar data. The authors tested the radar system during the 1998 surface experiment at the North Greenland Ice core Project (NGRIP) ice camp. Their results show that internal layers were mapped with high resolution down to 200 m. In this paper, they present the results of the 1998 NGRIP surface experiment.
Factors affecting computer program comprehension.

Factors affecting computer program comprehension " (1979). Retrospective Theses and Dissertations. Paper 7194. INFORMATION TO USERS This was produced from a copy of a document sent to us for microfilming. While the most advanced technological means to photograph and reproduce this document have been used, the quality is heavily dependent upon the quality of the material submitted. The following explanation of techniques is provided to help you understand markings or notations which may appear on this reproduction. 1. The sign or "target" for pages apparently lacking from the document photographed is "Missing Page(s)". If it was possible to obtain the missing page(s) or section, they are spliced into the film along with adjacent pages. This may have necessitated cutting through an image and duplicating adjacent pages to assure you of complete continuity. 2. When an image on the film is obliterated with a round black mark it is an indication that the film inspector noticed either blurred copy because of movement during exposure, or duplicate copy. Unless we meant to delete copyrighted materials that should not have been filmed, you wiM find a good image of the page in the adjacent frame. 3. When a map, drawing or chart, etc., is part of the material being photo­ graphed the photographer has followed a definite method in "sectioning" the material. It is customary to begin filming at the upper left hand comer of a large sheet and to continue from left to right in equal sections with small overlaps. If necessary, sectioning is continued again—beginning below the first row and continuing on until complete. 4. For any illustrations that cannot be reproduced satisfactorily by xerography, photographic prints can be purchased at additional cost and tipped into your xerographic copy. Requests can be made to our Dissertations Customer Services Department. 5. Some pages in any document may have indistinct print. In all cases we have filmed the best available copy.