ppxscal/embedding_network huggingface dataset:
Estimation of flow rates in naturally ventilated buildings using simplified method
Authors: Zahari Ibrahim, Kamaruzzaman Sopian, Azami Zaharim, M. A. Ghoul, Baharudin Ali
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

A simplified design method has been derived for use in the estimation of the flow rates in naturally ventilated buildings. The method is based on a one-dimensional "loop analysis" in which the buoyancy forces are balanced by the pressure drops to due friction. Multiple zone, multiple floor buildings are catered for with each zone characterised by its internal gains and its discharge coefficients. Wind effects at the entrance and exits are also taken into account. The procedure yields the zone mass flow rates and temperatures directly by the solution of a simple cubic equation for each loop. Interaction between loops requires a few iterations. The procedure is straight forward and simple enough to be put on a Spreadsheet. This methodology allows the architect to explore various building configurations at little expense and hence to focus on those designs which warrant further detailed analysis using a full building simulation package. In this paper, the fundamental theory behind the loop analysis is described together with the first results at its validation using an emulation of the simple single stack PV cladding arrangement.
Efficiently enumerating results of keyword search over data graphs
Authors: Benny Kimelfeld, Yehoshua Sagiv
Venue: Information Systems (2008)

Various approaches for keyword search in different settings (e.g., relational databases and XML) actually deal with the problem of enumerating K-fragments. For a given set of keywords K, a K-fragment is a subtree T of the given data graph, such that T contains all the keywords of K and no proper subtree of T has this property. There are three types of K-fragments: directed, undirected and strong. This paper describes efficient algorithms for enumerating K-fragments. Specifically, for all three types of K-fragments, algorithms are given for enumerating all K-fragments with polynomial delay and polynomial space. It is shown how these algorithms can be enhanced to enumerate K-fragments in a heuristic order. For directed K-fragments and acyclic data graphs, an algorithm is given for enumerating with polynomial delay in the order of increasing weight (i.e., the ranked order), assuming that K is of a fixed size.
Domino 7 Lotus Notes Application Development
Authors: Tim Speed, Stephen Cooke, Dick McCarrick, Raphael Savir
Venue:  (2007)

Raphael Savir has been a developer and consultant for Lotus Notes/Domino applications for 15 years. He has worked in numerous positions, focusing on performance and development topics. Raphael enjoys speaking on these topics, and has been fortunate in being able to do so frequently over the years.Now with LS Development Corporation http://www.lsdevelopment.com ), Raphael works directly with clients to make efficient and friendly Notes or web applications running on the Domino platform. Raphael has written several development articles over the years, but this is his first attempt to string together more than a few pages. I would like to thank my beautiful and encouraging wife, Lizzie, for helping me get through a brutal year of work and writing.
Performance evaluation of node density-based adaptive routing scheme for disruption tolerant networks
Authors: Mooi-Choo Chuah, Peng Yang
Venue: International Journal of Ad Hoc and Ubiquitous Computing (2008)

Traditional ad hoc routing protocols do not work in intermittently connected networks since end-to-end paths may not exist. In our earlier paper, we have evaluated a combined multihop, and message ferrying approach where special nodes are deployed as message ferries. Thus, in this paper, we design a node-density based adaptive routing scheme where regular nodes volunteer to be message ferries when there are very few nodes around them to ensure the feasibility of continued communications. Our simulation results indicate that our scheme can achieve the best delivery ratio in very sparse ad hoc networks that are prone to frequent disruptions.
The weight and hopcount of the shortest path in the complete graph with exponential weights
Authors: Gerard Hooghiemstra, Piet Van mieghem
Venue: Combinatorics, Probability and Computing (2008)

Both the hopcount HN (the number of links) and the weight WN (the sum of the weights on links) of the shortest path between two arbitrary nodes in the complete graph KN with i.i.d. exponential link weights is computed. We consider the joint distribution of the pair (HN, WN) and derive, after proper scaling, the joint limiting distribution. One of the results is that HN and WN, properly scaled, are asymptotically independent.
Stochastic analysis of operations decoupling in flexible manufacturing systems
Authors: G. Pérez-Lechuga, A. A. Karelyn, M. Muñóz-Orán, L. M. Pla-Aragones
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

In serial production systems, storage may be provided between processes to avoid interference due to lack of synchronization. In order to manufacture a product, a job is divided into individual tasks, typically manufacturing or assembly processes. These tasks are interdependent and should be coordinated. To reduce the interdependence between downstream and upstream operations and to maintain the output of the production line, it is common to introduce buffers between the operations. These buffers decouple operations and eliminate the interdependency unless the buffer is emptied when a shutdown occurs upstream. In this paper we study the buffered flows of matter in a flexible manufacturing system considering only two machines. We develop procedures to compute some steady-state performance measures, including the interference loss and some limiting distributions. We use the Markov processes theory to obtain our results.
Making workflows context-aware: a way to support knowledge-intensive tasks
Authors: Mitra Heravizadeh, David Edmond
Venue: Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79 (2008)

