NETEMBED: A Network Resource Mapping Service for Distributed Applications

Emerging configurable infrastructures such as large-scale overlays and grids, distributed testbeds, and sensor networks comprise diverse sets of available computing resources (e.g., CPU and OS capabilities and memory constraints) and network conditions (e.g., link delay, bandwidth, loss rate, and jitter) whose characteristics are both complex and time-varying. At the same time, distributed applications to be deployed on these infrastructures exhibit increasingly complex constraints and requirements on resources they wish to utilize. Examples include selecting nodes and links to schedule an overlay multicast file transfer across the Grid, or embedding a network experiment with specific resource constraints in a distributed testbed such as PlanetLab. Thus, a common problem facing the efficient deployment of distributed applications on these infrastructures is that of "mapping" application-level requirements onto the network in such a manner that the requirements of the application are realized, assuming that the underlying characteristics of the network are known. We refer to this problem as the network embedding problem. In this paper, we propose a new approach to tackle this combinatorially-hard problem. Thanks to a number of heuristics, our approach greatly improves performance and scalability over previously existing techniques. It does so by pruning large portions of the search space without overlooking any valid embedding. We present a construction that allows a compact representation of candidate embeddings, which is maintained by carefully controlling the order via which candidate mappings are inserted and invalid mappings are removed. We present an implementation of our proposed technique, which we call NETEMBED – a service that identify feasible mappings of a virtual network configuration (the query network) to an existing real infrastructure or testbed (the hosting network). We present results of extensive performance evaluation experiments of NETEMBED using several combinations of real and synthetic network topologies. Our results show that our NETEMBED service is quite effective in identifying one (or all) possible embeddings for quite sizable queries and hosting networks – much larger than what any of the existing techniques or services are able to handle.

Characterisations of the weak expectation property

We use representations of operator systems as quotients to deduce various characterisations of the weak expectation property (WEP) for C∗ -algebras. By Kirchberg’s work on WEP, these results give new formulations of Connes’ embedding problem.

Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves

Denote the set of 21 non-isomorphic cubic graphs of order 10 by L. We first determine precisely which L is an element of L occur as the leave of a partial Steiner triple system, thus settling the existence problem for partial Steiner triple systems of order 10 with cubic leaves. Then we settle the embedding problem for partial Steiner triple systems with leaves L is an element of L. This second result is obtained as a corollary of a more general result which gives, for each integer v greater than or equal to 10 and each L is an element of L, necessary and sufficient conditions for the existence of a partial Steiner triple system of order v with leave consisting of the complement of L and v - 10 isolated vertices. (C) 2004 Elsevier B.V. All rights reserved.

Quaternion Extensions of Order 16

2000 Mathematics Subject Classification: 12F12

Groups of Order 32 as Galois Groups

2000 Mathematics Subject Classification: 12F12.

On realizability of p-groups as Galois groups

2000 Mathematics Subject Classification: 12F12, 15A66.

Embedding graphic organisers in the teaching and learning of family and consumer sciences (home economics) in Kuwait

Educational reforms currently being enacted in Kuwaiti Family and Consumer Sciences (FCS) in response to contemporary demands for increased student-centred teaching and learning are challenging for FCS teachers due to their limited experience with student-centred learning tools such as Graphic Organisers (GOs). To adopt these reforms, Kuwaiti teachers require a better understanding of and competency in promoting cognitive learning processes that will maximise student-centred learning approaches. This study followed the experiences of four Grade 6 FCS Kuwaiti teachers as they undertook a Professional Development (PD) program specifically designed to advance their understanding of the use of GOs and then as they implemented what they had learned in their Grade 6 FCS classroom. The PD program developed for this study was informed by Nasseh.s competency PD model as well as Piaget and Ausubel.s cognitive theories. This model enabled an assessment and evaluation of the development of the teachers. competencies as an outcome of the PD program in terms of the adoption of GOs, in particular, and their capacity to use GOs to engage students in personalised, in-depth, learning through critical thinking and understanding. The research revealed that the PD program was influential in reforming the teachers. learning, understanding of and competency in, cognitive and visual theories of learning, so that they facilitated student-centred teaching and learning processes that enabled students to adopt and adapt GOs in constructivist learning. The implementation of five GOs - Flow Chart, Concept Maps, K-W-L Chart, Fishbone Diagram and Venn Diagram - as learning tools in classrooms was investigated to find if changes in pedagogical approach for supporting conceptual learning through cognitive information processing would reduce the cognitive work load of students and produce better learning approaches. The study as evidenced by the participant teachers. responses and classroom observations, showed a marked increase in student interest, participation, critical thought, problem solving skills, as a result of using GOs, compared to using traditional teaching and learning methods. A theoretical model was developed from the study based on the premise that teachers. knowledge of the subject, pedagogy and student learning precede the implementation of student-centred learning reform, that it plays an important role in the implementation of student-centred learning and that it brings about a change in teaching practice. The model affirmed that observed change in teaching-practice included aspects of teachers. beliefs, as well as confidence and effect on workplace and on student learning, including engagement, understanding, critical thinking and problem solving. The model assumed that change in teaching practice is inseparable from teachers. lifelong PD needs related to knowledge, understanding, skills and competency. These findings produced a set of preliminary guidelines for establishing student-centred constructivist strategies in Kuwaiti education while retaining Kuwait.s cultural uniqueness.

