ppxscal/embedding_network huggingface dataset:
Dynamic entity distribution in parallel discrete event simulation
Authors: Michael Slavik, Imad Mahgoub, Ahmed Badi
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential research topic. This paper identifies cross-node event queues as a major source of slow down in practical parallel event simulations and proposes dynamically moving entities between nodes to minimize such remote event queues. The problem statement is formalized and an algorithm based on an approximation algorithm for the Capacitated Minimum K-Cut Problem is proposed. The algorithm is simulated and results are presented that show its effectiveness. For simulations with reasonably regular structural relationships between entities, reductions of remote entity queues from 80 to 90 % are demonstrated.
Migration Effects of Parallel Genetic Algorithms on Line Topologies of Heterogeneous Computing Resources
Authors: Yiyuan Gong, Senlin Guan, Morikazu Nakamura
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper investigates migration effects of parallel genetic algorithms (GAs) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is evaluated experimentally on two types of arrangements of heterogeneous computing resources: the ascending and descending order arrangements. Migration effects are evaluated from the viewpoints of scalability, chromosome diversity, migration frequency and solution quality. The results reveal that the performance of parallel GAs strongly depends on the design of the chromosome migration in which we need to consider the arrangement of heterogeneous computing resources, the migration frequency and so on. The results contribute to provide referential scheme of implementation of parallel GAs on heterogeneous computing resources.
Energy Allocation and Soft Decoding in Noisy Binary Network Coding
Authors: Kuen-Tsair Lay, Lun-Chung Peng
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Network coding is a hot research topic due to its ability to improve network throughput and robustness. Most existing research on network coding assumes that the transmission between two nodes in a network is free of errors. Accompanying with this assumption is that nodes in the network always perform hard decisions regarding the received data bits. In this paper, however, we deal with the fact that data transmission is noisy in reality. Only binary networks are considered. The communication channel between two nodes is treated as either BSC or AWGN. Two issues are addressed. First, with all network branches treated as BSC, we investigate the problem of how a transmitter node should allocate its available energy among the branches connected to it so that the intended receivers get the best result (in some sense). Secondly, by treating the branches connected to a receiver node as AWGN, we develop a soft decoding scheme for obtaining the soft decisions (in terms of probabilities) regarding the received data bits at a receiver node. We then show how these soft decisions can be exploited in some belief-propagation decoding schemes. We claim that if error correcting codes are to be incorporated into network coding, then soft decoding is either indispensable or much preferred.
Architecture of a distributed database information resource
Authors: James R. Swager
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

In today's world, it is becoming quite clear that database management systems form a very important element in a "Distributed Information Resource" environment; however, there are other components, and the purpose of this paper is to present all of the components in a unified system. Creation of a distributed information resource implies that a number of hardware and software components are to be designed and integrated into a controlled environment. These components include one or more database management systems, a user language interface, a data/dictionary/directory catalog, a transaction controller, and a data input/output control module. The inclusion of automated office facilities: word/text processing, electronic mail/message, computer-assisted inquiry, etc., in such a distributed processing environment increases the requirements for careful planning and control. This paper describes the various system components and demonstrates the integration of them with the International Organization for Standards (ISO) communications architecture and a data storage and retrieval architecture (DSRA). The seven layers of the DSRA are defined and certain functions are assigned to each. In addition, the possible placement of the DSRA is presented in two different scenarios.
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
Authors: Han Cai, Do Young Eun
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In this paper, we analyze various characteristics of the relative mobility of a random pair of nodes in MANET to show that they produce inter-contact time with different aging properties. First, by fixing one node and resorting to the random walks on directed graphs, we mathematically prove that under four classes of stochastic mobility patterns, the resulting inter-contact times have constant/decreasing/increasing failure rate and new-better-than-used property. Then, we consider the case when both nodes are mobile and use simulation results to uncover the aging property of their inter-contact times under random waypoint models and random walk mobility models. This aging property tells us how to correctly relate the past experience of mobile nodes with their future behavior, thereby allowing tremendous opportunities brought by the memory structure in the non-exponential inter contact time, which would be impossible under the widely assumed exponentially distributed (memoryless) inter-contact time. As an application of our results, we establish for the first time that the approach based on exponential inter-contact time assumption can either under-estimate or over-estimate the actual system performance, under different stochastic mobility patterns indexed by their aging properties. Our results on aging properties also provide theoretic guidelines on how to exploit the memory structure toward better design of protocols under general mobility.
Functional analysis of enterprise resource planning systems
Authors: Todor Stoilov, Krasimira Stoilova
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