In business processes, knowledge-intensive tasks are ones in which the people performing such tasks are involved in a fair degree of uncertainty. These people are required to apply and bring together their experience, training, expertise and judgement. In particular, they are concerned about issues or problems that might arise and how these are best dealt with or avoided. Current workflow technology does not support such tasks, as it deals only with predictable and easily automated decision making. In particular, it fails to deliver the right information to the user at the right time based on the context of the process instance, thus not taking the opportunity to forewarn users of potential problems. Context-aware workflows are a way to overcome shortcomings of workflow management systems. This paper proposes an approach for the dynamic integration of knowledge and workflow processes by offering proper support for the realtime handling of the both the current context of a process and its execution path.
Error estimates for the finite point method
Authors: Rongjun Cheng, Yumin Cheng
Venue: Applied Numerical Mathematics (2008)

In this paper, error estimates for the finite point method are presented in Sobolev spaces in multiple dimensions when nodes and shape functions satisfy certain conditions. From the error analysis of the finite point method, the error bound of the numerical solution is directly related to the radii of the weight functions and the condition number of the coefficient matrix.
Disaster Communication Network by Combination of Different Wireless LANs
Authors: Kazuo Takahata, Shinya Takada, Yoshitaka Shibata
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

So far we have developed a disaster information network which is very effective and robust using wireless network. In this paper, we introduce a mobile network for disaster communication network by combination of different wireless LANs and mobile network. Currently available wireless LANs such as IEEE802.11b,g,j,n, IEEE802.16 (WiMAX), cellular network are combined with a mobile router and loaded on a car to build a mobile network node. Using multiple mobile network nodes, a large disaster communication network is organized. A communication link between nodes has multiple channels and the best channel among them is selected based on the distance, power and transmission channel frequency. By multi-hopping those nodes, user can communicate with other user and send/receive disaster information even though some of information infrastructure are damaged. In this paper, we designed and implemented a wireless mobile network with currently available different wireless network and constructed a prototyped system to evaluate the functional and performance.
Ontology-Based User Intention Recognition for Proactive Planning of Intelligent Robot Behavior
Authors: Hochul Jeon, Taehwan Kim, Joongmin Choi
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

To recognize user intention proactively and do a suitable action or service are one of important issues in intelligent robot. Even when a user acts the same behavior, its intention may be different according to the user’s context. It means that user intention recognition involves the uncertainties, and by minimizing the uncertainties can improve the accuracy of the user intention recognition. This paper suggests a novel ontology-based approach for user intention recognition. We propose a method of minimizing the uncertainties that are the main obstacles against the precise recognition of user intention. This approach creates an ontology for user intention, makes a hierarchy and relationship among user intentions, and precisely recognizes user intention by using the gathered sensor data such as temperature, humidity, vision, and auditory. We developed a simulator that evaluates the performance of robot proactive planning mechanism.
Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs
Authors: S. Khuller
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

An efficient parallel algorithm for testing whether a graph G is K-vertex connected, for any fixed k, is presented. The algorithm runs in O(log n) time and uses nC(n,m) processors on a concurrent-read, concurrent-write parallel random-access machine (CRCW PRAM), where n and m are the number of vertices and edges of G and C(n,m) is the number of processors required to compute the connected components of G in logarithmic time. An optimal speedup algorithm for computing connected components would induce an optimal speedup algorithm for testing k-vertex connectivity, for any k>4. To develop the algorithm, an efficient parallel algorithm is designed for the following disjoint s-t paths problem: Given a graph G and two specified vertices s and t, find k-vertex disjoint paths between s and t, if they exist. If no such paths exist, find a set of at most k-1 vertices whose removal disconnects s and t. The parallel algorithm for this problem runs in O(log n) time using C(n,m) processors. It is shown how to modify the algorithm to find k-edge disjoint paths, if they exist. This yields an efficient parallel algorithm for testing whether a graph G is k-edge connected, for any fixed k. The algorithm runs in O(log n) time and uses nC (n,n) processors on a CRCW PRAM. Again, an optimal speedup algorithm for computing connected components would induce an optimal speedup algorithm for testing k-edge connectivity.
EDA: AN EVOLUTIONARY DECODING ALGORITHM FOR STATISTICAL MACHINE TRANSLATION
Authors: Eridan Otto, María Cristina Riff
Venue: Applied Artificial Intelligence (2007)

