ppxscal/embedding_network huggingface dataset:
Adaptive particles for incompressible fluid simulation
Authors: Woosuck Hong, Donald H. House, John Keyser
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

We propose a particle-based technique for simulating incompressible fluid that includes adaptive refinement of particle sampling. Each particle represents a mass of fluid in its local region. Particles are split into several particles for finer sampling in regions of complex flow. In regions of smooth flow, neighboring particles can be merged. Depth below the surface and Reynolds number are exploited as our criteria for determining whether splitting or merging should take place. For the fluid dynamics calculations, we use the hybrid FLIP method, which is computationally simple and efficient. Since the fluid is incompressible, each particle has a volume proportional to its mass. A kernel function, whose effective range is based on this volume, is used for transferring and updating the particle&#x2019;s physical properties such as mass and velocity. Our adaptive particle-based simulation is demonstrated in several scenarios that show its effectiveness in capturing fine detail of the flow, where needed, while efficiently sampling regions where less detail is required.
ModelScope: inspecting executable models during run-time
Authors: Philipp Graf, Klaus D. Müller-Glaser
Venue: Companion of the 30th international conference on Software engineering (2008)

This paper presents a software tool called ModelScope which is a co-debugging platform that, during run-time, allows insight into a model running on various different target systems with different views and diagrams for different aspects of the run-time state.
A high order accurate conservative remapping method on staggered meshes
Authors: Juan Cheng, Chi-Wang Shu
Venue: Applied Numerical Mathematics (2008)

An accurate remapping algorithm is an essential component of the Arbitrary Lagrangian-Eulerian (ALE) methods. Most ALE codes applied to high speed flow problems use a staggered mesh, i.e., all the solution variables except the velocities are cell-centered while the velocities are vertex-centered. In this paper, we present a high order accurate conservative remapping method on staggered meshes by using the idea of essentially non-oscillatory (ENO) schemes. The algorithm is based on the ENO reconstruction and approximate integration. On the staggered mesh, two sets of control volumes are built for the cell-centered conserved quantities including the mass and total energy and vertex-centered quantity-momentum respectively. On each rezoning step, we first reconstruct a polynomial function by the cell averages of mass, energy and momentum on their old control volumes. ENO idea is used to choose the best stencils for reconstruction to avoid oscillation. Then, we integrate the reconstructed functions of the old cells over the rezoned cell. These procedures of remapping ensure the algorithm to have the properties of conservation, high order accuracy and essentially non-oscillatory output. A suite of one and two dimensional examples are given to verify the performance of the algorithm.
Web-Based Support Coordination by Using WIDIS - Case Study of Chuesu-oki Earthquake in 2007
Authors: Nobuhiro Sawano, Tsuyoshi Hoshikawa, Takayuki Obata
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