An analysis of the general functions of the Enterprise Resource Planning (ERP) systems is performed. Historical development of ERP is given. Analysis and comparisons of three open source ERP are provided.
Synthetic ecosystem of Escherichia coli for discovery of novel cooperative and self-adaptive algorithms
Authors: Kazufumi Hosoda, Kotaro Mori, Tetsuya Yomo
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Symbiosis of different biosystems is equivalent to the merge (adaptation) of different information networks. In order to understand the basis underlying symbiosis, we artificially constructed the simplest obligate and mutual symbiosis (obligate mutualism) composed of two different nutrient requiring mutants (auxotrophs) of Escherichia coli (E. coli), to find out a novel cooperative and self-adaptive algorithm. The constructed synthetic symbiosis grew with cooperative interactions and kept its growth in multiple subcultures. From the quantitative analyses, we found that E. coli in co-culture must keep their nutrient production rates at least 20-fold higher than those in solo-culture, indicating the presence of cooperative and self-adaptive mechanism regulating bacterial internal conditions for the symbiosis. Furthermore, we performed "on plate" culture and succeeded in finding a typical spatial pattern of the symbiotic colony. Further analyses of this synthetic symbiosis would provide a novel algorithm for self-organization of multiple biological networks, which is likely to be applicable for information networks.
On bipartite graphs of defect 2
Authors: Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio
Venue: European Journal of Combinatorics (2009)

It is known that the Moore bipartite bound provides an upper bound on the order of a connected bipartite graph. In this paper we deal with bipartite graphs of maximum degree Δ≥2, diameter D≥2 and defect 2 (having 2 vertices less than the Moore bipartite bound). We call such graphs bipartite (Δ,D,-2)-graphs. We find that the eigenvalues other than ±Δ of such graphs are the roots of the polynomials HD-1(x)±1, where HD-1(x) is the Dickson polynomial of the second kind with parameter Δ-1 and degree D-1. For any diameter, we prove that the irreducibility over the field of rational numbers of the polynomial HD-1(x)-1 provides a sufficient condition for the non-existence of bipartite (Δ,D,-2)-graphs for Δ≥3 and D≥4. Then, by checking the irreducibility of these polynomials, we prove the non-existence of bipartite (Δ,D,-2)-graphs for all Δ≥3 and D∈{4,6,8}. For odd diameters, we develop an approach that allows us to consider only one partite set of the graph in order to study the non-existence of the graph. Based on this, we prove the non-existence of bipartite (Δ,5,-2)-graphs for all Δ≥3. Finally, we conjecture that there are no bipartite (Δ,D,-2)-graphs for Δ≥3 and D≥4.
Preventive what-if analysis in symbiotic simulation
Authors: Heiko Aydt, Stephen John Turner, Wentong Cai, Malcolm Yoke Hean Low, Peter Lendermann, Boon Ping Gan, Rassul Ayani
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The what-if analysis process is essential in symbiotic simulation systems. It is responsible for creating a number of alternative what-if scenarios and evaluating their performance by means of simulation. Most applications use a reactive approach for triggering the what-if analysis process. In this paper we describe a preventive triggering approach which is based on the detection of a future critical condition in the forecast of a physical system. With decreasing probability of a critical condition, using preventive what-if analysis becomes undesirable. We introduce the notion of a G-value and explain how this metric can be used to decide whether or not to use preventive what-if analysis. In addition, we give an example for a possible application in semiconductor manufacturing.
RFID rationale and deployment methodology
Authors: Eugene Lutton, Geoff Skinner, Brian Regan
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Radio frequency identification (RFID) investigation and deployment requires a methodology for a successful initiation and implementation. This paper will outline a rationale and deployment methodology which is divided into three phases, namely the business, infrastructure and deployment environments. Progression through each environment is guided by the outcome from phase transitional motivators (PTM), which are developed for each section of the methodology. What is novel about this methodology is how it looks at why the organisation is contemplating or deploying RFID technology and how this then effects the decision on whether or not the deployment is completed. Our proposed solution is flexible in that a single small business or a complete supply chain can utilise the methodology. Unique to the methodology is it's focus on why and how the organisations will collect data from RFID architecture, rather than on the integration of data into corporate information systems.
Fundamental Consideration on Distance Estimation Using Acoustical Standing Wave
Authors: Noboru Nakasako, Tetsuji Uebo, Atsushi Mori, Norimitsu Ohmata
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In the research field of microwave radar, a range finding method based on standing wave is known to be effective for measuring short distances. In this paper, we focus our attention on audible sound and fundamentally examine the distance estimation method in which acoustical standing wave is used.
Accelerating multi-party scheduling for transaction-level modeling
Authors: Di Wang, Vyas Venkataraman, Zhen Wang, Wei Qin, Hangsheng Wang, Mrinal Bose, Jayanta Bhadra
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Transaction-level modeling is an essential component of system-level design. This paper advocates using rendezvous, a construct common to concurrent programming languages, as a theoretical foundation for transactions. Compared to regular function calls, rendezvous are atomic and support multipartiness and parallel composition. However, scheduling multiparty rendezvous is a challenging task due to its NP-hard complexity. This paper describes a heuristic algorithm that significantly reduces the scheduling complexity in practice. It first constructs a relationship graph among rendezvous. It then simplifies the graph and translates it into a decision tree, which assists the scheduler in partitioning and pruning the search space. Our experimental results show that the algorithm is able to improve the efficiency of the scheduler significantly.
D&eacute;monstration: EMMA pour la plasticit&eacute; en mobilit&eacute;
Authors: Vincent Ganneau, Rachel Demumieux, Gaëlle Calvary
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

