ppxscal/embedding_network huggingface dataset:
Beginning PHP and MySQL: From Novice to Professional, Third Edition (Beginning from Novice to Professional), 3 edition
Authors: W. Jason Gilmore
Venue:  (2008)

Beginning PHP and MySQL: From Novice to Professional, Third Edition offers a comprehensive introduction to two of the most prominent open source technologies on the planet: the PHP scripting language and the MySQL database server. Updated to introduce the features found in MySQLs most significant release to date, readers learn how to take advantage of the latest features of both technologies to build powerful, manageable, and stable web applications. Essentially three books in one, readers not only profit from extensive introductions to the core features of each technology, but also learn how to effectively integrate the two in order to build robust data-driven applications. Packed with practical examples and insight into the real-world challenges faced by developers based on author W. Jason Gilmore's 7 years of expertise working with these technologies, readers will repeatedly return to this book as both a valuable instructional tool and reference guide. What youll learn The PHP language How to back your web site with MySQL Templating so that you can apply a consistent design across all pages on your site How to authenticate your web site users How to use cookies to maintain information (such as items in a shopping cart) while a user is browsing your site Who is this book for? This book is written for developers seeking to take advantage of the PHP language and MySQL database to create powerful web applications. About the Apress Beginning Series The Beginning series from Apress is the right choice to get the information you need to land that crucial entry-level job. These books will teach you a standard and important technology from the ground up because they are explicitly designed to take you from "novice to professional." Youll start your journey by seeing what you need to knowbut without needless theory and filler. Youll build your skill set by learning how to put together real-world projects step by step. So whether your goal is your next career challenge or a new learning opportunity, the Beginning series from Apress will take you thereit is your trusted guide through unfamiliar territory! Related Titles Beginning PHP 5 and MySQL E-Commerce: From Novice to Professional Beginning Ajax with PHP: From Novice to Professional PHP 5 Recipes: A Problem-Solution Approach Pro PHP Security PHP 5 Objects, Patterns, and Practice
Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters
Authors: Tao Xie, Xiao Qin
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Security is increasingly becoming an important issue in the design of real-time parallel applications, which are widely used in industry and academic organizations. However, existing schedulers for real-time parallel jobs on clusters generally do not factor in security requirements when making allocation and scheduling decisions. Aiming at improving security for real-time parallel applications, we develop two resource allocation schemes, called TAPADS (Task Allocation for Parallel Applications with Deadline and Security constraints) and SHARP (Security- and Heterogeneity-Aware Resource allocation for Parallel jobs), by taking into account applications"?timing and security requirements in addition to precedence constraints. In this paper we consider two types of computing platforms: homogeneous clusters and heterogeneous clusters. To facilitate the presentation of the new schemes, we build mathematical models to describe a system framework, security overhead, and parallel applications with deadline and security constraints. The proposed schemes are applied to heuristically find resource allocations that maximize the quality of security and the probability of meeting deadlines for parallel applications running on clusters. We conducted extensive experiments using real world applications and traces as well as synthetic benchmarks. Experimental results are presented to demonstrate the effectiveness and practicality of the proposed schemes.
Coverage problems in wireless sensor networks: designs and analysis
Authors: My T. Thai, Feng Wang, David Hongwei Du, Xiaohua Jia
Venue: International Journal of Sensor Networks (2008)

One fundamental problem in wireless sensor networks is the coverage problem, which reflects the quality of service that can be provided by a particular sensor network. The coverage problem is defined from several points of view due to a variety of sensor networks and a wide-range of their applications. Several different designs and formulations of the coverage problem have been proposed. They are subject to various topics such as types of interest regions (areas versus targets) and different network constraints, such as fault tolerance and bandwidth limitation. In this paper, we survey the state-of-the-art coverage formulations with an objective of maximising network lifetime. In particular, we present an overview and analysis of the solutions proposed in recent research literature.
A heuristic to find a p%-robust network design
Authors: Ada M. Alvarez, Agusto Medina, Karim De Alba
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

Given a network with a set of nodes and a set of potential edges, we must decide what edges will be included in the design to satisfy demands between pairs of nodes. Each edge has associated a finite capacity, a fixed cost and routing costs. Uncertainty will be considered in important input parameters such as demands and routing costs and will be modeled through scenarios. The objective is to find a network design that is "good" across all scenarios potentially realizable. A heuristic method based on Benders Decomposition and Tabu Search is proposed that finds an initial solution which will be improved in an iterative fashion until lies within p% of the optimal or near-optimal solution for any realizable input data scenario.
Forest leaves and four-cycles
Authors: H. L. Fu, C. A. Rodger
Venue: Journal of Graph Theory (2000)

