ppxscal/embedding_network huggingface dataset:
On pointers versus addresses
Authors: A. M. Ben-Amram, Z. Galil
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The problem of determining the cost of random-access memory (RAM) is addressed by studying the simulation of random addressing by a machine which lacks it, called a pointer machine. The model allows the use of a data type of choice. A RAM program of time t and space s can be simulated in O(t log s) time using a tree. However, this is not an obvious lower bound since a high-level data type can allow the data to be encoded in a more economical way. The major contribution is the formalization of incompressibility for general data types. The definition extends a similar property of strings that underlies the theory of Kolmogorov complexity. The main theorem states that for all incompressible data types an Omega (t log s) lower bound holds. Incompressibility is proved for the real numbers with a set of primitives which includes all functions which are continuously differentiable except on a countable closed set.
Intelligent Web Caching Using Neurocomputing and Particle Swarm Optimization Algorithm
Authors: Sarina Sulaiman, Siti Mariyam Shamsuddin, Fadni Forkan, Ajith Abraham
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Web caching is a technology for improving networktraffic on the internet. It is a temporary storage of Webobjects (such as HTML documents) for later retrieval.There are three significant advantages to Webcaching; reduced bandwidth consumption, reducedserver load, and reduced latency. These rewards havemade the Web less expensive with better performance.In this paper, an Artificial Intelligence (AI) approachis introduced for Web caching to determine the type ofWeb request, either to cache or not, and to optimizethe performance on Web cache. Two methods areemployed in this study; Artificial Neural Network(ANN), and Particle Swarm Optimization (PSO). Theexperimental results have revealed that someimprovements have been accomplished compared tothe existing technique in terms of Web cache size.
A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
Authors: B. Shahul Hamid Khan, G. Prabhaharan, P. Asokan
Venue: International Journal of Computer Mathematics (2007)

In this paper we address the problem of minimizing the weighted sum of makespan and maximum tardiness in an m-machine flow shop environment. This is a NP-hard problem in the strong sense. An attempt has been made to solve this problem using a metaheuristic called Greedy Randomized Adaptive Search Procedure (GRASP). GRASP is a competitive algorithm and is a meta-heuristic for solving combinatorial optimization problems. We have customized the basic concepts of GRASP algorithm to solve a bicriteria flow shop problem and a new algorithm named B-GRASP (Bicriteria GRASP algorithm) is proposed. The new proposed algorithm is evaluated using benchmark problems taken from Taillard and compared with the existing simulated annealing based heuristic developed by Chakravarthy and Rajendran. Computational experiments indicate that the proposed algorithm is much better than the existing one in all cases.
Exact and Approximate Controllability for Distributed Parameter Systems: A Numerical Approach (Encyclopedia of Mathematics and its Applications), 1 edition
Authors: Roland Glowinski, Jacques-Louis Lions, Jiwen He
Venue:  (2008)

This book investigates how a user or observer can influence the behavior of systems mathematically and computationally. A thorough mathematical analysis of controllability problems is combined with a detailed investigation of methods used to solve them numerically; these methods being validated by the results of numerical experiments. In the first part of the book, the authors discuss the mathematics and numerics relating to the controllability of systems modeled by linear and non-linear diffusion equations; Part two is dedicated to the controllability of vibrating systems, typical ones being those modeled by linear wave equations; and finally, part three covers flow control for systems governed by the Navier-Stokes equations modeling incompressible viscous flow. The book is accessible to graduate students in applied and computational mathematics, engineering and physics; it will also be of use to more advanced practitioners.
Bayes Machines for binary classification
Authors: Daniel Hernández-Lobato, José Miguel Hernández-Lobato
Venue: Pattern Recognition Letters (2008)

In this work, we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are consistent with the data (the so-called version space) and the intrinsic noise in class labeling. We follow a Bayesian approach and compute an approximate posterior distribution for the model parameters, which leads to a predictive distribution over unseen data. The most compelling feature of the proposed model is that it is able to learn the noise present in the data with no additional cost. All the computations are carried out by means of the approximate Bayesian inference algorithm Expectation Propagation. Experimental results indicate that the proposed approach outperforms Support Vector Machines over several of the classification problems studied and is competitive with other Bayesian classification algorithms based on Gaussian Processes.
Model validation through experimental testbed: the fluid flow behavior example
Authors: Adel Aziz, Thomas Huehn, Roger Karrer, Patrick Thiran
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