One of the major earthquakes named "Chuesu-oki Earthquake" happened in Niigara Prefecture, in the central part of Japan on July 16, 2007. Since four days after the earthquake, our researchers’ team has joined volunteer coordination activities as so called “information volunteer” by using WIDIS (WIde area Disaster Information Sharing system) which is a kind of web based geographical information system. Our activity includes 1) making daily reports on the activity and disclosing information by using WIDIS (http://saigai.jp/), 2) building and updating database for affected houses, 3) coordination activities of volunteers to the disaster victims. WIDIS has been actually used for all aspects of these activities. Through these experiences, it became clear that G-WIDIS can be effectively used to coordinate disaster relevant information between each volunteer centre which will be placed in afflicted cities and towns.
Note: A major index for matchings and set partitions
Authors: William Y. C. Chen, Ira M. Gessel, Catherine H. Yan, Arthur L. B. Yang
Venue: Journal of Combinatorial Theory Series A (2008)

We introduce a statistic pmaj(P) for partitions of [n], and show that it is equidistributed with cr"2, the number of 2-crossings, over all partitions of [n] with given sets of minimal block elements and maximal block elements. This generalizes the classical result of equidistribution for the permutation statistics inv and maj.
Peer-to-peer brokering of planning meta-data
Authors: Johannes Oudenstad, Frank Eliassen, Eli Gjørven, Romain Rouvoy
Venue: Proceedings of the 6th international workshop on Adaptive and reflective middleware: held at the ACM/IFIP/USENIX International Middleware Conference (2007)

In self-adaptive systems, metadata about resources in the system (e.g., services, nodes) must be dynamically published, updated, and removed. Current middleware approaches use statically configured, centralised repositories for storing and retrieving of such metadata. However, in the context of peer-to-peer (P2P) environments, we can not assume the existence of server nodes that are always available for hosting such centralised services. Thus, in our planning-based adaptation middleware, we introduce a P2P broker, which is a metadata advertisement service based on P2P technology. We use a structured P2P protocol that distributes the service metadata over a set of nodes based on service type and property information. Initial experiments show that the metadata distributes well over the nodes in the network, thus enabling scalability and robustness to node failures.
On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces
Authors: Emil Ernst, Michel Th&#x00e9;ra
Venue: Mathematical Programming: Series A and B (2008)

As well known, the Moreau-Rockafellar-Robinson internal point qualification condition is sufficient to ensure that the infimal convolution of the conjugates of two extended-real-valued convex lower semi-continuous functions defined on a locally convex space is exact, and that the subdifferential of the sum of these functions is the sum of their subdifferentials. This note is devoted to proving that this condition is, in a certain sense, also necessary, provided the underlying space is a Banach space. Our result is based upon the existence of a non-supporting weak*-closed hyperplane to any weak*-closed and convex unbounded linearly bounded subset of the topological dual of a Banach space.
Speaker identification in the shouted environment using Suprasegmental Hidden Markov Models
Authors: Ismail Shahin
Venue: Signal Processing (2008)

In this paper, Suprasegmental Hidden Markov Models (SPHMMs) have been used to enhance the recognition performance of text-dependent speaker identification in the shouted environment. Our speech database consists of two databases: our collected database and the Speech Under Simulated and Actual Stress (SUSAS) database. Our results show that SPHMMs significantly enhance speaker identification performance compared to Second-Order Circular Hidden Markov Models (CHMM2s) in the shouted environment. Using our collected database, speaker identification performance in this environment is 68% and 75% based on CHMM2s and SPHMMs, respectively. Using the SUSAS database, speaker identification performance in the same environment is 71% and 79% based on CHMM2s and SPHMMs, respectively.
Intelligent Dynamic XML Documents Clustering
Authors: Laura Irina Rusu, Wenny Rahayu, David Taniar
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Clustering as an intelligent technique for mining XML documents has been utilised as an excellent way of grouping the documents by their content or structure. A main step in many distance based XML clustering algorithms is to calculate pair-wise distances between documents; naturally, a time-efficient technique requests the pair-wise distances to be determined in a timely manner. In case of dynamic XML documents, the amount of changes between versions cannot be predicted. Therefore, in case of clustered dynamic XML documents, if changes were little or if they affected only some of the clustered documents, recalculating pair-wise distances every time would be highly redundant. In this paper we propose a time-efficient technique to reassess pair-wise distances between clustered dynamic XML documents which change in time, without performing redundant calculations but considering the previously known distances and the set of changes which might have affected the documents versions.
Diagnosis of fuel pump measurement bias in gas turbine engines
Authors: D. D. Santoso, S. M. Hargrave, T. V. Breikin, H. A. Thompson, P. J. Fleming
Venue: International Journal of Systems Science (2007)

This article presents an approach for identification of measurement bias within the fuel pump of a gas turbine engine using principal component analysis and partial least squares approaches. These techniques are used to categorise the levels of deterioration experienced by the engine in order to improve the diagnosis of any measurement bias. This work illustrates that principal component analysis can provide a good estimation of fuel pump measurement bias in a gas turbine engine and improve efficiency of flight by more accurate measurement of fuel. Different methods are investigated to find the best adaptation of principal component analysis for diagnosis of fuel pump measurement bias, which provides robust estimation of engine deterioration and expected fuel flow to the engine.
The parameterized complexity of regular subgraph problems and generalizations
Authors: Luke Mathieson, Stefan Szeider
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

We study variants and generalizations of the problem of finding an r-regular subgraph (where r &le; 3) in a given graph by deleting at most k vertices. Moser and Thilikos (2006) have shown that the problem is fixed-parameter tractable (FPT) if parameterized by (k, r). They asked whether the problem remains fixed-parameter tractable if parameterized by k alone. We answer this question negatively: we show that if parameterized by k alone the problem is W[1]-hard and therefore very unlikely fixed-parameter tractable. We also give W[1]-hardness results for variants of the problem where the parameter is the number of vertex and edge deletions allowed, and for a new generalized form of the problem where the obtained subgraph is not necessarily regular but its vertices have certain prescribed degrees. Following this we demonstrate fixed-parameter tractability for the considered problems if the parameter includes the regularity r or an upper bound on the prescribed degrees in the generalized form of the problem. These FPT results are obtained via kernelization, so also provide a practical approach to the problems presented.
Positional mapping Myanmar text input scheme for mobile devices
Authors: Ye Kyaw Thu, Yoshiyori Urano
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Current Myanmar PC keyboards or key mappings are very difficult to learn for novice users, and there is no efficient key mapping for mobile device keypads. In this paper, we introduce a new idea of key mapping (Positional Mapping) for phonetic scripts such as Myanmar language. Positional Mapping is a key mapping idea, based on Myanmar language characters writing positions, for small computing devices such as mobile phones, PDAs and electronic dictionaries etc. Our approach has made key mapping for Myanmar language very simple and easier to memorize. The results of first evaluation show that first time users have no problem with this key mapping and they can type Myanmar text with appropriate typing speed. Positional Mapping can be extended to other phonetic scripts such as Khmer, Thai, Indic and Lao etc.
Dirichlet component regression and its applications to psychiatric data
Authors: Ralitza Gueorguieva, Robert Rosenheck, Daniel Zelterman
Venue: Computational Statistics Data Analysis (2008)

We describe a Dirichlet multivariable regression method useful for modeling data representing components as a percentage of a total. This model is motivated by the unmet need in psychiatry and other areas to simultaneously assess the effects of covariates on the relative contributions of different components of a measure. The model is illustrated using the Positive and Negative Syndrome Scale (PANSS) for assessment of schizophrenia symptoms which, like many other metrics in psychiatry, is composed of a sum of scores on several components, each in turn, made up of sums of evaluations on several questions. We simultaneously examine the effects of baseline socio-demographic and co-morbid correlates on all of the components of the total PANSS score of patients from a schizophrenia clinical trial and identify variables associated with increasing or decreasing relative contributions of each component. Several definitions of residuals are provided. Diagnostics include measures of overdispersion, Cook's distance, and a local jackknife influence metric.
Precise asymptotics in the law of logarithm under dependence assumptions
Authors: Xiao-Rong Yang, Wei-Dong Liu, Li-Xin Zhang
Venue: Computers Mathematics with Applications (2008)

In a recent paper by Spataru [Precise asymptotics for a series of T.L. Lai, Proc. Amer. Math. Soc. 132 (11) (2004) 3387-3395] a precise asymptotics in the law of the logarithm for sequence of i.i.d. random variables has been established. In this paper we show that there is an analogous result for strictly stationary @f-mixing sequence. To prove this result, we have to use a different method. One of our main tools is the Gaussian approximation technique.
Provenance and scientific workflows: challenges and opportunities
Authors: Susan B. Davidson, Juliana Freire
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Provenance in the context of workflows, both for the data they derive and for their specification, is an essential component to allow for result reproducibility, sharing, and knowledge re-use in the scientific community. Several workshops have been held on the topic, and it has been the focus of many research projects and prototype systems. This tutorial provides an overview of research issues in provenance for scientific workflows, with a focus on recent literature and technology in this area. It is aimed at a general database research audience and at people who work with scientific data and workflows. We will (1) provide a general overview of scientific workflows, (2) describe research on provenance for scientific workflows and show in detail how provenance is supported in existing systems; (3) discuss emerging applications that are enabled by provenance; and (4) outline open problems and new directions for database-related research.
Fitting circles to data with correlated noise
Authors: N. Chernov, P. N. Sapirstein
Venue: Computational Statistics Data Analysis (2008)

We study the problem of fitting circles to scattered data. Unlike many other studies, we assume that the noise is (strongly) correlated; we adopt a particular model where correlations decay exponentially with the distance between data points. Our main results are formulas for the maximum likelihood estimates and their covariance matrix. Our study is motivated by (and applied to) arcs collected during archeological field work.
The Behavior Analysis of Flash-Memory Storage Systems
Authors: Po-Chun Huang, Yuan-Hao Chang, Tei-Wei Kuo, Jen-Wei Hsieh, Miller Lin
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Performance and reliability are two major design concerns of flash-memory storage systems, especially for low-cost products. Although various excellent flashmemory management schemes are proposed, there is little work done on how to evaluate the designs or implementations of flash-memory storage systems. Many of the existing evaluation workloads for flash-memory storage systems still rely on those based on hard disks. This work aims at the needs of behavior analysis of flash-memory storage systems and their evaluations. In particular, a set of evaluation metrics and their corresponding access patterns are proposed. The behaviors of flash memory are also analyzed in terms of performance and reliability issues.
Automatic weight selection for H∞ controller synthesis
Authors: D. C. Donhn, M. R. Katebi
Venue: International Journal of Systems Science (2007)

This article is concerned with the development of a procedure to calculate the parameters of weighting functions used in H∞ controller designs to achieve a desired system performance. The H∞ synthesis problem is formulated as a multi-criterion optimization problem. A Genetic Algorithm is then employed to search for suitable solutions. To cope with the imprecision and vagueness that arises in the description of objective functions and constraints of the process and actuators, concepts from the fuzzy logic are incorporated into the solution. A multi-objective fuzzy optimization is stated and a fuzzy convex decision-making is established. To demonstrate the advantages of the proposed method, the tuning of SISO and MIMO controllers are investigated. The method is applied to the tuning of controllers of a ship autopilot and of a dynamic ship positioning system. Results are presented, analyzed and compared to former works.
Checking type safety of foreign function calls
Authors: Michael Furr, Jeffrey S. Foster
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2008)

