ppxscal/embedding_network huggingface dataset:
Numerical evaluation of lightning channels in two-layer soils and application
Authors: Z. Song, M. R. Raghuveer, J. He
Venue: International Journal of Modelling and Simulation (2008)

A lightning strike is known to result in the formation of breakdown channels in ground that may be intercepted by buried cables in the vicinity of the strike point, with attendant consequences. Modelling this phenomenon is important in order to be able to devise protective and mitigating strategies. Existing models do not adequately take into account breakdown channel formation in ground and ignore soil nonhomogeneity. The authors present a representative two-dimensional model that accounts for the random growth of channels in two-layered nonhomogeneous soils governed by the local electric field strength. The influence of lightning current magnitude, geometric configuration, and soil parameters is considered. The suggested model provides a means for complete assessment of the lightning performance of underground cables.
Combining fuzzy sammon mapping and fuzzy clustering approach to perform clustering effect analysis: Take the banking service satisfaction as an example
Authors: Wen-Tsao Pan
Venue: Expert Systems with Applications: An International Journal (2010)

Hard clustering and fuzzy clustering analysis is the basis of the construction of many classifications and systems with its main focus on planning and dividing data into many subsets according to certain rules. Due to the practical function of clustering analysis, many researchers thus proposed different clustering algorithms to be used by researchers around the world. In this article, Fuzzy sammon Mapping method is implemented to perform clustering effect and classification capability analysis on these frequently used clustering algorithms. From the result of test data of an investigation of banking service satisfaction, GK Cluster algorithm was found to have very good clustering effect; however, as for classification capability, hard clustering analysis method has proved to be the better approach amongst the two.
Fair resource allocation in wireless networks in the presence of a jammer
Authors: E. Altman, K. Avrachenkov, A. Garnaev
Venue: Performance Evaluation (2010)

We consider jamming in wireless networks in the framework of zero-sum games with @a-fairness utility functions. The base station has to distribute the power fairly among the users in the presence of a jammer. The jammer in turn tries to distribute its power among the channels to produce as much harm as possible. The Shannon capacity and the SNIR optimization are particular cases of the proposed more general @a-fairness SNIR based utility functions. Specifically, we consider two @a-fairness utility functions, based on SNIR and Shifted SNIR. This game can also be viewed as a minimax problem against the nature. We show that the game has the unique equilibrium and investigate its properties. In particular, in several important cases we present the equilibrium strategies and Jain's fairness index in closed form. It turns out that there is an important difference between SNIR and Shifted SNIR @a-fairness utility functions. In the case of the SNIR based utility function all users obtain non-zero powers when @a>0. On the contrary, when the Shifted SNIR based utility function is used, some users with bad channel conditions might not receive any power at all.
Distributed and Collaborative Software Evolution Analysis with Churrasco
Authors: Marco DAmbros, Michele Lanza
Venue: Science of Computer Programming (2010)

Analyzing the evolution of large and long-lived software systems is a complex problem that requires extensive tool support due to the amount and complexity of the data that needs to be processed. In this paper, we present Churrasco, a tool to support collaborative software evolution analysis through a web interface. After describing the tool and its architecture, we provide a usage scenario of Churrasco on a large open source software system, and we present two collaboration experiments performed with, respectively, 8 and 4 participants.
Note-against-note two-voice counterpoint by means of fuzzy logic
Authors: Asim Egemen Yilmaz, Ziya Telatar
Venue: Knowledge-Based Systems (2010)

In this study, we propose a fuzzy logic based approach for the 'harmonization with constraints' problem in music. After the mathematical modeling of the harmonization problem, the solution is carried out by means of proper fuzzy membership functions depending on the rules imposed by the music theory. To demonstrate the applicability of the proposed technique, particular problems of note-against-note two-voice counterpoint are considered. The method is flexible, adaptable and simple in terms of implementation. Moreover, from the constraint satisfaction perspective, the solutions generated by the method satisfy 'arc-consistency'; which could not have been achieved by majority of the previous studies existing in the literature. The method also provides a gateway for the arranger/composer to incorporate his/her own stylistic preferences to the solution by simply adjusting the shapes of the membership functions. Additional features (such as providing variability in the final solutions at different executions) increase the power of the method in terms of creativity. This approach can be extended for the solution of more complicated problems in music such as orchestration, improvisation, and even composition.
Enterprise model management systems
Authors: David Sundaram, Elke Wolf
Venue: Proceedings of the International Workshop on Enterprises & Organizational Modeling and Simulation (2009)

