Miracle-dz/UniFAR-FTUs huggingface dataset:
Improving Donath's technique for estimating the average interconnection length in computer logic

Important layout properties of electronic designs include space requirements and interconnection length values. A reliable interconnection length estimation is essential for improving placement and routing techniques. Accurate estimates can also be used to compare architecture features before these architectures actually have to be built. Donath found an upper bound for the average interconnection length for a two-dimensional placement that follows the trends of experimentally obtained average lengths [Don79]. Yet, this upper bound deviates from the experimentally obtained value by a factor of approximately 2 which is not su ciently accurate for some applications. In this report we search for the main reasons for the deviation. We will propose some improvements and evaluate them with respect to the limitations imposed by Rent's rule [LR71]. We show that we can obtain a signi cantly more accurate estimate by taking into account the inherent features of the optimal placement process. In this report, improvements on Donath's technique will be presented both for twoand three-dimensional placement. Therefore, the extension of Donath's technique to three dimensions will also be presented.
STRUCTURAL DYNAMICS MODEL VALIDATION: PUSHING THE ENVELOPE

SUMMARY: “Pushing the envelope” is a phrase commonly used to refer to the action of approaching or exceeding known performance boundaries. “Model validation” refers to the assessment of the accuracy of computational simulations with respect to experimental reference data. Recent advances in computational capability, coupled with an increasing demand for computational predictive accuracy and the ever-increasing cost of experimental data, have driven an increased interest in model validation for the assessment and improvement of the predictive accuracy of finite element simulations for structural dynamics. In this paper, a general process of model validation is reviewed with regard to the current state of the practice and for each step of the process it is illustrated how modern techniques are “pushing the envelope” of this technology.
Using Random Forests to Classify W+W- and ttbar Events

We have carried out an exercise in the classification of W+W- and ttbar events as produced in a high-energy proton-proton collider, motivated in part by the current tension between the measured and predicted values of the WW cross section. The performance of the random forest classifier surpasses that of a standard cut-based analysis. Furthermore, the distortion of the distributions of key kinematic event features is relatively slight, suggesting that systematic uncertainties due to modeling might be reduced. Finally, our random forest can tolerate missing features such as missing transverse energy without a severe degradation of its performance.
An Approach to Incorporate Texts into a Social Network Analysis of Communication Graphs

Social network analysis (SNA) provides tools to examine relationships between people. Text mining (TM) allows capturing the text they produce in Web 2.0 applications, for example, however it neglects their social structure. This paper applies an approach to combine the two methods named "content-based SNA" (CB-SNA). Using the R mailing lists, R-help and R-devel, we show how this combination can be used to describe people's interests and to find out if authors who have similar interests actually communicate. We find that the expected positive relationship between sharing interests and communicating gets stronger as the centrality scores of authors in the communication networks increase.
ANALYSIS OF A HYBRID PHASE-LOCK LOOP

Abstract 3. Recipient's Cotolog No. 5. Report Dote June . ~ 1970- 6. Performing organization Code 8. Performing Organization Report No. c-101 0. Work Unit No. 125-23-06-02 1. Contract or Grant No. 3. Type of Report and Period Covered Technical Note 1 4. Sponsoring Agency Code A model for a hybrid phase-lock loop has been derivec by using Fokker-Planck techniques. The hybrid loop oper- ates on both the data and carrier components of the re- ceived signal to provide the phase estimate required for coherent detection. The loop is optimized with respect tc the system design parameters, and the performance of a bipolar phase-shift-keyed communication system is evalu- ated. The results are compared with systems which employ Costas-type loops or conventional phase-lock loops. The hybrid loop gives superior performance for all signal-to- noise ratios, with a maximum improvement of 1.5 dB for low data-rate systems, and, additionally, is satisfactory over a wider range of signal-to-noise ratios than either the Costas or conventional phase-lock loops.
BPELJ: BPEL for Java

This is a preliminary document and may be changed substantially over time. The information contained in this document represents the current view of IBM and BEA on the issues discussed as of the date of publication and should not be interpreted to be a commitment on the part of IBM and BEA. All data as well as any statements regarding future direction and intent are subject to change and withdrawal without notice. This information could include technical inaccuracies or typographical errors.
Design of Access Control Policy Checker (ACPC)