In a statistical machine translation system (SMTS), decoding is the process of finding the most likely translation based on a statistical model, according to previously learned parameters. The success of an SMTS is strongly dependent on the quality of its decoder. Most of the SMTS's published in current literature use approaches based on traditional optimization methods and heuristics. On the other hand, over the last few years there has been a rapid increase in the use of metaheuristics. These kinds of techniques have shown to be able to solve difficult search problems in an efficient way for a wide number of applications. This paper proposes a new approach based on evolutionary hybrid algorithms to translate sentences in a specific technical context. The algorithm has been enhanced by adaptive parameter control. The tests are carried out in the context of Spanish and then translated to English. The experimental results validate the superior performance of our method in contrast to a statistical greedy decoder. We also compare our new approach to the existing public domain general translators.
Letters: Facial expression recognition based on two-dimensional discriminant locality preserving projections
Authors: Ruicong Zhi, Qiuqi Ruan
Venue: Neurocomputing (2008)

In this paper, a novel method called two-dimensional discriminant locality preserving projections (2D-DLPP) is proposed. By introducing between-class scatter constraint and label information into two-dimensional locality preserving projections (2D-LPP) algorithm, 2D-DLPP successfully finds the subspace which can best discriminate different pattern classes. So the subspace obtained by 2D-DLPP has more discriminant power than 2D-LPP, and is more suitable for recognition tasks. The proposed method was applied to facial expression recognition tasks on JAFFE and Cohn-Kanade database and compared with other three widely used two-dimensional methods: 2D-PCA, 2D-LDA and 2D-LPP. The high recognition rates show the effectiveness of the proposed algorithm.
LGES: A Large Graph Embedding System
Authors: Weihua Zhou, Jingwei Huang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Many convenient graph drawing tools have been developed to visualize the relational information among the large massive data sets. This paper presents a new system for drawing large undirected graphs in the two-dimensional and three-dimensional space, called LGES. It employs a fast novel algorithm to beautify the layouts, which adopts the multi-level method as the framework of the algorithm, and uses the improved force-directed algorithm to refine the single-level layouts. Experiments prove its high performance and nice results. It takes around 5 seconds to draw 10,000 vertex graphs in the twodimensional space and around 40 seconds in the threedimensional space. Moreover, the independent components provided by the LGES system are attractive for its further development and application.
Heterogeneous Medical Data Share and Integration on Grid
Authors: Ran Zheng, Hai Jin, Qin Zhang, Yingshu Liu, Pan Chu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

It is very significant for the medical and health enterprises to develop an efficient medical information grid to achieve sufficient medical data share and integration. In order to access heterogeneous data resources transparently, front agent is built on heterogeneous databases or medical systems, the same as the unified data models and mapping rules with grid services to communicate with upper grid middleware, so that users can query or access medical data conveniently. Two medical application instances, medical information integration and content-based image diagnosis or retrieval of emphysema disease, are introduced and realized with these technologies.
Mobile Data Overlay (MDO): A Data Placement Paradigm for Mobile Applications
Authors: Yun Huang, Nalini Venkatasubramanian
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

This paper addresses the issue of proxy-based data placement for mobile applications. The key idea is to use aggregated information about mobile users and their data request patterns to determine when, how frequently and how much data to be replicated on proxies. Specifically, we introduce a novel representation, Mobile Data Overlay (MDO) that captures aggregated mobile data access patterns. The underlying representation of the MDO utilizes an interval tree-based data structure in supporting efficient spatio-temporal operations on mobile data access information. We develop intelligent MDO reconfiguration (ReC-MDO) techniques that help determine proper granularity of data replication operation (i.e. appropriate segmentation of each data object) by extracting spatio-temporal locality of mobile data access patterns. The ReC-MDO approach effectively balances tradeoffs between replication cost and data access cost in making mobile data placement decisions on proxies. Through extensive experimentation, we demonstrate the superiority of our techniques over several popular data placement strategies.
Wavelet transform feature extraction from human PPG, ECG, and EEG signal responses to ELF PEMF exposures: A pilot study
Authors: Dean Cvetkovic, Elif Derya Übeyli, Irena Cosic
Venue: Digital Signal Processing (2008)

