ppxscal/embedding_network huggingface dataset:
IA-FEMesh: An open-source, interactive, multiblock approach to anatomic finite element model development
Authors: Nicole M. Grosland, Kiran H. Shivanna, Vincent A. Magnotta, Nicole A. Kallemeyn, Nicole A. DeVries, Srinivas C. Tadepalli, Curtis Lisle
Venue: Computer Methods and Programs in Biomedicine (2009)

Finite element (FE) analysis is a valuable tool in musculoskeletal research. The demands associated with mesh development, however, often prove daunting. In an effort to facilitate anatomic FE model development we have developed an open-source software toolkit (IA-FEMesh). IA-FEMesh employs a multiblock meshing scheme aimed at hexahedral mesh generation. An emphasis has been placed on making the tools interactive, in an effort to create a user friendly environment. The goal is to provide an efficient and reliable method for model development, visualization, and mesh quality evaluation. While these tools have been developed, initially, in the context of skeletal structures they can be applied to countless applications.
B2B Integration Using SAP NetWeaver Pl
Authors: Sam Raju and Claus Wallacher
Venue:  (2008)

Implementing business-to-business scenarios using SAP NetWeaver Process Integration differs greatly from the implementation of other scenarios. This book provides a comprehensive overview of B2B processes and reveals the key elements required for a successful B2B implementation within your organization using the SAP NetWeaver PI technology platform. In the first part of the book you'll get a comprehensive introduction to the basic concepts of SAP NetWeaver PI and its B2B capabilities, like adapters, cross-industry and industry-specific standards, monitoring capabilities, Business Process Management and ccBPM capabilities. Then, you'll benefit from focused implementation guidance as the authors take you through the key phases of an implementation project including development, configuration, security considerations, testing, and more. Readers of this book will develop a clear understanding of the tools and techniques required for successful B2B integration and you'll learn new ways to optimize connectivity with your (global) trading partners by creating a reliable, secure, and low-effort data exchange. Highlights include: Introduction: B2B Integration with SAP NetWeaver Process Integration Process Integration Concepts: Adapter Concepts, Industry Standard Support, Central Monitoring, BPM Capabilities Process Integration Implementation: Development, Configuration, Security, Testing Tool and Techniques: Adapter Framework, System Landscape Directory, Integration Directory, Enterprise Services Repository Real-Life Test Scenarios: CIDX, PIDX, RosettaNet, and ANSI X12 Standards
Computing self-intersection curves of rational ruled surfaces
Authors: Xiaohong Jia, Falai Chen, Jiansong Deng
Venue: Computer Aided Geometric Design (2009)

An algorithm is presented to compute the self-intersection curves of a rational ruled surface based on the theory of @m-bases. The algorithm starts by constructing the principal subresultants for a @m-basis of the rational ruled surface. The principal subresultant coefficients provide information about not only the parametric loci of the self-intersection curves, but also the orders of the self-intersection curves. Based on this observation, an efficient algorithm is provided to compute the parametric loci of the self-intersection curves as well as their corresponding orders. The isolated singular points of the rational ruled surface are also computed.
Lossless data compression using neural networks
Authors: Florin Alexa, Vasile Gui, Catalin Caleanu, Corina Botoca
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This paper deals with the predictive compression of images using neural networks (NN). The idea is to use of the backpropagation algorithm in order to compute the predicted pixels. The results validation is performed by comparison with linear prediction compression used in JPEG algorithm.
A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities
Authors: Noha A. Yousri, Mohamed S. Kamel, Mohamed A. Ismail
Venue: Pattern Recognition (2009)

It is important to find the natural clusters in high dimensional data where visualization becomes difficult. A natural cluster is a cluster of any shape and density, and it should not be restricted to a globular shape as a wide number of algorithms assume, or to a specific user-defined density as some density-based algorithms require. In this work, it is proposed to solve the problem by maximizing the relatedness of distances between patterns in the same cluster. It is then possible to distinguish clusters based on their distance-based densities. A novel dynamic model is proposed based on new distance-relatedness measures and clustering criteria. The proposed algorithm ''Mitosis'' is able to discover clusters of arbitrary shapes and arbitrary densities in high dimensional data. It has a good computational complexity compared to related algorithms. It performs very well on high dimensional data, discovering clusters that cannot be found by known algorithms. It also identifies outliers in the data as a by-product of the cluster formation process. A validity measure that depends on the main clustering criterion is also proposed to tune the algorithm's parameters. The theoretical bases of the algorithm and its steps are presented. Its performance is illustrated by comparing it with related algorithms on several data sets.
Real-Time Geo-awareness - Sensor Data Integration for Environmental Monitoring in the City
Authors: Bernd Resch, Manfred Mittlboeck, Fabien Girardin, Rex Britter, Carlo Ratti
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Environmental monitoring faces a variety of complex technical and socio-political challenges, particularly in the urban context. Data sources may be available, but mostly not combinable because of lacking interoperability and deficient coordination due to monolithic and closed data infrastructures. In this work we present the real-time geo-awareness approach that seeks to tackle these challenges with an open sensing infrastructure for monitoring applications. Our system makes extensive use of open (geospatial) standards throughout the entire process chain – from sensor data integration to analysis, and finally visualisation. Then, we show how the methodology can influence the city and its inhabitants by 'making the abstract real', in other words how pervasive environmental monitoring systems change urban social interactions, and which issues are related to establishing such systems.
Certificate-based sequential aggregate signature
Authors: Joseph K. Liu, Joonsang Baek, Jianying Zhou
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