Any type of system, having different users, need to have a access control system for authorized access and prevention of harm. Access Control System which is specifying separately in the system by a separate policy specification is a solution for that problem. Access Control System contains the different policies, whose work is to receive access requests then it consults to the policy and then returns a response, specifying that the user request is permitted or denied. To implement these access control policies are not an easy task, because of the huge system requirement. For checking the correctness of the policies which is deployed into the system are very difficult. In this thesis, a systematic and automated toll for policy testing is provided. For test a policy it involve generation of test cases, evaluation of policies with respect to those test cases and at last comparison between the expected and actual results. In the approach to policy testing, we conducted the change-impact analysis for generating the requests, and mutation testing for testing the specified policy. The testing framework called ACPC (Access Control Policy Checker), used Margrave tool [25] to perform change-impact analysis [7] for generating requests. We have choosen like previous work [22] an access control specification language, Extensible Access Control Markup Language (XACML). We conducted experiments using nine policy sets to evaluate the effectiveness by the framework. The experimental result shows that ACPC can effectively generate requests to achieve high structural coverage of policies and outperforms random requests generation in terms of structural coverage and fault-detection capability. We have used nine mutation operators to make the mutant policy for mutation testing. We found the better result by classify these mutation operator in to three classes. We got up to 98% of mutant killed by one class of mutation operator, this results shows that, the classification gives better performance in terms of cost and time.
PROSO data model - a solution for modelling historical academic prosopographical records as linked data through an event based ontological approach.

Two short presentations and the source code of a small demo given at the Atelier Heloise Workshop on interoperability 2014. The workshop was called to discuss proposals in models and solutions to enable an efficient data exchange between several European projects on Historical Academic Prosopographic Databases. On behalf of the CRR-MM, I proposed some solutions based on the PROSO data model for prosopographies, extending said model into an ontology and thus exposing the data from each project as RDF triples. Aside from the general presentation on possible solutions, a SPARQL endpoint was prepared for an interactive demo. The triplestore was loaded with a sample dataset taking into account several of the peculiarities of the participating projects, and some sample queries on said data were prepared.
Statistical analysis on students' performance on ST2063 statistical programming package for semester 2 2006/2007 session : A comparative analysis on gender, programme, status and year of study

ST2063 Statistical Programming Package is a core subject for most students in School of Science and Technology, Universiti Malaysia Sabah. This study discussed the students' performance on ST2063 Statistical Programming Package for Semester 2 2006/2007 Session on gender. programme, students' status and year of study. The data consisted of ST2063 Statistical Programming Package results of 269 students in Semester 2 2006/2007 Session. This study utilized Independent-Samples t-Tests and Analysis of Variance for the analysis methods. From this study, it was statistically significant that female students performed better than male students on ST2063 Statistical Programming Package total marks for Semester 2 2006/07 Session. There were significant mean differences for ST2063 Statistical Programming Package total marks between first and third year students, between first and second year students and between second and third year students. Biotechnology students performed better than Plant Technology students, Conservation Biology students, Physics with Electronics students, Marine Science students and Environmental Science students on ST2063 Statistical Programming Package total marks for Semester 2 2006/07 Session. There was no significant mean difference between the status of the students on students' performance on ST2063 Statistical Programming Package.
An optimized high-order implicit FDTD solver with one-sided TF/SF for simulation of photonic devices

In this paper an optimized high-order implicit finite difference time domain (FDTD) solver with one-sided total-field/scattered-field (TF/SF) excitation is developed for numerical simulation of integrated optical components. The optimized FDTD algorithm reduces the number of operations and the storage requirements to perform the matrix inversion using LU decomposition. It is shown that the one-sided TF/SF formulation is more accurate in launching the exact power into the simulation domain as well as decreasing the load on the PML-ABCs. The implementation of this tool was done in the Prometheus program, a software package of Kymata Netherlands.
Efficient processing of set-similarity joins on large clusters

Joining two datasets where the join condition is based on set similarity instead of equality is very important in many applications, such as social networks, master data management, plagiarism detection, and query refinement based on users' similar preferences. For instance, finding Web site members with similar interests and removing duplicate customers after company acquisitions are two examples. Additionally, many applications need to deal with a large amount of data that cannot be processed by a single machine. Using clusters of machines where algorithms are executed in parallel is a more scalable approach. Recently, scalable, shared-nothing, data-intensive computation platforms have gained attention from both industry and academia. This trend started with the MapReduce framework, and more general frameworks have been proposed recently. In this thesis we study how to efficiently perform set-similarity joins, a.k. a. fuzzy-joins, on large shared-nothing clusters. We propose a three-stage approach for computing end-to-end set-similarity joins. The input to the approach is a set of records (or two sets of records), and the output is a set of joined records based on the desired set-similarity condition. The proposed approach efficiently partitions fuzzy-join processing across many nodes, balancing the workload and minimizing the need for data replication. This thesis makes three contributions related to the proposed three-stage approach to compute fuzzy-joins. First, we study fuzzy-joins in the context of the popular MapReduce framework. Next, we propose a set of improvements to the MapReduce runtime model to improve its handling of fuzzy-join queries as well as other types of queries. Finally, we study fuzzy-joins in the context of a new data-intensive computing platform being developed at UC Irvine, ASTERIX. We show how to integrate fuzzy-joins into the system starting at the query language level and ending in efficient execution. Along with each of the contributions, we provide performance results from experiments on real datasets, synthetically increased in size, to study the speedup and scaleup properties of our techniques.
Fair load balancing under skewed popularity patterns in heterogeneous DHT-based P2P systems

