Miracle-dz/UniFAR-FTUs huggingface dataset:
Study and implementation on parallel processing algorithm for DEPS

A study on efficient visualization and real-time interactivity of large-scale scenes is discussed. Introducing parallel processing technology, we present a parallelizable strategy with the pipeline algorithm, realize this parallel algorithm based on shared-memory, and then apply this program to a test site, the Peking Olympic Games planning mixed scenes, including real-time rendering, dynamical texture loading, quick browsing and so on. The results show a running performance and real-time interactivity improvement of DEPS (Digital Earth Prototype System) when using this algorithm. The parallel program of this paper was developed and running on a Silicon Graphics multiprocessor, Onyx 3200, with four MIPS R12000 processors and InfiniteReality 3 graphic accelerator, under IRIX 6.5 operating system.
Synthesis of some ketones via nano-nickel oxide catalyzed acylation of arylzinc reagents; strategy involving the use of mixed (methyl)(aryl)zincs

Nano-NiO catalyzed acylation of mixed (methyl)(aryl)zincs with aromatic acyl halides in THF at room temperature provides a new facile route for aryl–aroyl coupling. Among NiCl2 . L2 and NiCl2 . L (L = monodentate and bidentate phosphine ligand) catalysts, the lower catalyst loading of NiCl2 (dppf) may seem attractive; however, nano-NiO, being the lowest cost catalyst, is more favorable for aroylation of (methyl)(aryl)zincs. This procedure also provides a supplement to Cu and Pd catalyzed acylation of diorganozincs.
Intelligent Inspiration to Salvage Enery in Ad-hoc Network Using Biological Agent

The wireless ad-hoc networks are decentralized, the nodes in the network communicated without any pre-established arrangement. One of the main challenging issues in an ad-hoc network is an efficient usage of the energy. The significance of the network is if one node flop due to energy level, then the entire network topology may change. Effective utilization of the nodes energy enhances the network longevity. The proposed paper, define an algorithm which uses the Genetic Algorithm (GA) technique to enhance the network lifetime by finding nominal track between the nodes by implementing a fitness rule with minimal time. Thus the 85% of the routing overhead may reduce by using biological agents.
Machine tractable dictionaries: design and construction

The purpose of the research in this volume is to design a machine-tractable dictionary from the Longman Dictionary of Contemporary English (LDOCE). A machine-tractable dictionary is intended to be a basic facility for a whole spectrum of natural language processing tasks. The research adopts a compositional-reduction approach to obtain a set of empirically derived definitional primitives and use them to construct formalized sense entries in a nested predicate form where the predicates are a set of definitional primitives called "seed senses". Over 40 years of continuous effort at natural language processing have led the research community in this area to the realization that very large machine tractable dictionaries are essential to success in any further computational attempts at natural language. The emergence of machine-readable data, such as dictionaries, encyclopedias, and documents of a general, unrestricted nature as by-products of modern typesetting technology, facilitates the derivation of very large lexicons and knowledge bases at low costs. An open research question in computation lexicography in particular and natural language processing in general involves the machine tractability of these lexicons. A lexicon is machine tractable only when it assists copmuter understanding of natural language text as well as the acquisition of new lexical and world knowledge by the computer.
A Three-level Versioning Model for Component-based Software Architectures

—Software versioning is intrinsic to software evolution. It keeps history of previous software states (versions) and updates the software to the latest stable version. In the last twenty years, a lot of work was dedicated to software versioning. Many version control mechanisms were proposed to store and track software versions for different software forms (code, objects, models, . . . ). This paper addresses in particular software architecture versioning considering three abstraction levels: speciﬁcation, implementation and deployment. In previous work, we proposed an approach that generates evolution plans for three-level component-based software architectures. The gen- erated plans deal with a change initiated from one of the three abstraction levels and propagate it to the other levels in order to keep software descriptions consistent and coherent all along the software lifecycle. On this basis, we propose a versioning model that stores information about evolution and also keeps track of the right version of architecture descriptions at a given abstraction level.
Dynamic fuzzy reasoning model with fuzzy cognitive map in Chinese chess

This paper provides a novel Chinese chess model which is based on rule-based system and fuzzy cognitive map for reasoning a best legal move. A 10/spl times/9 guard matrix is generated by FCM to show the status of each intersection. Each entry in the matrix is called a guard value which indicates how an intersection is guarded by the player's side or attacked by the opponent's. The authors also reason the best next move with 36 rules by the membership functions of guard values. Based on the proposed model, not only the legitimacy of the next move can be improved but also the decision time is much shorter than the game tree searching method of alpha-beta model. An example is given to verify the effectiveness of the proposed methodology. Also, a multi-step decision method is presented to double check the legitimacy of this work.
Sensor array processor evaluation with a standardized test case (STC)