Foreign function interfaces (FFIs) allow components in different languages to communicate directly with each other. While FFIs are useful, they often require writing tricky low-level code and include little or no static safety checking, thus providing a rich source of hard-to-find programming errors. In this article, we study the problem of enforcing type safety across the OCaml-to-C FFI and the Java Native Interface (JNI). We present O-Saffire and J-Saffire, a pair of multilingual type inference systems that ensure C code that uses these FFIs accesses high-level data safely. Our inference systems use representational types to model C's low-level view of OCaml and Java values, and singleton types to track integers, strings, memory offsets, and type tags through C. J-Saffire, our Java system, uses a polymorphic flow-insensitive, unification-based analysis. Polymorphism is important because it allows us to precisely model user-defined wrapper functions and the more than 200 JNI functions. O-Saffire, our OCaml system, uses a monomorphic flow-sensitive analysis because, while polymorphism is much less important for the OCaml FFI flow-sensitivity is critical to track conditional branches, which are used when pattern matching OCaml data in C. O-Saffire also tracks garbage collection information to ensure that local C pointers to the OCaml heap are registered properly, which is not necessary for the JNI. We have applied O-Saffire and J-Saffire to a set of benchmarks and found many bugs and questionable coding practices. These results suggest that static checking of FFIs can be a valuable tool in writing correct multilingual software.
Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with odd characteristic
Authors: Yingpu Deng, Mulan Liu
Venue: European Journal of Combinatorics (2008)