In this article, we find necessary and sufficient conditions for the existence of a 4-cycle system of Kn - E(F) for any forest F of Kn. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 33: 161&ndash;166, 2000
Metal foams for structural applications: design and manufacturing
Authors: M. Barletta, S. Guarino, R. Montanari, V. Tagliaferri
Venue: International Journal of Computer Integrated Manufacturing (2007)

In this paper, the design and manufacture of metal foams, using the powders compact melting method (PCMM), is investigated. Experimental tests were performed to study the influence of several process parameters, that is, compaction pressure, foaming time, temperature and amount of foamable precursor material, on the kinetics of foaming process. As the large number of experimental factors involved in metal foams manufacturing, an experimental approach based upon DOE techniques was employed to reduce the trials need for individuating the best process windows. Hence, in such operative ranges, further experimental tests were carried out to trace the full trends of foaming efficiency according to leading parameters, thereby laying the basis to support manufacturers on how to deal with the operative troubles and process settings.
GEOMS: A New Software Package for the Numerical Simulation of Multibody Systems
Authors: Andreas Steinbrecher
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

In this article we present the new numerical algorithm GEOMS for the numerical integration of the most general form of the equations of motion of multibody systems, including nonholonomic constraints and possible redundancies in the constraints, as they may appear in industrial applications. Besides the numerical integration, the algorithm offers some additional features like stabilization of the model quations, use of different decomposition strategies, or checking and correction of the initial values with respect to their consistency. Furthermore, {\tt GEOMS} preserves hidden constraints and (possibly) existing solution invariants.
Healthcare IT
Authors: Thomas Jepsen, George Kraft, Simon Liu
Venue: IT Professional (2008)

The administration of medicine is changing rapidly as new regulations and standards emerge to facilitate and govern the electronic exchange of medical records.
Modelling negotiated decision making in environmental and natural resource management
Authors: Carlo Carraro, Alessandra Sgobbi
Venue: Automatica (Journal of IFAC) (2008)

The relevance of bargaining to everyday life can easily be ascertained, yet the study of any bargaining process is extremely hard, involving a multiplicity of questions and complex issues. The objective of this paper is to provide new insights on some dimensions of the bargaining process-asymmetries and uncertainties in particular-by using a non-cooperative game theory approach. We develop a computational model which simulates the process of negotiation among more than two players, who bargain over the sharing of more than one pie. Through numerically simulating several multiple issues negotiation games among multiple players, we identify the main features of players' optimal strategies and equilibrium agreements. As in most economic situations, uncertainty crucially affects also bargaining processes. Therefore, in our analysis, we introduce uncertainty over the size of the pies to be shared and assess the impact on players' strategic behaviour. Our results confirm that uncertainty affects players' behaviour and modify the likelihood of a self-enforcing agreement to emerge. The model proposed here can have several applications, in particular in the field of natural resource and environmental management at the national or local level, where conflicts over how to share a resource of a finite size are increasing.
A novel strategy for detecting multiple loci in Genome-Wide Association Studies of complex diseases
Authors: Jing Li
Venue: International Journal of Bioinformatics Research and Applications (2008)

Large-scale Genome-Wide Association Studies (GWAS) for complex diseases are increasingly common, due to recent advances in genotyping technology. Gene-gene interactions play an important role in the etiology of complex diseases and have to be addressed in GWAS. In this paper, an efficient strategy based on two-stage analysis is proposed. It combines a single-locus approach with a Goodness-Of-Fit (GOF) test in stage one, and selects a promising subset of SNPs to be modelled using a full interaction model in stage two. Extensive simulations using different disease models with different levels of epistasis demonstrate that it achieves higher power than existing approaches.
Introduction of Novel Rule Based Algorithms for Scheduling in Grid Computing Systems
Authors: Aysan Rasooli Oskooei, Mohammad Mirza-Aghatabar, Siavash Khorsandi
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The rule based scheduling algorithms are a new trend in grid scheduling algorithms; the combination of rule based algorithms for resource selection with various dispatching rules for queuing of jobs can improve or deteriorate their performance. Thus, choosing a proper queuing strategy for each algorithm is a prominent issue in scheduling. In this paper, we introduce two new dispatching rules for resource selection and three new dispatching rules for queuing of jobs; we evaluate the performance of various combinations of these new rule based scheduling algorithms and queuing strategies. Also, we use some major combination of rule based scheduling algorithms with some important queuing strategies to verify the good results of these new algorithms. We introduce a set of criteria used to evaluate the grid scheduling algorithms.
Evaluating the effectiveness of various similarity measures on Malay textual documents
Authors: Mohd Pouzi Hamzah, Tengku Mohd Tengku Sembok
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