A standard test case (STC) for the comparative evaluation of the plethora of modern space-time signal processing techniques is summarized. The STC is thought to be realistic in the context of superimposed multiple discrete and continuous ambient noise fields for a uniform linear array of sensors. Attention is given to the MUSIC direction finder (DF), the ESPRIT DF, the linear prediction based DF and the enhanced minimum variance distortionless response beamformer. The asymptotic estimate of the source subspace dimensionality is used, and the performance of several algorithms for the estimation of the dominant source subspace spanning eigenvectors is evaluated with respect to convergence rate and variance. The issue of false alarms induced by overestimating the source subspace dimensionality relative to the actual number of discrete sources is discussed. No clear performance advantage can be found between gradient search and orthogonal iteration, which are the best of the subspace estimators considered. <<ETX>>
Sickness Absence and Works Councils

Using both household and linked employer-employee data for Germany, we assess the effects of non-union representation in the form of works councils on (1) individual sickness absence rates and (2) a subjective measure of personnel problems due to sickness absence as perceived by a firm's management. We find that the existence of a works council is positively correlated with the incidence and the annual duration of absence. We observe a more pronounced correlation in western Germany which can also be interpreted causally. Further, personnel problems due to absence are more likely to occur in plants with a works council. JEL Classification: J53, I18, M54
Benchmarking Global Leadership

Many studies identified the universal traits and skills of leadership that should be sought out in a leader in order to best handle and lead organizations in a global setting. By recognizing these leaders and analyzing the best practices that make their organizations successful, one may build upon his or her business strategies and core tenants of global leadership. This paper attempts to define and benchmark the importance of teamwork, conflict management, and organizational diversity essential in the current and future success of global organizations.
Evaluation Strategies for the Optimization of Line Source Arrays

Line source arrays (LSAs) are used for large scale sound reinforcement, aiming at the synthesis of highly spatial aliasing-free sound fields for the whole audio bandwidth. Numerical optimization of the loudspeakers’ driving functions can considerably improve the homogeneity of the intended sound field. In this paper we propose enhanced visualization techniques characterizing the array performance. This may lead to a more convenient interpretation of the LSA radiation behavior. By additionally recommended technical quality measures the LSA design and the optimization requirements might be improved. The approach is exemplarily discussed for fictitious LSA models. Based on a least-mean-square error optimization using a loudspeaker weight energy constraint, the driving functions are derived. It is shown by means of the visualizations and measures why this optimization scheme being common practice in sound field synthesis applications is inappropriate for the problem at hand and that spatial aliasing has a large impact on the synthesized sound fields. We recommend to incorporate the proposed quality measures as criteria for future optimization approaches.
Direction of arrival estimation by eigenstructure methods with unknown sensor gain and phase

Direction of arrival estimation by eigenstructure methods requires knowledge of the array covariance matrix and an exact characterization of the array in terms of geometry, sensor gain and phase, etc. It often happens that the actual sensor gain and phase are perturbed from their assumed nominal values. If eigenstructure methods are applied with incorrect sensor parameters, the method essentially breaks down or at best gives poor results. We propose a new approach which uses information in the observed covariance matrix to correct for these effects. This method yields substantially improved performance, a fact illustrated by the results of computer simulations.
Numerical Algorithms for Quadratic Programming for Approximated Predictive Control

In model predictive control optimal control problem (OCP) based on measurement/estimation of current state is solved each sampling time then the the result, inputs control is applied to the plant. The OCP can be efficiently represented via quadratic programming (QP). In general, there are two types of QP formulation of MPC. The first is called dense where QP has smaller number of optimized variables and no zero entries. The second is called sparse, here QP is formulated with larger number of optimized variables but with many zero entries and sparsity structure occurs. In order to control of real-time process applications solution for the QP solved each time should be found very quickly (let say in ms or even μs). Thus in order to reduce the computational complexity of the QP related to box constrained linear model predictive control (MPC) two novel approximations of MPC are introduced in this work: The first one (sparse) which enables utilization of the MPC specific structure. This approximation is based on idea not to consider the model dynamics as hard constraint but rather modify the objective function of MPC to capture the violation of not fulfilling the model dynamics. Furthermore, the specific sparsity structure of the approximated box constrained MPC problem is exploited in the computation of gradient and Newton’s step in the combined Newton/gradient projection algorithm. It is shown by an examples that the proposed method is faster or competitive to other state of the art solvers while retaining a performance level. The second one (dense) aims on reducing degree of freedom in the QP since the bottleneck of a dense formulation is that its solving time growths cubically with number of inputs and length of prediction horizon. Thus approach which approximate part of the horizon and hence reduces size of the QP formulation is introduced. Moreover it is shown that although only beginning of horizon is assumed exactly overall controller performance will not be influenced much.
Optimising the neutron environment of Radiation Portal Monitors: a computational optimisation study