This testbed practice paper presents our efforts to validate an analytical model for fluid flow behavior in wireless mesh networks with an experimental evaluation. We have developed a fluid model for multihop communication in wireless mesh networks and analyzed it with simulations. Now, we describe our efforts to reproduce the modeled and simulated network with an indoor WiFi mesh network and to measure flow parameters that allow us to verify that the underlying assumptions and the flow behavior can be matched in real networks. Our experiences emphasize the need to gap the bridge between simulations and experimental validation as well as the lack of tools to efficiently validate results. These findings are particularly true in wireless mesh networks where interference is beyond the control of the experiment and where nodes are distributed such that an easy coordination and monitoring of the nodes is not possible.
Image restoration based on Laplacian preprocessed long-range correlation
Authors: Javad Ahmadi-Shokouh, Hengameh Keshavarz
Venue: Multidimensional Systems and Signal Processing (2008)

A decision-based adaptive filter is proposed to remove impulse-noise: (1) A modified Laplacian operator accurately locates impulse-noise corrupted pixels. (2) Another image-region highly correlated with the to-be-restored image-region is identified through "Long-Range Correlation" with statistically designed search-ranges and match-criterion. (3) The center of the to-be-restored image-region is replaced using a proposed recovering approach. Simulation results demonstrate the proposed method's superior impulse-noise removal capability vis-a-vis other recent approaches.
The research on equilibrium principle in spot power market
Authors: Wang Chengmin, Jiang Chuanwen
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Equilibrium is the optimum operational condition for the power market by economics rule. Whereas the spot power market cannot generally achieve the equilibrium due to existing network losses and congestion. The impact of the network losses and congestion on spot power market is analyzed in order to newly establish the equilibrium model under considering the network topology. At the end, the OPF is solved by means of the equal price principle. The case study is made on IEEE-30 nodes system in order to prove the results proposed in this paper.
Mobilit&eacute;: fer de lance d'une organisation &laquo;Agile&raquo;
Authors: Daniel Lang
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

The XXI century Enterprises work on their processes to try to optimize them. This Business Process Reengineering needs a permanent presence of actors. This research try to analyze the impact of Wireless Technology on the impact of optimization processes and display conclusions about a questionnaire sent to 32 enterprises dealing with Wireless services and their impacts on productivity.
Moving frames for laplace invariants
Authors: Ekaterina Shemyakova, Elizabeth L. Mansfield
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

The development of symbolic methods for the factorization and integration of linear PDEs, many of the methods being generalizations of the Laplace transformations method, requires the finding of complete generating sets of invariants for the corresponding linear operators and their systems with respect to the gauge transformations L -> g(x,y)-1 O L O g(x,y). Within the theory of Laplace-like methods, there is no uniform approach to this problem, though some individual invariants for hyperbolic bivariate operators, and complete generating sets of invariants for second- and third-order hyperbolic bivariate ones have been obtained. Here we demonstrate a systematic and much more efficient approach to the same problem by application of moving-frame methods. We give explicit formulae for complete generating sets of invariants for second- and third-order bivariate linear operators, hyperbolic and non-hyperbolic, and also demonstrate the approach for pairs of operators appearing in Darboux transformations.
Sparse partitions
Authors: B. Awerbuch
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A collection of clustering and decomposition techniques that make possible the construction of sparse and locality-preserving representations for arbitrary networks is presented. The representation method considered is based on breaking the network G(V,E) into connected regions, or clusters, thus obtaining a cover for the network, i.e. a collection of clusters that covers the entire set of vertices V. Several other graph-theoretic structures that are strongly related to covers are discussed. These include sparse spanners, tree covers of graphs and the concepts of regional matchings and diameter-based separators. All of these structures can be constructed by means of one of the clustering algorithms given, and each has proved a convenient representation for handling certain network applications.
Beyond the Ownership of Handheld Devices: Active Learning with Ubiquitous Learning Minds
Authors: Chen-Chung Liu
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

Whether mobile and ubiquitous learning becomes a substantial learning scenario depends on how the mobile and ubiquitous technologies facilitate new learning demand in the future. The ownership of devices and the mobility of the personally-owned devices are not the only critical issues as computational power becomes universally available. The rapidly changing world creates new challenges for learners beyond learning existing knowledge. It requires learners live and learn with an active learning mind that promotes personal autonomy, social collaboration and intelligence as well as epistemic pluralism in order to create innovation with the aid of technologies. Transformative pedagogies and environment are required to facilitate the cultivation of such learning mind. Encouraging contribution, technology adoption, social intelligence and socially promotive collaboration become the critical issues when learners are augmented with distributed learning minds through mobile and ubiquitous technologies.
Are our homes ready for services? A domotic infrastructure based on the Web service stack
Authors: Marco Aiello, Schahram Dustdar
Venue: Pervasive and Mobile Computing (2008)