This paper describes EMMA, a context-aware system that investigates plasticity in mobility. EMMA gathers data on a mobile phone, learns key contexts of use, and provides the end-user with User Interface (UI) adaptation when context changes.
An Image Enhancement Technique in Inspecting Visual Defects of Polarizers in TFT-LCD Industry
Authors: Chi-Hao Yeh, Ful-Chiang Wu
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

This study develops an image-processing filter to enhance the visual defects such as particles, stains, and uneven intensity on polarizers in TFT-LCD industry. Each pixel in the subimage of a polarizer is initially processed to calculate its standard deviation (SD) of gray level, which is sampled by its neighbors within a window. The gray level of each pixel is re-scaled by the maximal and minimal SD values on entire subimage to determine its new gray level. Real polarizers with visual defects are tested in this study. Experimental results show that the proposed filter achieves better performance than conventional image enhancement filters do. Moreover, the proposed image enhancement scheme provides more information for potential defect detection and classification alternatives. The proposed filter is simple, straightforward, and requiring no high-resolution image. Therefore, it is practically suitable for large-polarizer manufacturers to increase inspection speed.
Structural Adaptation for Patch-Based Image Denoising
Authors: Xiaofeng Du, Cuihua Li, Dunxu Yang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Most existing patch-based denoising methods are based on fixed size patch and fixed range of neighborhood, while producing state-of-the-art denoising results, the quality of the algorithm is significantly dependent on patch size. Suppose that patch size is related to image pattern, a structural adaption method for the selection of patch size is proposed in this paper. Due to the mutual similaritybetween the training samples, the simulation results illustrate the original approach can be effectively improved by adopted this method.
Comparison of different gaits with rotation of the feet for a planar biped
Authors: D. Tlalolini, C. Chevallereau, Y. Aoustin
Venue: Robotics and Autonomous Systems (2009)

Fast human walking includes a phase where the stance heel rises from the ground and the stance foot rotates about the stance toe. This phase where the biped becomes under-actuated is not present during the walk of humanoid robots. The objective of this study is to determine if this phase is useful to reduce the energy consumed in the walking. In order to study the efficiency of this phase, six cyclic gaits are presented for a planar biped robot. The simplest cyclic motion is composed of successive single support phases with flat stance foot on the ground. The most complex cyclic motion is composed of single support phases that include a sub-phase of rotation of the stance foot about the toe and of finite time double support phase. For the synthesis of these walking gaits, optimal motions with respect to the torque cost, are defined by taking into account given performances of actuators. It is shown that for fast motions a foot rotation sub-phase is useful to reduce the criteria cost. In the optimization process, under-actuated phase (foot rotation phase), fully-actuated phase (flat foot phase) and over-actuated phase (double support phase) are considered.
GPS in topographic applications
Authors: Gabriel De Jesus Oseguera-Cruz, Mario Reyes-Ayala, Edgar Alejandro Andrade-Gonzalez, Jose Alfredo Tirado-Mendez
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In this paper, the Global Positioning System (GPS) is employed to topographic applications. The position obtained with a portable module is used to determine distance and, the size of terrains or any kind of buildings. The use of this powerful is cheap and gives us a high accuracy, according to the number of simultaneous visible satellites of the GPS constellation.
Caching dynamic web content: designing and analysing an aspect-oriented solution
Authors: Sara Bouchenak, Alan Cox, Steven Dropsho, Sumit Mittal, Willy Zwaenepoel
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