Efficient and reliable detection of radiological or nuclear threats is a crucial part of national and international efforts to prevent terrorist ac tivities. Radiation Portal Monitors (RPMs), which are deployed worldwide, are intended to i nterdict smuggled fissile material by detecting emissions of neutrons and gamma rays. However, considering the range and variety of threat sources, vehicular and shiel ding scenarios, and that only a small signature is present, it is important that the design of the RPMs allows these signatures to be accurately differentiated from the enviro mental background. Using Monte-Carlo neutron-transport simulations of a model heli um-3 detector system we have conducted a parameter study to identify the optimum com bination of detector shielding and collimation that maximises the sensitivity o f RPMs. These structures, which could be simply and cost-effectively added to existin g RPMs, can improve the detector response by more than a factor of two relative to an u nmodified, bare design. Furthermore, optimisation of the air gap surrounding the he lium tubes also improves detector efficiency.
Communalizing the Interfaces Of Single Player Games

New interfaces for games have reinvented the experience of play, but every interface works on the basic assumption of responsiveness. If a user sends a command via the interface, they expect to see a change in the game state. The recent multiplayer game Twitch Plays Pokémon is revolutionary because it rejects this assumption of responsiveness. By taking user commands in the aggregate, a user does not build a direct mental correlation between input and state change. We call this type of interface a communally controlled interface (CCI). A CCI can be used as a game design element to act as an educational tool, to help build narrative, or to inspire players to engage with a game in unforeseen ways.
Towards defining perceived urban density

The aim of the paper is to identify parameters that influence perceived urban density. Whilst it is standard for architects and planners to consider urban density, there is often no consideration of how individuals might perceive such density. We report the findings of a study in which participants rate photographs of urban scenes according to perceived urban density. The case study area is central Zurich, Switzerland. The images are analyzed according to six parameters: visibility, amount of buildings, street width, amount of sky, amount of green space, and amount of vehicles. We report the findings of where images were ranked along a scale from lowest to highest perceived urban density. Findings show that visibility alone is not enough to explain the rating of perceived urban density. The study is a first step towards reaching a definition of perceived urban density that can be applied to different urban contexts.
Computational Ship Hydrodynamics : Opportunities and Challenges

The development of computational ship hydrodynamics is reaching the milestone of providing firstgeneration simulation-based design tools with vast capabilities for modeland full-scale simulations and optimization, after the monumental progress over the last ten years. It can be attributed to the availability of greatly increased computing power and the applications of major enabling technologies such as free surface tracking/capturing, turbulence modeling, 6DOF motion prediction, dynamic overset grids, local/adaptive grid refinement, high performance computing, environmental modeling, and optimization methods. Herein, various modeling, numerical methods, and high performance computing approaches for computational ship hydrodynamics are evaluated thereby providing a vision for the development of the next-generation high-fidelity simulation tools. Verification and validation procedures and their applications, including resistance and propulsion, seakeeping, maneuvering, and stability and capsize, are reviewed. Issues, opportunities, and challenges for advancements in higher-fidelity two-phase flow are addressed. Fundamental studies for two-phase flows are also discussed. Conclusions and future directions are also provided.
Cartesian Closed Category of Parallel Algorith: between Scott Domains

We present a category-theoretic framework for providing intensional semantics of programming languages and establishing connections between semantics given at different levels of intensional detail. We use a comonad to model an abstract notion of computation, and we obtain an intensional category from an extensional category by the co-Kleisli construction; thus, while an extensional morphism can be viewed as a function from values to values, an intensional morphism is akin to a function from computations to values. We state a simple category-theoretic result about cartesian closure. We then explore the particular example obtained by taking the extensional category to be C o n t, the category of Scott domains with continuous functions as morphisms, with a computation represented as a non-decreasing sequence of values. We refer to morphisms in the resulting intensional category as algorithms. We show that the category A lg of Scott domains with algorithms as morphisms is cartesian closed. We define an intensional partial order on algorithms, with respect to which application, currying and composition are continuous. We show that every algorithm determines a continuous input-output function, and that every continuous function is the input-output function of some algorithm. This is in contrast to the sequential algorithms model of Berry and Curien, in which algorithms determine the sequential input-output functions (between concrete domains).
5-Order Turbulence Parameterization