Decision making in the managerial context is often unstructured, ad-hoc, and complex. It involves structuring and solving the problem, and interpreting the results. A computer-based environment that supports these decision making processes is characterised by a modelling approach that enables the representation of the complexity of the problem, access to data and solvers, persistence of problem representation, and the ability to manipulate and integrate problem representations. Lack of a general framework for conceptual modelling and constraints imposed by technology have, in the past, limited the design and implementation of enterprise model management systems (EMMS). This research attempts to overcome key problems in EMMS design and implementation by proposing, implementing, and evaluating a modelling framework that uses Structured Modelling to describe models, object-oriented and relational constructs to represent models, and predicate calculus-based extended Structured Query Language (ESQL) to manipulate models.
Rapid low fidelity turbomachinery disk optimization
Authors: David P. Gutzwiller, Mark G. Turner
Venue: Advances in Engineering Software (2010)

Turbomachinery disks are heavy, highly stressed components used in gas turbines. Improved design of turbomachinery disks could yield a significant reduction in engine weight. This paper focuses on rapid low fidelity design and optimization of isotropic and transversely isotropic disks. Discussion includes the development of a one dimensional plane stress model, disk parameterization methods, and the implementation of a genetic algorithm for shape optimization. Three traditional geometry definition methods are compared to two new methods that are described and produce more optimum designs. Hardware from the GE E^3 is used as an example. The analysis code is open-source, graphical, interactive, and portable on Windows, Linux, and Mac OS X.
A realistic, virtual head for human-computer interaction
Authors: Samuel Marcos, Jaime Gómez-García-Bermejo, Eduardo Zalama
Venue: Interacting with Computers (2010)

In this paper an interactive and realistic virtual head oriented to human-computer interaction and social robotics is presented. It has been designed following a hybrid approach, taking robotic characteristics into account and searching for a convergence between these characteristics, real facial actions and animation techniques. An initial head model is first obtained from a real person using a laser scanner. Then the model is animated using a hierarchical skeleton based procedure. The proposed rig structure is close to real facial muscular anatomy and its behaviour follows the Facial Action Coding System. Speech synthesis and visual human-face tracking capabilities are also integrated for providing the head with further interaction ability. Using the said hybrid approach, the head can be readily linked to a social-robot architecture. The opinions of a number of persons interacting with this social avatar have been evaluated and are reported in the paper, as against their reactions when interacting with a social robot with a mechatronic face. Results show the suitability of the avatar for on-screen, real-time interfacing in human-computer interaction. The proposed technique could also be helpful in the future for designing and parameterizing mechatronic human-like heads for social robots.
Decision support for the maintenance management of green areas
Authors: Hsin-Yun Lee, Hao-Hsi Tseng, Meng-Cong Zheng, Pei-Ying Li
Venue: Expert Systems with Applications: An International Journal (2010)

For schools, parks, and recreational areas, the maintenance of green areas is important, but it places a heavy burden on both manpower and budget. In this paper, we proposed a model to search for the minimum gardener manpower requirements and a near-optimal maintenance schedule for the green areas. Unlike other applications of ant colony optimization, we grouped the ants into teams to represent gardeners and considered the path of an ant team a schedule solution. We implemented the proposed model using a decision support system called the Garden-Ant. In addition, the feasibility of the model was evaluated on a campus. The results of the evaluation indicated that the proposed model could provide an appropriate maintenance plan, including manpower estimation and an all-inclusive maintenance schedule. Because the complicated calculations are performed by the model instead of by an administrator, the maintenance planning of green areas can be accomplished in an easy and efficient manner.
A parallel genetic programming based intelligent miner for discovery of censored production rules with fuzzy hierarchy
Authors: K. K. Bharadwaj, Saroj
Venue: Expert Systems with Applications: An International Journal (2010)

Automated discovery of rules with exceptions and hierarchical structures is an important problem in data mining. A knowledge structure based on Censored Production Rules with Fuzzy Hierarchy (CPRFH) not only provides an excellent mechanism for handling exceptions but also captures the hierarchical relationship among the classes in the dataset. Moreover, CPRFHs are able to exhibit variable precision logic for approximate reasoning. This paper proposes discovery of knowledge in the form of CPRFHs using island model of genetic programming with two advanced genetic operators, namely; fission and fusion. The fission and fusion operators impart intelligence to the system as these operators discover new classes/concepts which are not present explicitly in the data set being mined. A suitable encoding with syntactic constraints is designed and an appropriate fitness function is suggested to measure the goodness of the hierarchies. The experimental results confirm that the island model with fission and fusion outperforms the sequential as well as the island models without fission and fusion in terms of correctness of the solution arrived and size of the trees evolved.
First-order functional difference equations with nonlinear boundary value problems
Authors: Tadeusz Jankowski
Venue: Computers Mathematics with Applications (2010)