Distributed Hash Tables provide a scalable way of indexing shared data items in P2P systems. The scalability of DHTs mainly relies on the mechanism by which the system's load is fairly balanced among all participating nodes. This is usually achieved through a uniform hash function that randomly maps data items to nodes in the DHT. While this scheme provides item-balancing guarantees, it fails in balancing the actual load of the system by (1) making the simplifying assumption that all items are equally popular, i.e., they incur the same query-load on their hosting nodes, and (2) assuming that all nodes have comparable capacities. In this paper, we address this issue by considering a more practical characterization of a system's load, and propose a load balancing mechanism that takes into account data (un)popularity and node heterogeneity. We first redefine the notion of load in terms of the number of queries per time frame. Load is then balanced by dynamically adjusting the DHT structure so that it best captures node capacities and query-load distributions over data items. We also evaluate our solution in the context of ring-based DHT structures and show its performance gain over basic DHT load balancing schemes.
From Knowledge Management to Technology- Enhanced Workplace Learning: Issues and Examples

A liquid bulk density monitoring apparatus which is particularly suitable for monitoring suspended sediment levels has a plummet suspended from one end of a balance beam and submerged in a vessel containing a liquid to be monitored. A sensor detects tilting of the beam from a reference or balance position as a result of variation in the sample bulk density, and produces an output to an output device for recording density variations. The apparatus is designed to compensate automatically for any changes in temperature, for example by making the plummet of a material having a coefficient of thermal expansion substantially the same as that of the liquid being monitored.
Object Recognition, A Survey of the Literature

This paper surveys the techniques which have been applied to the problem of recognising three-dimensional objects in two-dimensional images. Human vision was discussed in the works of the ancient Greek philosophers, and has also been of interest to modern philosophers. The Gestalt school of psychology in the early part of the twentieth century provided a number of useful insights into human perception. Computer vision research e ectively started with the pioneering work of Roberts, who built a program capable of recognising simple objects in a blocks world. The blocks world paradigm provides a simpli ed model in which new approaches can be tested, and has been adopted from time to time by a number of researchers. The dominant paradigm in modern computer vision research is that pioneered by Marr, and known as inverse optics, or the Marr paradigm. In this approach, edges, surfaces and depth cues are identi ed before object recognition is attempted. Central problems in much of this work are edge detection and region segmentation, which have proved to be more di cult than was anticipated by early researchers. The results achieved up till now suggest that it may not be possible to perform a perfect segmentation of the image before proceeding to higher level processing. Recently some researchers have investigated the use of cues from perceptual organisation in order to perform object recognition without using complete depth information. The perceptual organisation approach promises to reduce the amount of computation that has to be performed. This would be highly desirable since it is widely believed that a practical computer vision system for processing natural scenes would require many G ops of processing power.
Multi-Level microTESLA: A Broadcast Authentication System for Distributed Sensor Networks

Broadcast authentication is a fundamental security service in distributed sensor networks. This paper presents the development of a scalable broadcast authentication scheme named multi-level microTESLA based on microTESLA, a broadcast authentication protocol whose scalability is limited by its unicast based initial parameter distribution. Multi-level microTESLA satisfies several nice properties, including low overhead, tolerance of message loss, scalability to large networks, and resistance to replay attacks as well as denial of service attacks. This paper also presents the development of a multi-level microTESLA broadcast authentication system on TinyOS, an operating system for networked sensors, and experimental results obtained through simulation.
A Docking Experiment: Swarm and Repast for Social Network Modeling

Axtell, Axelrod, Epstein and Cohen (1996) describe a docking or alignment process and experiment for verifying simulations. By comparing simulations built independently using different simulation tools, the docking or alignment process may discover bugs, misinterpretation of model specification, and inherent differences in toolkit implementations. If the behavior of the multiple simulations are similar, then verification confidence is increased. North and Macal (2002) reported on such experiment using Mathematica, Swarm and RePast to simulation the Beer Distribution Game (originally simulated using system dynamics simulation methods).
Algorithmic Techniques in Gene Expression Processing. From Imputation to Visualization