This paper is devoted to computing the number of isomorphism classes of pointed hyperelliptic curves over finite fields. We deal with the genus-4 case and the finite fields are of odd characteristic. The number of isomorphism classes is computed. This number can be represented as a polynomial in q of degree 7, where q is the order of the finite field. The results have applications in the classification problems and in the hyperelliptic curve cryptosystems.
Aligning sequences by minimum description length
Authors: John S. Conery
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2007)

This paper presents a new information theoretic framework for aligning sequences in bioinformatics. A transmitter compresses a set of sequences by constructing a regular expression that describes the regions of similarity in the sequences. To retrieve the original set of sequences, a receiver generates all strings that match the expression. An alignment algorithm uses minimum description length to encode and explore alternative expressions; the expression with the shortest encoding provides the best overall alignment. When two substrings contain letters that are similar according to a substitution matrix, a code length function based on conditional probabilities defined by the matrix will encode the substrings with fewer bits. In one experiment, alignments produced with this new method were found to be comparable to alignments from CLUSTALW. A second experiment measured the accuracy of the new method on pairwise alignments of sequences from the BAliBASE alignment benchmark.
A Portable Intelligent ECG Monitor Based on Wireless Internet and Embedded System Technology
Authors: Jianwei Dong, Shi Zhang, Xiaonan Jia
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this article, we present a Portable Intelligent ECG Monitor (PIEM) which can be used in a Wireless Remote Monitoring System. For the hardware design, Advanced RISC Machines (ARM) as well as ECG Application Specific Integrated Circuit (ASIC), GSM/GPRS and NAND Flash technologies is adopted. As for the software implementation, a real-time kernel called μC/OS-II and some related application programs were developed, among which an efficient and robust on-line ECG interpretation algorithm is included. A prototype of this device is finally accomplished and has been put into use in the clinical environment for one month. The results of the experiment show that this PIEM is clinically approved, accurate in its measurement, highly mobile, easy-to-use, durable and light-weight. Once this prototype is developed into product, there's no doubt that more and more cardiac patients will benefit from it.
Study on the Si-Ge Nanowire MOSFETs with the Core-Shell Structure
Authors: Yue Fu, Jin He, Feng Liu, Jie Feng, Chenyue Ma, Lining Zhang
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper investigates the transport properties of the silicon-Germanium nanowire MOSFETs with core-shell structure by using a finite element numerical method for electronic structure, energy level, and channel current computation. Coupled Poisson’s equation to Schrödinger’s equation for electrostatics calculation and electron structure to current transport equation for channel current computation, the electronic structure, quantized energy levels, relevant wave functions and charge distribution are solved self-consistently for the core-shell structure MOSFETs. Furthermore, based on these findings, the transistor performances, including the capacitance characteristics and drain current, are also predicted.
Genetic filters for video noise reduction
Authors: Jarosław Szostakowsk
Venue: Machine Graphics Vision International Journal (2006)

This paper describes a genetic programming approach to video filtering, based on evolution programming for image sequence filter design. Each gene represents a filter weight. The intra-and interframe approaches are shown and discussed.