This paper analyzes the effect of various similarity measures namely inner product for un-weighted query terms, inner product for weighted query terms, cosine of the angle between query and document vectors and Euclidean distance. The study was motivated by the fact that many researchers especially in Malay document retrievals tend to use simple method of calculating similarity measure that is based on inner product for un-weighted query terms. This paper shows that Euclidean distance outperforms other similarity measures significantly. The results suggest that Euclidean distance should be used to improve performance of document retrieval systems.
The second largest eigenvalue upper bound for the canonical genetic algorithms
Authors: Parag C. Pendharkar
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

We provide an analysis of a Markov chain model that explains the convergence properties of canonical genetic algorithms with proportional selection, single point crossover and bit mutation with a mutation rate between 0 and 1. Specifically, we provide a second largest eigenvalue upper bound for canonical genetic algorithms (CGA). We show that, when mutation rate for CGA is 0.5, the second largest eigenvalue for the CGA is zero and the CGA converges to a stationary distribution in the first step after the initial random population initialization.
Combining path analysis with time-resolved functional magnetic resonance imaging: The neurocognitive network underlying mental rotation
Authors: Christine Ecker, Michael J. Brammer, Steven C. Williams
Venue: Journal of Cognitive Neuroscience (2008)

There is strong evidence to suggest that the complex cognitive process underlying mental rotation does not have a discrete neural correlate, but is represented as a distributed neural system. Although the neuroanatomical nodes of this so-called rotation network are well established, there is as yet little empirical evidence to indicate how these nodes interact during task performance. Using an optimized, event-related paradigm, this study aimed to test a previously proposed hypothetical neurocognitive network for mental rotation in female subjects with path analysis, and to examine changes in effective connections across different levels of task difficulty. Path analysis was carried out in combination with a time-resolved functional magnetic resonance imaging (fMRI) analysis in order to relate the observed changes on the network level to changes in specific temporal characteristics of the hemodynamic response function on the level of individual neuroanatomical nodes. Overall, it was found that the investigated sequential model did not provide an adequate fit to the data and that a model with parallel information processing was superior to the serial model. This finding challenges traditional cognitive models describing the complex cognitive process underlying mental rotation by a set of sequentially organized, functionally distinct processing stages. It was further demonstrated that the observed in interregional effective connectivity changes with the level of task demand. These changes were directly related to the time course of the experimental paradigm. The results of path analysis in fMRI should therefore only be interpreted in the light of a specific experimental design and should not be considered as general indicators of effective connections.
Linux ready for the desktop?: yes, no, and maybe
Authors: Aaron Weiss
Venue: netWorker (2008)

If you want to start an online war without getting mixed up in national politics, go to a technology site like Slashdot or Digg and ask, "Is Linux ready for the desktop yet?" People love to argue about Linux, particularly how the desktop experience stacks up to Windows and Mac. Some of the people with strong opinions hardly even know what Linux is. Others know Linux almost too well, their minds stuck in a narrow and ideologically-driven rut.
An Overlay Discovery Algorithm towards a Pure Distributed Communication System
Authors: Charilaos Tsivopoulos, Jawed Siddiqi, Babak Akhgar, Shahram Rahimi, Morvarid Bassir
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The present paper proposes an architecture for a pure peer-to-peer communication system that is free from centralized coordination and knowledge. To meet this decentralization requirement the current paper focuses on a novel Overlay Discovery Algorithm which allows peers to connect to the network in an efficient and dynamic fashion. The system consists of three core modules which enable peers to meet, organize and communicate respectively. In addition, a series of simulation results is presented as a proof of concept for the Overlay Discovery Algorithm.
Say What You Do: Building a framework of IT controls, policies, standards, and procedures
Authors: Dorian,  J Cougias, Marcelo Halpern, Rebecca Herold
Venue:  (2007)

Say What You Do: Building a framework of IT controls, policies, standards, and procedures is the definitive guide to process documentation. Written by an all-star team of award winning writers, internationally acclaimed lawyers and IT auditors, Say What You Do walks the reader through all of the steps necessary for creating a compliance-driven IT controls framework, policies, standards, and procedures. Included are techniques for solid writing, editing, and policy, standard, and procedure dissemination.
Semidefinite programming and arithmetic circuit evaluation
Authors: Sergey P. Tarasov, Mikhail N. Vyalyi
Venue: Discrete Applied Mathematics (2008)