In this paper, we propose a new notion called Certificate-Based Sequential Aggregate Signature. Certificate-based cryptography proposed by Gentry [8] combines the merit of traditional public key cryptography and identity based cryptography, without use of the costly certificate chain verification process and the removal of key escrow security concern. Under this paradigm, we propose a first sequential aggregate signature. An aggregate signature scheme produces a short string that convinces any verifier that there are $n$ messages signed by $n$ parties, all of which may be distinct. The length of the string is a constant which is independent of $n$. Its compactness makes it particularly suitable to be employed in those environments where communication bandwidth is very limited, such as wireless network scenarios (e.g. MANETS, cellular networks, sensor networks, satellite communication). We provide a concrete construction of this new notion and prove its security in the random oracle model.
Uniformly minimum variance nonnegative quadratic unbiased estimation in a generalized growth curve model
Authors: Xiaoyong Wu, Guohua Zou, Yingfu Li
Venue: Journal of Multivariate Analysis (2009)

Consider the generalized growth curve model Y=@?"i"="1^mX"iB"iZ"i^'+UE subject to R(X"m)@?...@?R(X"1), where B"i are the matrices of unknown regression coefficients, and E=(@e"1,...,@e"s)^' and @e"j(j=1,...,s) are independent and identically distributed with the same first four moments as a random vector normally distributed with mean zero and covariance matrix @S. We derive the necessary and sufficient conditions under which the uniformly minimum variance nonnegative quadratic unbiased estimator (UMVNNQUE) of the parametric function tr(C@S) with C>=0 exists. The necessary and sufficient conditions for a nonnegative quadratic unbiased estimator y^'Ay with y=V ec(Y^') of tr(C@S) to be the UMVNNQUE are obtained as well.
Computing Frequency Dominators and Related Problems
Authors: Loukas Georgiadis
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We consider the problem of finding frequency dominators in a directed graph with a single source vertex and a single terminal vertex. A vertex x is a frequency dominator of a vertex y if and only if in each source to terminal path, the number of occurrences of x is at least equal to the number of occurrences of y. This problem was introduced in a paper by Lee et al. [11] in the context of dynamic program optimization, where an efficient algorithm to compute the frequency dominance relation in reducible graphs was given. In this paper we show that frequency dominators can be efficiently computed in general directed graphs. Specifically, we present an algorithm that computes a sparse (O(n)-space), implicit representation of the frequency dominance relation in O(m + n) time, where n is the number of vertices and m is the number of arcs of the input graph. Given this representation we can report all the frequency dominators of a vertex in time proportional to the output size, and answer queries of whether a vertex x is a frequency dominator of a vertex y in constant time. Therefore, we get the same asymptotic complexity as for the regular dominators problem. We also show that, given our representation of frequency dominance, we can partition the vertex set into regions in O(n) time, such that all vertices in the same region have equal number of appearances in any source to terminal path. The computation of regions has applications in program optimization and parallelization. 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
Data abstraction for Pascal programmers
Authors: Viswanathan Santhanam, John R. Potochnik
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Lack of data abstraction facilities in Pascal is a serious shortcoming for a language whose principal aims include "teaching programming as a systematic discipline." In this paper, a scheme is presented to implement data abstraction in Pascal using a limited form of the class structure defined in Concurrent Pascal. The class structures are translated to equivalent (sequential) Pascal constructs with the help of a preprocessor whose design is also described.
Cross-layer analysis and design for multimedia services in IEEE 802.11 WLANs
Authors: Chiapin Wang, Tsungnan Lin, Pochiang Lin
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