The monotone iterative method is used to show that corresponding difference problems with boundary conditions have extremal solutions in the region bounded by lower and upper solutions. It is important to indicate that the right-hand sides of problems depend on r delayed arguments. Difference inequalities of such types are also discussed. Two examples satisfying the assumptions are presented.
Infrared image segmentation with 2-D maximum entropy method based on particle swarm optimization (PSO)
Authors: Du Feng, Shi Wenkang, Chen Liangzhou, Deng Yong, Zhu Zhenfu
Venue: Pattern Recognition Letters (2005)

The 2-D maximum entropy method not only considers the distribution of the gray information, but also takes advantage of the spatial neighbor information with using the 2-D histogram of the image. As a global threshold method, it often gets ideal segmentation results even when the image's signal noise ratio (SNR) is low. However, its time-consuming computation is often an obstacle in real time application systems. In this paper, the image thresholding approach based on the index of entropy maximization of the 2-D grayscale histogram is proposed to deal with infrared image. The threshold vector (t,s), where t is a threshold for pixel intensity and s is another threshold for the local average intensity of pixels, is obtained through a new optimization algorithm, namely, the particle swarm optimization (PSO) algorithm. PSO algorithm is realized successfully in the process of solving the 2-D maximum entropy problem. The experiments of segmenting the infrared images are illustrated to show that the proposed method can get ideal segmentation result with less computation cost.
Schauder bases and approximation property in fuzzy normed spaces
Authors: Yılmaz Yılmaz
Venue: Computers Mathematics with Applications (2010)

Our aim in this article is to introduce and study the notion of weak and strong Schauder bases in fuzzy normed spaces. Further, we introduce strong and weak fuzzy approximation properties and set a relationship between these two new notions which may provide an acceleration to the structural analysis of fuzzy normed spaces.
Soft BL-algebras based on fuzzy sets
Authors: Jianming Zhan, Young Bae Jun
Venue: Computers Mathematics with Applications (2010)

By means of @?-soft sets and q-soft sets, some characterizations of (implicative, positive implicative and fantastic) filteristic soft BL-algebras are investigated. Finally, we prove that a soft set is an implicative filteristic soft BL-algebra if and only if it is both a positive implicative filteristic soft BL-algebra and a fantastic filteristic soft BL-algebra.
A scalable organization for distributed directories
Authors: Alberto Ros, Manuel E. Acacio, José M. García
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2010)

Although directory-based cache-coherence protocols are the best choice when designing chip multiprocessors with tens of cores on-chip, the memory overhead introduced by the directory structure may not scale gracefully with the number of cores. Many approaches aimed at improving the scalability of directories have been proposed. However, they do not bring perfect scalability and usually reduce the directory memory overhead by compressing coherence information, which in turn results in extra unnecessary coherence messages and, therefore, wasted energy and some performance degradation. In this work, we present a distributed directory organization based on duplicate tags for tiled CMP architectures whose size is independent on the number of tiles of the system up to a certain number of tiles. We demonstrate that this number of tiles corresponds to the number of sets in the private caches. Additionally, we show that the area overhead of the proposed directory structure is 0.56% with respect to the on-chip data caches. Moreover, the proposed directory structure keeps the same information than a non-scalable full-map directory. Finally, we propose a mechanism that takes advantage of this directory organization to remove the network traffic caused by replacements. This mechanism reduces total traffic by 15% for a 16-core configuration compared to a traditional directory-based protocol.
Machine learning approaches for vehicle crash detection
Authors: Gautam B. Singh
Venue:  (2009)