The amount of biological data has grown exponentially in recent decades. Modern biotechnologies, such as microarrays and next-generation sequencing, are capable to produce massive amounts of biomedical data in a single experiment. As the amount of the data is rapidly growing there is an urgent need for reliable computational methods for analyzing and visualizing it. This thesis addresses this need by studying how to efficiently and reliably analyze and visualize high-dimensional data, especially that obtained from gene expression microarray experiments. First, we will study the ways to improve the quality of microarray data by replacing (imputing) the missing data entries with the estimated values for these entries. Missing value imputation is a method which is commonly used to make the original incomplete data complete, thus making it easier to be analyzed with statistical and computational methods. Our novel approach was to use curated external biological information as a guide for the missing value imputation. Secondly, we studied the effect of missing value imputation on the downstream data analysis methods like clustering. We compared multiple recent imputation algorithms against 8 publicly available microarray data sets. It was observed that the missing value imputation indeed is a rational way to improve the quality of biological data. The research revealed differences between the clustering results obtained with different imputation methods. On most data sets, the simple and fast k-NN imputation was good enough, but there were also needs for more advanced imputation methods, such as Bayesian Principal Component Algorithm (BPCA). Finally, we studied the visualization of biological network data. Biological interaction networks are examples of the outcome of multiple biological experiments such as using the gene microarray techniques. Such networks are typically very large and highly connected, thus there is a need for fast algorithms for producing visually pleasant layouts. A computationally efficient way to produce layouts of large biological interaction networks was developed. The algorithm uses multilevel optimization within the regular force directed graph layout algorithm.
MediaWiki Administrators' Tutorial Guide: Install, manage, and customize your MediaWiki installation

This book covers the open-source MediaWiki wiki engine from installation and getting started through structuring your collaborative website, advanced formatting, images, multimedia, security, and managing users to backing up, restoring, and migrating your installation and creating new MediWiki templates.The book has a fast-paced, friendly tutorial style and uses a fun example to teach all of MediaWiki's key features. Run your own MediaWiki collaborative website with this fast-paced, friendly tutorial, which is full of information and advice for creating powerful MediaWiki sites, and filling them with varied and useful collaborative content. Whether you are creating a public wiki for completely open contributions, a private wiki for collaborating within your work team or group of friends, or even a wiki for personal use, this book will show you all the essential steps. You will see the various ways of organizing and managing content, and preventing collaboration from getting out of control. You'll learn how to incorporate images and other media into your pages, as well as becoming a wiki markup wizard to produce intricately formatted pages with tables, lists, and more. On the technical side, the book covers how to administer users, back up and restore content safely, migrate your installation to another server or database, and even make hacks to the code. MediaWiki is the free, open-source wiki engine software that powers Wikipedia and many of the other popular wikis across the Web. Written in PHP, it possesses many features that make it the engine of choice for large collaborative wikis: flexible markup, comprehensive user management, multimedia handling, and more. Get your MediaWiki site up fast Manage users, special pages, and moreCustomize and extend your MediaWiki siteCreate new, attractive MediaWiki themes
Fuzzy Typing for Document Management

Clairvoyance Corporation5301 Fifth AvenuePittsburgh, PA 15232 USAp.subasic@clairvoyancecorp.comThis prototype system demonstrates a novelmethod of document analysis and management,based on a combination of techniques from NLPand fuzzy logic. Since the central technique weuse from NLP is semantic typing, we refer tothis approach as
A MULTIRESOLUTION BINNING ALGORITHM, TO ANALYSE NEUTRON SPECTROSCOPY DATA

Volume modelling and visualization pose important challenges for scientific data handling. Neutron spectroscopy is an intensity-limited technique where efficient data capture is a must. Such requirements are usually met using wide angular coverage detectors. Such devices may generate several gigabytes of information produced for an individual experiment, which needs to be handled within short lapses of time. This paper describes a technique for the construction of a volume model using information coming from different levels of ’binning’ resolutions to be applied to the raw (as measured) data. The technique which is adaptive in nature provides an efficient representation of the information, allowing to explore in detail regions of the experimental 4D space where the sought data is concentrated.
Static smartphone malware detection

Static anaylsis represents an approach of checking source code or compiled code of applications before it gets executed. Chess and McGraw state that static anaylsis promises to identify common coding problems automatically. While manual code checking is also a form of static analysis, software tools are used in most cases in order to perform the checks. Chess and McGraw additionaly claim that good static checkers can help to spot and eradicate common security bugs.