The increase in computational power and the networking abilities of home appliances are revolutionizing the way we interact with our homes. This trend is growing stronger and opening a number of technological challenges. From the point of view of distributed systems, there is a need to design architectures for enhancing the comfort and safety of the home, which deals with issues of heterogeneity, scalability and openness. By considering the evolution of domotic research and projects, we advocate a role for Web services in the domestic network. We ground our claim by proposing a concrete architecture for a home in which the health of an elder is monitored. The architecture is implemented on a heterogeneous set of devices, which allows us to evaluate it and draw conclusions on the feasibility of using service-oriented approaches in ubiquitous computing.
How E-government affects the organisational structure of Chinese government
Authors: Zelin Li
Venue: AI Society (2008)

China is undergoing rapid economic and political change, accompanied by developments in e-government, with radical implications for citizens. The article considers the modernisation of government organisation, and challenges of technology management.
W-AlignACE
Authors: Xin Chen, Lingqiong Guo, Zhaocheng Fan, Tao Jiang
Venue: Bioinformatics (2008)

Motivation: Position weight matrices (PWMs) are widely used to depict the DNA binding preferences of transcription factors (TFs) in computational molecular biology and regulatory genomics. Thus, learning an accurate PWM to characterize the binding sites of a specific TF is a fundamental problem that plays an important role in modeling regulatory motifs and also in discovering the regulatory targets of TFs. Results: We study the question of how to learn a more accurate PWM from both binding sequences and gene expression (or ChIP-chip) data, and propose to find a PWM such that the likelihood of simultaneously observing both binding sequences and their associated gene expression (or ChIP-chip) data is maximised. To solve the above maximum likelihood problem, a sequence weighting scheme is thus introduced based on the observation that binding sites inducing drastic fold changes in mRNA expression (or showing strong binding ratios in ChIP experiments) are likely to represent a true motif. We have incorporated this new learning approach into the popular motif finding program AlignACE. The modified program, called W-AlignACE, is compared with three other programs (AlignACE, MDscan and MotifRegressor) on a variety of datasets, including simulated data, mRNA expression and ChIP-chip data. These tests demonstrate that W-AlignACE is an effective tool for discovering TF binding motifs from gene expression (or ChIP-chip) data and, in particular, has the ability to find very weak motifs like DIG1 and GAL4. Availability: http://www.ntu.edu.sg/home/ChenXin/Gibbs Contact: chenxin@ntu.edu.sg Supplementary information: Supplementary data are available at Bioinformatics online.
La fusion multi-capteurs dans l'habitat communicant: une approche non-probabiliste
Authors: Vincent Ricquebourg, David Durand, David Menga, Laurent Delahoche, Bruno Marhic, Christophe Logé, Anne-Marie Jolly-Desodt
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

To follow up our works on a service-oriented architecture dedicated to context perception for the smart home [7], we present in this paper how to move complex reasoning on top of the ontology. We focus on a multi-sensors data fusion architecture using the Transferable Belief Model. High level symbolic data are deduced using fusion from redundant, complementary and heterogeneous sensors data. Symbolic data describe complex contexts and enable to provide more contextualised services. To show the contribution of using the Transferable Belief Model in context awareness systems we detail an experiment about human posture characterisation using heterogeneous and uncertain sensors data.
Calico: a prototype sketching tool for modeling in early design
Authors: Nicolas Mangano, Alex Baker, André van der Hoek
Venue: Proceedings of the 2008 international workshop on Models in software engineering (2008)