Automobile safety can be improved by detecting crash quickly, and thereby providing additional time to deploy new safety devices such as slower airbag inflation rates, alarms, seat belt pre-tensioners, window closing, seat stiffeners etc. This requires a discriminative, fast and robust crash sensing system that evaluates crash data and discriminates crash types over a wide range of scenarios. Prompt crash detection not only decreases the mortalities and injuries, but also reduces unnecessary airbag deployments. Studies have shown that unnecessary airbag deployments can cause greater injuries than minor crashes would causes. The state of the art Smart Airbags faces two challenges, i.e., quick crash sensing times and discrimination among crashes over a wide range of conditions. Current crash sensing algorithms utilize deceleration or speed change to estimate the severity of crash. Since neither deceleration nor speed change is linear, the resulting algorithms cannot differentiate crash situations, such as low speed rigid barrier versus high-speed deformable barrier, in a timely and robust manner. Moreover, the conventional algorithms are developed using ad hoc processes. The resulting algorithm is not general. We present a Single Point Crash Sensing System based on machine learning principles. Compare to conventional system, our system has the following advantages: (1) Centralized. The Single Point Crash Sensing architecture reduces the cost of components and wiring, and also decreases the vulnerability of the system; (2) Fast. Current frontal impact sensing systems generally detect a crash condition within 15-25 milliseconds; and side impact sensing systems generally discriminate side impacts within 6-13 milliseconds. Our system can detect all kinds of crashes within 6 milliseconds; (3) General. The modularized algorithm present in this thesis is a general approach, which can be easily adapted to different vehicle models. (4) Discriminative. The experiment results indicate that the system maintains high classification accuracy in data streams, hence providing an efficient solution to the classification task. (5) Reliable. The experiment shows that our systems are tolerant of noise. Both HMM Crash Detector and SVM Crash Detector can distinguish crashes from non-crashes in 6-7 ms even if the injected noises reach 100% level. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Phybase
Authors: Liang Liu, Lili Yu
Venue: Bioinformatics (2010)

Motivation: Phybase is an R package for phylogenetic analysis using species trees. It provides functions to read, write, manipulate, simulate, estimate, summarize and plot species trees, which contain not only the topology and branch lengths but also population sizes. Availability: The Phybase package is available at the R repository. The manual and supporting materials including source code, sample R code and sample data files for the species tree analysis are available at http://stat.osu.edu/~liuliang/research/phybase.html Contact: lliu@desu.edu The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Technical communique: A delay-partitioning approach to the stability analysis of discrete-time systems
Authors: Xiangyu Meng, James Lam, Baozhu Du, Huijun Gao
Venue: Automatica (Journal of IFAC) (2010)

This paper revisits the problem of stability analysis for linear discrete-time systems with time-varying delay in the state. By utilizing the delay partitioning idea, new stability criteria are proposed in terms of linear matrix inequalities (LMIs). These conditions are developed based on a novel Lyapunov functional. In addition to delay dependence, the obtained conditions are also dependent on the partitioning size. We have also established that the conservatism of the conditions is a non-increasing function of the number of partitions. Numerical examples are given to illustrate the effectiveness and advantage of the proposed methods.
Approximation related to quotient functionals
Authors: S. Setzer, G. Steidl, T. Teuber, G. Moerkotte
Venue: Journal of Approximation Theory (2010)

We examine the best approximation of componentwise positive vectors or positive continuous functions f by linear combinations f@?=@?"j@a"j@f"j of given vectors or functions @f"j with respect to functionals Q"p, 1@?p@?~, involving quotients max{f/f@?,f@?/f} rather than differences |f-f@?|. We verify the existence of a best approximating function under mild conditions on {@f"j}"j"="1^n. For discrete data, we compute a best approximating function with respect to Q"p, p=1,2,~ by second order cone programming. Special attention is paid to the Q"~ functional in both the discrete and the continuous setting. Based on the computation of the subdifferential of our convex functional Q"~ we give an equivalent characterization of the best approximation by using its extremal set. Then we apply this characterization to prove the uniqueness of the best Q"~ approximation for Chebyshev sets {@f"j}"j"="1^n.
Stabilization and smoothing of pressure in MPS method by Quasi-Compressibility
Authors: Masayuki Tanaka, Takayuki Masunaga
Venue: Journal of Computational Physics (2010)

In this paper, a method to stabilize simulations and suppress the pressure oscillation in Moving Particle Semi-implicit method for an incompressible fluid is presented. To make the pressure smooth in terms of both of space and time, a new representation of the incompressible condition is proposed. The incompressible condition consists of two parts: the Divergence-Free condition and the Particle Number Density condition. The Divergence-Free condition has the effect of making the pressure smooth in terms of both space and time. The Particle Number Density condition is necessary to keep the fluid volume constant. In this work, the Quasi-Compressibility is also introduced for stabilization. A dam break is simulated more stably and the space distribution and the time variation of pressure are evaluated more smoothly than the traditional method. Moreover, surface particles are detected more accurately. Nevertheless the proposed method is computationally cheaper. Some simulations such as a Fluid-Structure Interaction are supposed to be more accurate using this method.