Watermarking capacity control for dynamic payload embedding

Despite significant improvements in capacity-distortion performance, a computationally efficient capacity control is still lacking in the recent watermarking schemes. In this paper, we propose an efficient capacity control framework to substantiate the notion of watermarking capacity control to be the process of maintaining “acceptable” distortion and running time, while attaining the required capacity. The necessary analysis and experimental results on the capacity control are reported to address practical aspects of the watermarking capacity problem, in dynamic (size) payload embedding.

On an embedding property of generalized Carter subgroups

If E and F are saturated formations, we say that E is strongly contained in F if for any solvable group G with E-subgroup, E, and F-subgroup, F, some conjugate of E is contained in F. In this paper, we investigate the problem of finding the formations which strongly contain a fixed saturated formation E.

Our main results are restricted to formations, E, such that E = {G|G/F(G) ϵT}, where T is a non-empty formation of solvable groups, and F(G) is the Fitting subgroup of G. If T consists only of the identity, then E=N, the class of nilpotent groups, and for any solvable group, G, the N-subgroups of G are the Carter subgroups of G.

We give a characterization of strong containment which depends only on the formations E, and F. From this characterization, we prove:

If T is a non-empty formation of solvable groups, E = {G|G/F(G) ϵT}, and E is strongly contained in F, then

(1) there is a formation V such that F = {G|G/F(G) ϵV}.

(2) If for each prime p, we assume that T does not contain the class, S_p’, of all solvable p’-groups, then either E = F, or F contains all solvable groups.

This solves the problem for the Carter subgroups.

We prove the following result to show that the hypothesis of (2) is not redundant:

If R = {G|G/F(G) ϵS_r’}, then there are infinitely many formations which strongly contain R.

Optimal embedding for watermarking in discrete data spaces

In this paper, we address the problem of robust information embedding in digital data. Such a process is carried out by introducing modifications to the original data that one would like to keep minimal. It assumes that the data, which includes the embedded information, is corrupted before the extraction is carried out. We propose a principled way to tailor an efficient embedding process for given data and noise statistics. © Springer-Verlag Berlin Heidelberg 2005.

Outlier-resisting graph embedding

Graph embedding is a general framework for subspace learning. However, because of the well-known outlier-sensitiveness disadvantage of the L2-norm, conventional graph embedding is not robust to outliers which occur in many practical applications. In this paper, an improved graph embedding algorithm (termed LPP-L1) is proposed by replacing L2-norm with L1-norm. In addition to its robustness property, LPP-L1 avoids small sample size problem. Experimental results on both synthetic and real-world data demonstrate these advantages. © 2009 Elsevier B.V. All rights reserved.

An Efficient and Verifiable Solution to the Millionaire Problem

A new solution to the millionaire problem is designed on the base of two new techniques: zero test and batch equation. Zero test is a technique used to test whether one or more ciphertext contains a zero without revealing other information. Batch equation is a technique used to test equality of multiple integers. Combination of these two techniques produces the only known solution to the millionaire problem that is correct, private, publicly verifiable and efficient at the same time.