Caching dynamic web content is an effective approach to reduce Internet latency and server load. An ideal caching solution is one that can be added transparently by the developers and provides complete consistency of the cached documents, while minimizing false cache invalidations. In this paper, we design and implement AutoWebCache, a middleware system for adding caching of dynamic content transparently to J2EE server-side applications having a backend database. For this purpose, we first present the principles involved in caching dynamic web content, including our logic to ensure consistency of the cached entries. Thereafter, we demonstrate the use of aspect-oriented (AOP) techniques to implement our system, showing how AOP provides modularity and transparency to the entire process. Further, we evaluate the effectiveness of AutoWebCache in reducing response times of applications, thereby improving throughput. We also analyze the transparency of our system for a general application suite, considering issues such as dynamic web pages aggregating data from multiple sources, presence of insufficiently structured interfaces for exchanging information and the use of application semantics while caching. We use two standard J2EE web benchmark applications, RUBiS and TPC-W, to conduct our experiments and discuss the results obtained.
Interactive MR game based on intelligent agent
Authors: Jae min Soh, Gowun Jeon, Kyusung Cho, Hyun S. Yang
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Up to date handheld devices have been developed enough in order to be used as platforms for Mixed Reality (MR). In the previous work, we have discussed incorporating a dynamic environment to offer better experience, which is verified as a new element for the field of digital elements. Providing users with more immersive and realistic experience, we have designed an agent system which regards agents as characters in a game to make them collaborate with each other. The characters are expected to behave more intelligently and naturally thanks to this advance.
A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems
Authors: L. F. Escudero, M. A. Garín, M. Merino, G. Pérez
Venue: Computers and Operations Research (2009)

We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0-1 first stage variables. The constraints in the first stage of the deterministic equivalent model have 0-1 variables and continuous variables, while the constraints in the second stage have only continuous. The approach uses the twin node family concept within the algorithmic framework, the so-called branch-and-fix coordination, in order to satisfy the nonanticipativity constraints. At the same time we consider a scenario cluster Benders decomposition scheme for solving large-scale LP submodels given at each TNF integer set. Some computational results are presented to demonstrate the efficiency of the proposed approach.
Face Recognition Combining 3-channel Filter Bank and 2DLDA
Authors: Yuhua Zhang, Xin Wang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In this paper, a novel 3-channel orthogonal filter bank was proposed at first, and then an efficient face recognition method combining the filter bank and 2DLDA (two-dimensional linear discriminant analysis) was presented. The framework of the proposed method consists of two steps: First, each face image was decomposed into nine sub images by using the 3-channel filter bank, and then 2DLDA was used to extract the features for face classification from the sub images. Better performance of the proposed method is confirmed by the Yale face database.
Improved testing inference in mixed linear models
Authors: Tatiane F. N. Melo, Silvia L. P. Ferrari, Francisco Cribari-Neto
Venue: Computational Statistics Data Analysis (2009)

Mixed linear models are commonly used in repeated measures studies. They account for the dependence amongst observations obtained from the same experimental unit. Often, the number of observations is small, and it is thus important to use inference strategies that incorporate small sample corrections. In this paper, we develop modified versions of the likelihood ratio test for fixed effects inference in mixed linear models. In particular, we derive a Bartlett correction to such a test, and also to a test obtained from a modified profile likelihood function. Our results generalize those in [Zucker, D.M., Lieberman, O., Manor, O., 2000. Improved small sample inference in the mixed linear model: Bartlett correction and adjusted likelihood. Journal of the Royal Statistical Society B, 62, 827-838] by allowing the parameter of interest to be vector-valued. Additionally, our Bartlett corrections allow for random effects nonlinear covariance matrix structure. We report simulation results which show that the proposed tests display superior finite sample behavior relative to the standard likelihood ratio test. An application is also presented and discussed.