IEEE 802.11 Wireless Local Area Networks (WLAN) supply broadband data accesses and evolve a growing demand of multimedia services for mobile users. To provide quality of service (QoS) for multimedia applications in WLANs, it is important to analyze the performance of 802.11 Medium Access Control (MAC) protocols under varying heterogeneous channel conditions. In this paper, we focus on 802.11 WLANs which adopt the MAC protocol of Distributed Coordination Function (DCF), and provide performance analyses to show the interlayer effect of physical-layer (PHY) channel diversities on DCF protocol as well as the consequent impact on multimedia QoS at application (APP) layer. We then discuss some feasible crosslayer designs for overall optimizing QoS performance in 802.11 WLANs. We also take example of the QoS unfairness problem due to the interlayer impact of PHY channel diversities and illustrate a solution of our cross-layer approach.
Probabilistic representation and approximate inference of type-2 fuzzy events in Bayesian networks with interval probability parameters
Authors: Wei-Yi Liu, Kun Yue, Jing-Yu Su, Yu Yao
Venue: Expert Systems with Applications: An International Journal (2009)

It is necessary and challenging to represent the probabilities of fuzzy events and make inferences between them based on a Bayesian network. Motivated by such real applications, in this paper, we first define the interval probabilities of type-2 fuzzy events. Then, we define weak interval conditional probabilities and the corresponding probabilistic description. The expanded multiplication rule supporting interval probability reasoning. Accordingly, we propose the approach for learning the interval conditional probability parameters of a Bayesian network and the algorithm for its approximate inference. Experimental results show the feasibility of our method.
Bipartite Ramsey numbers involving large Kn,n
Authors: Qizhong Lin, Yusheng Li
Venue: European Journal of Combinatorics (2009)

Let br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown that the order of magnitude of br(Kt,n,Kn,n) is nt+1/(logn)t for t≥1 fixed and n→∞. Moreover, if H is an isolate-free bipartite graph of order h having bipartition (A,B) that satisfies Δ(B)≤t, then br(H,Kn,n) can be bounded from above by (hn/logn)t(logn)&alpha;( t) for large n, where &alpha;(1)=&alpha;(2)=1 and &alpha;(t)=0 for t≥3.
An Image Coding Algorithm Based on Nonredundant Contourlet Transform and Visual Characteristics
Authors: Guosheng Gu, Yinwei Zhan
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

This paper presents an image coding technique based on contourlet transform. The redundancy of the contourlet transform is eliminated by switching the LP decomposition step to separable wavelet transform. The transform is then optimized through a wavelet coefficient weighting process in order to enhance the visual quality in the image domain, and with that the directional filter bank(DFB) are employed to high frequency wavelet subbands. At last, all the resulted subbands are efficiently coded with EBCOT. At the same bit rates, a gain of up to 0.3~0.6dB over JPEG2000 has been observed for standard images with directional features.
Prediction of performance and exhaust emissions of a diesel engine fueled with biodiesel produced from waste frying palm oil
Authors: Mustafa Canakci, Ahmet Necati Ozsezen, Erol Arcaklioglu, Ahmet Erdil
Venue: Expert Systems with Applications: An International Journal (2009)

Biodiesel is receiving increasing attention each passing day because of its fuel properties and compatibility with the petroleum-based diesel fuel (PBDF). Therefore, in this study, the prediction of the engine performance and exhaust emissions is carried out for five different neural networks to define how the inputs affect the outputs using the biodiesel blends produced from waste frying palm oil. PBDF, B100, and biodiesel blends with PBDF, which are 50% (B50), 20% (B20) and 5% (B5), were used to measure the engine performance and exhaust emissions for different engine speeds at full load conditions. Using the artificial neural network (ANN) model, the performance and exhaust emissions of a diesel engine have been predicted for biodiesel blends. According to the results, the fifth network is sufficient for all the outputs. In the fifth network, fuel properties, engine speed, and environmental conditions are taken as the input parameters, while the values of flow rates, maximum injection pressure, emissions, engine load, maximum cylinder gas pressure, and thermal efficiency are used as the output parameters. For all the networks, the learning algorithm called back-propagation was applied for a single hidden layer. Scaled conjugate gradient (SCG) and Levenberg-Marquardt (LM) have been used for the variants of the algorithm, and the formulations for outputs obtained from the weights are given in this study. The fifth network has produced R^2 values of 0.99, and the mean % errors are smaller than five except for some emissions. Higher mean errors are obtained for the emissions such as CO, NO"x and UHC. The complexity of the burning process and the measurement errors in the experimental study can cause higher mean errors.
Fuzzy group decision-making for multi-format and multi-granularity linguistic judgments in quality function deployment
Authors: Zaifang Zhang, Xuening Chu
Venue: Expert Systems with Applications: An International Journal (2009)