We address the exact semidefinite programming feasibility problem (SDFP) consisting in checking that intersection of the cone of positive semidefinite matrices and some affine subspace of matrices with rational entries is not empty. SDFP is a convex programming problem and is often considered as tractable since some of its approximate versions can be efficiently solved, e.g. by the ellipsoid algorithm. We prove that SDFP can decide comparison of numbers represented by the arithmetic circuits, i.e. circuits that use standard arithmetical operations as gates. Our reduction may give evidence to the intrinsic difficulty of SDFP (contrary to the common expectations) and clarify the complexity status of the exact SDP-an old open problem in the field of mathematical programming.
Analysis of an extended pressure finite element space for two-phase incompressible flows
Authors: Arnold Reusken
Venue: Computing and Visualization in Science (2008)

We consider a standard model for incompressible two-phase flows in which a localized force at the interface describes the effect of surface tension. If a level set (or VOF) method is applied then the interface, which is implicitly given by the zero level of the level set function, is in general not aligned with the triangulation that is used in the discretization of the flow problem. This non-alignment causes severe difficulties w.r.t. the discretization of the localized surface tension force and the discretization of the flow variables. In cases with large surface tension forces the pressure has a large jump across the interface. In standard finite element spaces, due to the non-alignment, the functions are continuous across the interface and thus not appropriate for the approximation of the discontinuous pressure. In many simulations these effects cause large oscillations of the velocity close to the interface, so-called spurious velocities. In [6] it is shown that an extended finite element space (XFEM) is much better suited for the discretization of the pressure variable. In this paper we derive important properties of the XFEM space. We present (optimal) approximation error bounds and prove that the diagonally scaled mass matrix has a uniformly bounded spectral condition number. Results of numerical experiments are presented that illustrate properties of the XFEM space.
Exploring local search in winner determination problem
Authors: Raj Jog Singh, Anup Kumar Sen
Venue: Information Technology and Management (2008)

In Combinatorial Auctions, multiple goods (items) are available for auction simultaneously, and bidders bid for combinations of goods called bundles. In the single unit combinatorial auction problem, there is only single unit of each item present and the items are considered to be indivisible. This forms the supply side constraint resulting in a need by the seller to decide on which bundles to allocate for maximizing the revenue. Determining these winning bundles is an NP-complete problem and is known by the name of Winner Determination Problem (WDP) in literature. Combinatorial auction mechanism has a wide range of practical applications such as allocation of railroads, auction of adjacent pieces of real estate, auction of airport landing slots, distributed job shop scheduling etc. The optimal heuristic search algorithms like CASS and CABOB proposed for solving the WDP take a lot of CPU time for solving large problem instances. Though these algorithms give optimal solutions, they would be useful only in scenarios where time is not at all a constraint, and the bidding is a one time affair. This poses a limitation in conducting combinatorial auctions with multiple rounds of bidding and hence hinders the widespread use of combinatorial auctions on the patterns of traditional English auction and internet auctions. Thus faster solution of WDP holds the key to widespread use and popularity of combinatorial auctions. This paper attempts to address the above issue, and proposes a simple local search technique LSWDP (Local Search for Winner Determination Problem) that runs very fast and provides solutions quite close to optimal for a number of applications. It also outputs optimal solutions in many instances taking only a fraction of the CPU time taken by CASS. In addition LSWDP was found to outperform the anytime algorithm CASS given a time cutoff. This paper also presents an enhancement called LSCN (Local Search using Complimentary Neighborhood) that provides still better solutions in terms of close to optimal behavior and achieves a much better strike rate in hitting optimal solutions. LSCN runs slower than LSWDP but still takes only a fraction of the CPU time taken by CASS thus encouraging the use of local search for combinatorial auctions. Finally, an extension to multi-partition search has been proposed and analyzed.
An access control mechanism for P2P collaborations
Authors: Christoph Sturm, Klaus R. Dittrich, Patrick Ziegler
Venue: Proceedings of the 2008 international workshop on Data management in peer-to-peer systems (2008)

We introduce a fine grained access control mechanism for Peer-to-Peer collaborations. It is based on the local access control components of the participants. The peers export their access control policies in XACML. Two mechanisms are proposed to combine these policies. The first approach establishes mappings between the export policies. The second approach installs a distributed access control directory. While mappings are created between two peers, a directory contains all rights of all users of all peers. We compare these two approaches and discuss their pros and cons.
Modeling a Time and Space Efficient Parallel Text Searching
Authors: Ibrahim Umar, Rosni Abdullah
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

We proposed a parallel linear storage space with a sub linear complexity text searching algorithm by a combination of an offline and online text searching methods. We achieved this by modeling a Semi-self Index which is consists of text along its index in an efficient and compact structure. This structure will only required an n storage space and also a small running time space during the search process. The proposed searching algorithm is proven to be practically efficient since it gained a near linear speedup in a parallel environment and runs in the average of O(n/cp.m.log(c/sigma)+c_time) theoretical time.