Design is an inherently creative process, particularly so during the early stages of design when a solution is just beginning to form. At this time, the more formal models and modeling languages to which we are so accustomed in software engineering serve a limited if non-existent role. But this does not mean that modeling is not relevant during early design; on the contrary, it is critical. It is just that a different form of modeling and overall design process takes place. In this paper, we present early results from our foray into exploring how designers can be supported in the early, highly creative stages of software design. We particularly build upon the existing body of work in creativity and general design, and apply key lessons found there to the construction of Calico, a prototype sketching tool for modeling in early design.
A trustworthy framework for impromptu service discovery with mobile devices
Authors: Daqing Zhang, Abdallah Mhamed, Mounir Mokhtari
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Wireless hotspots are permeating our workplace, home and public places bringing interesting services and spontaneous connectivity to mobile users. While it's ideal to enable the mobile clients to discover services automatically with the device-to-hand across the augmented physical spaces, it's equally important to guarantee the security and privacy of the mobile clients and service providers. In this paper, we propose a trustworthy framework that can support impromptu service discovery with mobile devices in WLAN enabled environments. Different from the existing service discovery approaches, the framework requires no specialized hardware or software installation in mobile client devices, it can preserve the privacy of mobile users during the authentication process by not requesting their identities. We prototyped a set of assistive services in a shopping mall which can be spontaneously discovered and accessed by a disabled person from his WLAN enabled mobile device, we show how both the security and privacy are achieved in a unified manner using trusted computing platforms.
Minimum pilot power for service coverage in WCDMA networks
Authors: Iana Siomina, Di Yuan
Venue: Wireless Networks (2008)

Pilot power management is an important issue for efficient resource utilization in WCDMA networks. In this paper, we consider the problem of minimizing pilot power subject to a coverage constraint. The constraint can be used to model various levels of coverage requirement, among which full coverage is a special case. The pilot power minimization problem is NP-hard, as it generalizes the set covering problem. Our solution approach for this problem consists of mathematical programming models and methods.We present a linear-integer mathematical formulation for the problem. To solve the problem for large-scale networks, we propose a column generation method embedded into an iterative rounding procedure. We apply the proposed method to a range of test networks originated from realistic network planning scenarios, and compare the results to those obtained by two ad hoc approaches. The numerical experiments show that our algorithm is able to find near-optimal solutions with a reasonable amount of computing effort for large networks. Moreover, optimized pilot power considerably outperforms the ad hoc approaches, demonstrating that efficient pilot power management is an important component of radio resource optimization. As another part of our numerical study, we examine the trade-off between service coverage and pilot power consumption.
Challenges in using system-level models for RTL verification
Authors: Kelvin Ng
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In modern day digital design flow, high-level models written in C and C++ serve multiple purposes, one of which is to aid verification of register-transfer level (RTL) hardware models. These high-level models, also called system-level models (SLMs), act as reference models for hardware designs created at the RTL level. They define the correct behavior for the RTL hardware design under verification. Written in a programming language (or similar) and therefore executable, they are used extensively in both simulation-based verification and formal equivalence checking. This paper presents how SLMs fit into the different RTL verification schemes and the challenges involved in the various verification flows. Input stimulus generation based on formal verification technology is introduced as a new way to improve simulation coverage. This paper also covers other techniques engineers use to meet various challenges encountered in RTL verification.
Author-topic evolution analysis using three-way non-negative Paratucker
Authors: Wei Peng, Tao Li
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Analyzing three-way data has attracted a lot of attention recently due to the intrinsic rich structures in real-world datasets. The PARATUCKER model has been proposed to combine the axis capabilities of the Parafac model and the structural generality of the Tucker model. However, no algorithms have been developed for fitting the PARATUCKER model. In this paper, we propose TANPT algorithm to solve the PARATUCKER model. We apply the algorithm for temporal relation co-clustering on author-topic evolution. Experiments on DBLP datasets demonstrate its effectiveness.
Induced paths in 5-connected graphs
Authors: Matthias Kriesell
Venue: Journal of Graph Theory (2001)

We show that between any two vertices of a 5-connected graph there exists an induced path whose vertices can be removed such that the remaining graph is 2-connected. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 36: 52&ndash;58, 2001
On the local and global errors of splitting approximations of reaction-diffusion equations with high spatial gradients
Authors: Stéphane Descombes, Thierry Dumont, Violaine Louvet, Marc Massot
Venue: International Journal of Computer Mathematics (2007)

In this paper we study the approximation by splitting techniques of the ordinary differential equation U+A U+B U=0, U(0)=U0 with A and B two matrices. We assume that we have a stiff problem in the sense that A is ill-conditionned and U0 is a vector which is the discretization of a function with a very high derivative. This situation may appear for example when we study the discretization of a partial differential equation. We prove some error estimates for two general matrices and in the stiff case, where the estimates are independent of U0 and the commutator between A and B.