A sophisticated land-surface model, PLACE, the Parameterization for Land Atmospheric Convective Exchange, has been coupled to a 1.5-order turbulent kinetic energy (TKE) turbulence sub-model. Both have been incorporated into the Penn State/National Center for Atmospheric Research (PSU/NCAR) mesoscale model MM5. Such model improvements should have their greatest effect in conditions where surface contrasts dominate over dynamic processes, such as the simulation of warm-season, convective events. A validation study used the newly coupled model, MM5 TKE-PLACE, to simulate the evolution of Florida sea-breeze moist convection during the Convection and Precipitation Electrification Experiment (CAPE). Overall, eight simulations tested the sensitivity of the MM5 model to combinations of the new and default model physics, and initialization of soil moisture and temperature. The TKE-PLACE model produced more realistic surface sensible heat flux, lower biases for surface variables, more realistic rainfall, and cloud cover than the default model. Of the 8 simulations with different factors (i.e., model physics or initialization), TKE-PLACE compared very well when each simulation was ranked interms of biases of the surface variables and rainfall, and percent and root mean square of cloud cover. A factor separation analysis showed that a successful simulation required the inclusion of a multi-layered, land surface soil vegetation model, realistic initial soil moisture, and higher order closure of the planetary boundary layer (PBL). These were needed to realistically model the effect of individual, joint, and synergistic contributions from the land surface and PBL on the CaPE sea-breeze, Lake Okeechobee lake breeze, and moist convection.
Optimizing deceptive functions with the SG-Clans algorithm

Starting from a different view of natural evolution, namely that of English biologist R. Dawkins, called the selfish gene theory, a new evolutionary computation approach can be developed, the selfish gene (SG) algorithm. This paper presents a significant improvement to the SG algorithm that is able to find and exploit linkages among different genes thanks to the evolution of isolated groups called clans. The resulting SG-Clans algorithm is shown to be able to find the absolute maximum of Holland Royal Road functions, which were specifically designed to create insurmountable difficulties for a wide class of hill-climbing approaches. We support experimental evidence that SG-Clans shares the speed of a hill-climber with the ability of broadly exploring the search space.
Automated Essay Scoring : A Cross-disciplinary Perspective

Contents: C. Bereiter, Foreword. M.D. Shermis, J.C. Burstein, Preface. Introduction. Part I:Teaching of Writing. M. Myers, What Can Computers Contribute to a K-12 Writing Program? Part II:Psychometric Issues in Performance Assessment. G.K. W.K. Chung, E.L. Baker, Issues in the Reliability and Validity of Automated Scoring of Constructed Responses. Part III:Automated Essay Scorers. E.B. Page, Project Essay Grade: PEG. L.S. Larkey, W.B. Croft, A Text Categorization Approach to Automated Essay Grading. S. Elliot, Intellimetric(TM): From Here to Validity. T.K. Landauer, D. Laham, P.W. Foltz, Automated Scoring and Annotation of Essays With the Intelligent Essay Assessor. J. Burstein, The E-Rater(R) Scoring Engine: Automated Essay Scoring With Natural Language Processing. Part IV:Psychometric Issues in Automated Essay Scoring. G.J. Cizek, B.A. Page, The Concept of Reliability in the Context of Automated Essay Scoring. T.Z. Keith, Validity and Automated Essay Scoring Systems. M.D. Shermis, K.E. Daniels, Norming and Scaling for Automated Essay Scoring. S. Ponisciak, V. Johnson, Bayesian Analysis of Essay Grading. Part V:Current Innovation in Automated Essay Evaluation. C. Leacock, M. Chodorow, Automated Grammatical Error Detection. J.C. Burstein, D. Marcu, Automated Evaluation of Discourse Structure in Student Essays.
Oversampled OFDM systems

Orthogonal frequency division multiplex (ODFM) is an attractive way of transmitting signals, by turning a wide-band signal into several narrow band ones. Orthogonal transmultiplexers are the basic tools required for emitting these signals and recovering them at the receiver side. It is well known that the only DFT modulated transmultiplexers are based on a rectangular window as a prototype, if one sticks to critically sampled systems. This paper investigates the possibilities brought by using oversampled FIR transmultiplexers instead of the critically sampled ones.
A web-based solution for 3D medical image visualization

In this presentation, we present a web-based 3D medical image visualization solution which enables interactive large medical image data processing and visualization over the web platform. To improve the efficiency of our solution, we adopt GPU accelerated techniques to process images on the server side while rapidly transferring images to the HTML5 supported web browser on the client side. Compared to traditional local visualization solution, our solution doesn’t require the users to install extra software or download the whole volume dataset from PACS server. By designing this web-based solution, it is feasible for users to access the 3D medical image visualization service wherever the internet is available.
An algorithm and architecture for approximate string matching

Approximate string matching attempts to determine how similar two strings are. An algorithm is developed for determining relative string similarity. An architecture for comparing strings using this algorithm is also developed. Using parallelism and iterative techniques, the similarity value is calculated. The length and number of matching substrings determine the amount of similarity. <<ETX>>