As a customer-driven tool, quality function deployment (QFD) is widely used in product planning or improvement to achieve higher product performance and customer satisfaction. QFD uses a matrix called the house of quality (HoQ) to translate customer requirements (CRs) into engineering characteristics (ECs). Constructing the HoQ, which includes determining the importance weights of CRs, the correlation matrix among ECs and the relationship matrix between CRs and ECs, is an important issue in the application of QFD. However, decision-makers (DMs) participating the construction of HoQ tend to give their individual judgments in multi-format or multi-granularity depending on their different knowledge, experience, culture and circumstance. Furthermore, these judgments are more difficult to assess with the precise quantitative forms due to the vagueness and uncertainty existed in the early stage of new product development. In this paper, a group decision-making approach incorporating with two optimization models (i.e. logarithmic least squares model and weighted least squares model) is proposed to aggregate these multi-format and multi-granularity linguistic judgments. Fuzzy set theory is utilized to address the uncertainty in the decision-making process. The proposed method is illustrated with a real-world case of horizontal directional drilling machine. The application indicates that the group decision-making method may be a promising tool for constructing the HoQ.
A New Progressive Image Quality Control Method for ROI Coding in JPEG2000 Standard
Authors: Yoshihiro Kitaura, Mitsuji Muneyasu, Katsuaki Nakanishi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

JPEG2000 still image coding standard has a feature called Region of Interest (ROI) coding. This feature can encode a restricted region in an image prior to than its background (BG) region. In low bit rate compression, the code of the ROI region occupies the most of the bit stream in the whole image and it causes the serious deterioration of the image quality in the BG region. This paper proposes a new image quality control method between the ROI region and the BG one by the one time encoding process and it can achieve more detailed image quality control. The use of ROI masks in the encoder makes it possible. The standard decoder of JPEG2000 part1 can decode the encoded data in the proposed method.
The design of fuzzy expert system for emission parameters
Authors: Ismail Saritas, Murat Ciniviz
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The most important problem, which the world is face to face, is the environment pollution. The greatest reason of the pollution is the use of energy, especially the fossil fuel. Therefore the pollution of air, the soot emission which forms danger for human life and natural life and Nitrogen oxide emission that causes acid rain. Consequently decreasing emission is one of the important problems of our daily life. In this study; the effects of atomizing pressure and the alteration of CO2 portion in the air, the emission parameters, of a turbo diesel engine on nitrogen oxide and soot emission. It was researched and was completed with a fuzzy expert system method by using Mamdani type mechanism. Experiments were done for the same motor, were evaluated by comparing experimental outputs and the results of fuzzy expert system. The main object of the study is laying the groundwork for the real studies. In the correlation, which was applied between the outputs of the experiments and the outputs of the designed fuzzy expert system, the ratio of 99.87% was taken. It was also observed that the designed fuzzy expert system represented the outputs of experiments in the ratio of 98% according to the repeated two sided variance analyze.
On temporal path conditions in dependence graphs
Authors: Andreas Lochbihler, Gregor Snelting
Venue: Automated Software Engineering (2009)

Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express more detailed circumstances of a particular flow; they provide precise necessary conditions for information flow along a path or chop in a dependence graph. Ordinary boolean path conditions, however, cannot express temporal properties, e.g. that for a specific flow it is necessary that some condition holds, and later another specific condition holds.In this contribution, we introduce temporal path conditions, which extend ordinary path conditions by temporal operators in order to express temporal dependencies between conditions for a flow. We present motivating examples, generation and simplification rules, application of model checking to generate witnesses for a specific flow, and a case study. We prove the following soundness property: if a temporal path condition for a path is satisfiable, then the ordinary boolean path condition for the path is satisfiable. The converse does not hold, indicating that temporal path conditions are more precise.
Performance Analysis of an Efficient TCP Variant under Lossy Environments
Authors: Anusuya K. V., Krishna Chaitanya B.
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In wireless networks, most of the TCP variants interpret the occurrence of losses is only due to congestion. This is because of their inability to distinguish between wireless link losses and congestion losses. Subsequently, the flow rate of the TCP segments is decreased, which reduces the throughput and good put. Hence, to improve the performance of TCP in wireless networks, an efficient scheme called SNACK-TCP-ECN has been proposed in our previous work and it is based on protocol TCP-NJ+. The modified acknowledgement procedure of TCP-NJ+ is combined with an Explicit Congestion Notification (ECN) and Selective Negative acknowledgement (SNACK). In this paper, we analyze the performance of the algorithm under various loss models. The simulation results show that the SNACK-TCP-ECN algorithm outperforms the other TCP variants at higher loss rates.