This paper presents the experimental pilot study to investigate the effects of pulsed electromagnetic field (PEMF) at extremely low frequency (ELF) in response to photoplethysmographic (PPG), electrocardiographic (ECG), electroencephalographic (EEG) activity. The assessment of wavelet transform (WT) as a feature extraction method was used in representing the electrophysiological signals. Considering that classification is often more accurate when the pattern is simplified through representation by important features, the feature extraction and selection play an important role in classifying systems such as neural networks. The PPG, ECG, EEG signals were decomposed into time-frequency representations using discrete wavelet transform (DWT) and the statistical features were calculated to depict their distribution. Our pilot study investigation for any possible electrophysiological activity alterations due to ELF PEMF exposure, was evaluated by the efficiency of DWT as a feature extraction method in representing the signals. As a result, this feature extraction has been justified as a feasible method.
Comparing robustness of pairwise and multiclass neural-network systems for face recognition
Authors: J. Uglov, L. Jakaite, V. Schetinin, C. Maple
Venue: EURASIP Journal on Advances in Signal Processing (2008)

Noise, corruptions, and variations in face images can seriously hurt the performance of face-recognition systems. To make these systems robust to noise and corruptions in image data, multiclass neural networks capable of learning from noisy data have been suggested. However on large face datasets such systems cannot provide the robustness at a high level. In this paper, we explore a pairwise neural-network system as an alternative approach to improve the robustness of face recognition. In our experiments, the pairwise recognition system is shown to outperform the multiclass-recognition system in terms of the predictive accuracy on the test face images.
A generalization of the Kantorovich type assumptions for Halley's method
Authors: J. A. Ezquerro, M. A. Hernández
Venue: International Journal of Computer Mathematics (2007)

For the Halley method, we generalize the usual Kantorovich type assumptions, from which an iterative process of R-order three is convergent, so that the corresponding convergence analysis can be applied to a larger number of equations. We present an example consisting of a nonlinear integral equation where the method is applied.
Multiple-Resource Request Scheduling for Differentiated QoS at Website Gateway
Authors: Ying-Dar Lin, Ching-Ming Tien, Shih-Chiang Tsao, Ruo-Hua Feng, Yuan-Cheng Lai
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Differentiated quality of service is a way for a website operator to provide different service levels to its clients. Traditional HTTP request scheduling schemes can achieve this, but they schedule requests to manage only one server resource, such as CPU or disk I/O. Actually, processing a request on the server will consume multiple resources. This paper presents a multiple-resource request scheduling algorithm, called mQoS, for differentiating the utilization of the server resource. The mQoS scheduler consists of several sub-schedulers and a main scheduler. Each sub-scheduler manages a server resource to differentiate its utilization among the classes. The main scheduler checks the availability of every server resource and triggers an appropriate sub-scheduler to balance the utilization of server resources. The implementation of the mQoS gateway is based on Squid and Linux. The evaluation compares the mQoS scheduling with no scheduling (nQoS) and single-resource request scheduling (sQoS). The mQoS scheduling reveals the accurate differentiation on every server resource. In addition, the total server throughput in the mQoS scheduling is improved by 21%, compared with the sQoS scheduling. The average user-perceived latency of the mQoS scheduling is also shorter than other scheduling.
An efficient algebraic multigrid preconditioner for a fast multipole boundary element method
Authors: G. Of
Venue: Computing (2008)

Fast boundary element methods still need good preconditioning techniques for an almost optimal complexity. An algebraic multigrid method is presented for the single layer potential using the fast multipole method. The coarsening is based on the cluster structure of the fast multipole method. The effort for the construction of the nearfield part of the coarse grid matrices and for an application of the multigrid preconditioner is of the same almost optimal order as the fast multipole method itself.
Tricoloring as a corrective measure (abstract only)
Authors: Robert W. McGrail, Mary Sharac
Venue: ACM Communications in Computer Algebra (2008)

This work presents a two-stage logic program to find tricolorings of a geometric braid [1]. This software is applied to data from the KnotData digital library of the Mathematica [5] symbolic computing system, revealing errors in that collection. The two algorithms presented below have been implemented in SWI-Prolog [4]. The first produces a crossing relation from a Knotdata braid word and the second searches for tricolorings given a crossing relation.
Parallel linear programming in fixed dimension almost surely in constant time
Authors: N. Alon
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

It is shown that, for any fixed dimension d, the linear programming problem with n inequality constraints can be solvent on a probabilistic CRCW PRAM (concurrent-read-concurrent-write parallel random-access machine) with O(n) processors almost surely in constant time. The algorithm always finds the correct solution. With nd/log/sup 2/d processors, the probability that the algorithm will not finish within O(d/sup 2/log/sup 2/d) time tends to zero exponentially with n.
The Silent Security Epidemic
Venue: Queue (2007)

Although the industry is generally getting better with dealing with routine types of security attacks, developers are today being challenged by more complex attacks that not only flow below the radar, but also specifically target certain types of applications. In this Queuecast edition, Ryan Sherstobitoff, CTO of Panda Software describes what new types of sophisticated attacks are being created and what proactive steps developers need to take to protect their applications. 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