ppxscal/embedding_network huggingface dataset:
Policy Based Management for Internet Communities
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

Policy Based Management (PBM) is a research topicthat has been driven by the tremendous complexityinherent in the administration and management ofpresent-day networking and telecommunications systemsand services. The increasingly diverse organisationalforms of modern industry represent a significantcomponent of this complexity. Internet communities offerextreme examples of organisational diversity, since theyoften lack any central authority and many subsectionsoperate with almost complete autonomy. This paperargues that PBM systems offer great potential in thisdomain due to the complexity of managementarrangements. However, since these communities lackany single trusted administrative hierarchy, a centralisedsolution to policy engineering and management is notpossible. This paper proposes an approach to modellingcommunities for PBM systems. This approach focuses onthe concept of communities within a hierarchy ofauthority as the fundamental unit of organisationalanalysis. As such, the model reflects the distribution ofauthority in the real-world community, the resultingpolicies reflect the community's operational needs andcontracts between the various groups and individualsthat make up the community. Policy conflicts are used toidentify organisational conflicts that must be resolved. Inorder to illustrate and validate these concepts, the paperpresents a conceptual architecture and case study basedon the secure management of an open publishingnetwork.
Enactment of Inter-Organizational Workflows Using Aspect-Element-Oriented Web Services
Authors: Rainer Schmidt
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

To support collaboration over the web, workflows have to be enacted not only within an organization, but also between organizations. These inter-organizational workflows create new requirements to enactment architectures, as a dynamic set of workflow participants has to be supported. Therefore, a new enactment architecture based on web services is developed. It uses a homogeneous and dynamic composition of so called aspect-element-oriented web services to support inter-organizational workflows.
A comparison of application-level and router-assisted hierarchical schemes for reliable multicast
Authors: Pavlin Radoslavov, Christos Papadopoulos, Ramesh Govindan, Deborah Estrin
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

One approach to achieving scalability in reliable multicast is to use a hierarchy. A hierarchy can be established at the application level, or by using router-assist. With router-assist we have more fine-grain control over the placement of error-recovery functionality, therefore, a hierarchy produced by assistance from the routers is expected to have better performance. In this paper, we test this hypothesis by comparing two schemes, one that uses an application-level hierarchy (ALH) and another that uses router-assisted hierarchy (RAH). Contrary to our expectations, we find that the qualitative performance of ALH is comparable to RAH. We do not model the overhead of creating the hierarchy nor the cost of adding router-assist to the network. Therefore, our conclusions inform rather than close the debate of which approach is better.
Efficient Rendering of Strong Secondary Lighting in Photon Mapping Algorithm
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

In this paper we propose an efficient algorithm for handlingstrong secondary light sources within the photon mappingframework. We introduce an additional photon map asan implicit representation of such light sources. At the renderingstage this map is used for the explicit sampling ofstrong indirect lighting in a similar way as it is usually performedfor primary light sources. Our technique works fullyautomatically, improves the computation performance, andleads to a better image quality than traditional renderingapproaches.
Physically-Based Simulation of Objects Represented by Surface Meshes
Authors: Matthias Muller, Matthias Teschner, Markus Gross
Venue: Proceedings of the Computer Graphics International (2004)

Objects and scenes in virtual worlds such as 3-d computergames are typically represented by polygonal surfacemeshes. On the other hand, physically-based simulationsof deformations or fracture effects require volumetricrepresentations such as tetrahedral meshes. Inthis paper we propose techniques to generate volumetricmeshes dynamically for objects represented by surfacemeshes allowing the simulation of physical effects suchas motion, deformation and fracture.We use the Finite Element Method based on cubicalelements of uniform size. Regular cube meshes have severaladvantages over geometrically more complex representations.Because of their simplicity, cube meshes canbe generated quickly by voxelizing objects while neithergeometry nor stiffness information needs to be stored explicitly.The low memory consumption makes physically-basedanimation possible for large scenes even on gameconsoles. We animate the original high resolution surfacemesh by coupling it to the underlying volumetric mesh.This way, the regular structure of the volumetric meshis hidden from the user. We also propose a technique tofracture the surface mesh along with the cube mesh whichkeeps the surface watertight and results in realistic fracturepatterns.
EvoFIT: A holistic, evolutionary facial imaging technique for creating composites
Authors: Charlie D. Frowd, Peter J. B. Hancock, Derek Carson
Venue: ACM Transactions on Applied Perception (TAP) (2004)

EvoFIT, a computerized facial composite system is being developed as an alternative to current systems. EvoFIT faces are initially presented to a witness with random characteristics, but through a process of selection and breeding, a composite is "evolved." Comparing composites constructed with E-FIT, a current system, a naming rate of 10&percnt; was found for EvoFIT and 17&percnt; for E-FIT. Analysis revealed that target age was limiting factor for EvoFIT and a second study with age-appropriate targets visible during composite construction produced a naming rate similar to E-FIT. Two more-realistic studies were conducted that involved young target faces and two current systems (E-FIT and PROfit). Composites from both of these experiments were poorly named but a significant benefit emerged for EvoFIT.
Massive Parallelism for Query Answering in Weakly Integrated P2P Systems
Authors: Zoran Majkic
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

A new set of requirements for query processing has emerged, as Internet and Web-based query systems have become more prevalent. In this emerging data management domain, queries are posed over multiple semistructured information sources distributed across a wide-area network. Each source may be autonomous and may potentially have data of a different format and new sources are frequently added. We present the basic elements of a new weakly-coupled semantics that correctly captures the modular structure of a data-intensive P2P system, and opens up the possibility of effective query answering techniques. One of the basic characteristics of peers in our approach is that they are based on Abstract Object Types which encapsulate a data integration system in order to deal with incomplete Web-based information, and to offer a rich ontology interface to their clients. We describe an incremental algorithm for answering conjunctive queries posed to one peer. The contributions to the query answer of any peer are given by the certain answers that such peer provides. We show that the algorithm supports the high parallelism in the process of query answering from different peers. Such parallelism can be modulated from the massive parallelism to the minor forms of parallelism, which depends from the user incremental-answering strategy.
Analytic Modeling of Interconnects for Deep Sub-Micron Circuits
Authors: Dinesh Pamunuwa, Shauki Elassaad, Hannu Tenhunen
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Closed form equations for second order transfer functions of generalarbitrarily-coupled RC trees with multiple drivers are reported.The models allow precise delay and noise calculations for systemsof coupled interconnects with guaranteed stability, and representthe minimum complexity associated with this class of circuits. Thesimplicity, accuracy and generality of the models make them suitablefor use in early delay and noise planning of global signals incomplex systems.
A Linguistic Approach to Extracting Acronym Expansions from Text
Authors: Manuel Zahariev
Venue: Knowledge and Information Systems (2004)

We propose a linguistically aided approach for the extraction of acronyms from text, with implications at the discourse, lexicon, morphologic and phonologic levels. A system implemented using this approach achieves excellent performance ($f=95.22$%) on a limited corpus. Our work indicates the adequacy of linguistic methods for acronym discovery.
Food Handling and Packaging Using Computer Vision and Robot
Authors: B. Muhammedali, M. Z. Abdullah, M. N. Mohd Azemi
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Even though the use of robot vision system in manufacturing sectors is now a commonplace, however, the technology embodied in these devices is poorly matched to industrial needs of food processors. In particular, food processing imposes special demands upon machinery. For instance the vision sensor must be programmed to detect the position of single and isolated object as well as overlapping or occluding objects. Special grippers have to be designed for handling of food articles such that they have minimum contact with the food items and hence causing minimum damage to them. In this project, started over a year ago, a vision guidance system is being developed to meet this objective. The system integrates the modified version of the Hough transform algorithm as the main recognition engine. The methods and procedures were tested on commercially produced beef burgers.
Defect Handling in Medium and Large Open Source Projects
Authors: A. Gunes Koru, Jeff Tian
Venue: IEEE Software (2004)

The authors conducted an online survey about the defect-handling approaches employed in medium and large open source projects. Here, they present quantitative results and related findings based on 119 responses from 52 such projects.
A Mixed Factors Model for Dimension Reduction and Extraction of a Group Structure in Gene Expression Data
Authors: Ryo Yoshida, Tomoyuki Higuchi, Seiya Imoto
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

When we cluster tissue samples on the basis of genes, the number of observations to be grouped is much smaller than the dimension of feature vector. In such a case, the applicability of conventional model-based clustering is limited since the high dimensionality of feature vector leads to overfitting during the density estimation process. To overcome such difficulty, we attempt a methodological extension of the factor analysis. Our approach enables us not only to prevent from the occurrence of overfitting, but also to handle the issues of clustering, data compression and extracting a set of genes to be relevant to explain the group structure. The potential usefulness are demonstrated with the application to the leukemia dataset.
Toward high-fidelity telepresence in space and surgery robotics
Authors: Detlef Reintsema Carsten Preusche, Tobias Ortmaier, Gerd Hirzinger
Venue: Presence: Teleoperators and Virtual Environments (2004)

High-fidelity telepresence is considered to be a key subject for the development of advanced space and surgery robotic systems. The emphasis of this paper are the key challenges like multimodal data servicing, bilateral and shared control concepts, and kinesthetic feedback devices. These technologies are the basic principles in the development of advanced space and surgery applications. Beside these technologies, advanced mechatronic systems are required as shown within this paper. The applicability of the high-fidelity telepresence concept is explored by selected space and surgery scenarios.
Constructing verified and reliable communications processing systems
Authors: Donald I. Good
Venue: ACM SIGSOFT Software Engineering Notes (1977)

A comprehensive methodology that has been developed for constructing verifiably reliable and secure computing systems is summarized. The methodology can be applied to many different kinds of systems, but is specifically oriented toward communications processing systems. The methodology is a system of methods for attaining total system reliability and is based on constructing verified software and highly reliable hardware. The methodology has been formulated by bringing a diversity of advanced research concepts to bear on the real problems of communications systems. This has led to the development and integration of* program specification methods* program proof methods* program validation methods* a program design language* a program design system* hardware designs to support verified software* hardware reliability analysis and enhancement methods into a coherent methodology for constructing verifiably reliable and secure systems. The methodology has been successfully applied to the experimental design of a secure message switching system structured as a packet-switched computer network.
Fredkin/Toffoli Templates for Reversible Logic Synthesis
Authors: Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Reversible logic has applications in quantum computing, lowpower CMOS, nanotechnology, optical computing, and DNAcomputing. The most common reversible gates are the Toffoli gate and the Fredkin gate. Our synthesis algorithm first finds a cascade of Toffoli and Fredkin gates with no back-tracking and minimal look-ahead. Next we apply transformations that reduce the size of the circuit. Transformations are accomplished via template matching. The basis for atemplate is a network with m gates that realizes the identity function. If a sequence in the network to be synthesized matches more than half of a template, then a transformationthat reduces the gate count can be applied. In this paper weshow that Toffoli and Fredkin gates behave in a similar manner. Therefore, some gates in the templates may not needto be specified-they can match a Toffoli or a Fredkin gate.We formalize this by introducing the box gate. All templateswith less than six gates are enumerated and classified. Wesynthesize all three input, three output reversible functionsand compare our results to those obtained previously.
A framework for architecting peer-to-peer receiver-driven overlays
Authors: Reza Rejaie, Shad Stafford
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

This paper presents a simple and scalable framework for architecting peer-to-peer overlays called Peer-to-peer Receiver-driven Overlay (or PRO). PRO is designed for non-interactive streaming applications and its primary design goal is to maximize delivered bandwidth (and thus delivered quality) to peers with heterogeneous and asymmetric bandwidth. To achieve this goal, PRO adopts a receiver-driven approach where each receiver (or participating peer) (i) independently discovers other peers in the overlay through gossiping, and (ii) selfishly determines the best subset of parent peers through which to connect to the overlay to maximize its own delivered bandwidth. Participating peers form an unstructured overlay which is inherently robust to high churn rate. than structured overlay networks. Furthermore, each receiver leverages congestion controlled bandwidth from its parents as implicit signal to detect and react to long-term changes in network or overlay condition without any explicit coordination with other participating peers. Independent parent selection by individual peers dynamically converge to an efficient overlay structure.
A conjecture concerning indexes of beauty
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we prove that 64 is not an index of beauty.
Toward Self-Stabilizing Operating Systems
Authors: Shlomi Dolev, Reuven Yagel
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This work presents several approaches for designing self-stabilizing operating systems. The first approach is based on periodical automatic reinstalling of the operating system and restart. The second, reinstalls the executable portion of the operating system and uses predicates on the operating system state (content of variables) to ensure that the operating system does not diverge from its specifications. The last approach presents an example of a tailored self-stabilizing very-tiny operating system. Prototypes using the Intel Pentium processor were composed.
A Problem on Hinged Dissections with Colours
Authors: J. Akiyama, F. Hurtado, C. Merino, J. Urrutia
Venue: Graphs and Combinatorics (2004)

We examine the following problem. Given a square C we want a hinged dissection of C into congruent squares and a colouring of the edges of these smaller squares with k colours such that we can transform the original square into another with its perimeter coloured with colour i, for all i in *. We have the restriction that the moves have to be realizable in the plane, so when swinging the pieces no overlappings are allowed. We show a solution for k colours that uses p2 pieces, with p an even number and at least * this by using a necklace made of the p2 pieces and an ingenious way to wrap it into a square.
Intuitive Interaction and Expressive Cinematography in Video Games
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

The cinema director controls the narrative and moodof a film by creative use of the camera and editing of thefilm. In 3D video games with action controlled by theplayer, the pseudo camera is usually less creativelycontrolled and has less effect on the playerýs appreciationof and engagement with the game. This paper discussesmethods of controlling games by easy and intuitiveinterfaces and use of an automated virtual camera toincrease the appeal of games for users.
SLA Representation and Applications in the NGI Service Management
Authors: Zhang Ruo-ying, Qui Xue-Song, Meng Luo-ming
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The emerging new service and its QoS management requirements are challenging the NGI service management, demanding extendibility and scalability. SLA has been considered as an effective way of solving QoS management. First the characteristics of a normative SLA representation are presented. Then a neutral template of SLA representation service-independent and technology-independent is proposed. At last the application scenarios in the NGI service management -XML-based SLA, SLA negotiation in the stage of service fulfillment, QoS violation in the stage of service assurance- are discussed in details according to the template.
Applying the Domain Theory to Design for Reuse
Authors: G. Papamargaritis A. Sutcliffe
Venue: BT Technology Journal (2004)

A theoretical framework of domain knowledge is proposed, consisting of classes of generalised object collaboration models and generic tasks that describe patterns of human activity. The library of generic models is applied to analysis and design for reuse of generalised component-based frameworks by using the models as templates, with associated design knowledge in the form of attached design rationale. A design by reuse method is described for identifying, at the analysis stage, generic abstract models of the structure and behaviour of new applications. Generic requirements of the identified abstractions link to object-oriented patterns for design solutions. The design process is applied to a generalised telemedicine framework. The discussion reviews the prospects for integrating generic domain models with design patterns in component-based development.
Logical Preference Representation and Combinatorial Vote
Authors: Jérôme Lang
Venue: Annals of Mathematics and Artificial Intelligence (2004)

We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independent variables to assign. We study two key issues pertaining to combinatorial vote, namely preference representation and the automated choice of an optimal decision. For each of these issues, we briefly review the state of the art, we try to define the main problems to be solved and identify their computational complexity.
Aggregated feature retrieval for MPEG-7 via clustering
Authors: Jiamin Ye, Alan F. Smeaton
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this paper, we describe an approach to combining text and visual features from MPEG-7 descriptions of video. A video retrieval process is aligned to a text retrieval process based on the TF*IDF vector space model via clustering of low-level visual features. Our assumption is that shots within the same cluster are not only similar visually but also semantically, to a certain extent. Our experiments on the TRECVID2002 and TRECVID2003 collections show that adding extra meaning to a shot based on the shots from the same cluster is useful when each video in a collection contains a high proportion of similar shots, for example in documentaries.
fr-019: poem to a horse
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

The work of a team of hobby artists and programmers in their spare time. Using commodity PC hardware and taking only 64 kilobytes of space (so everyone can download it in under 10 seconds and watch it using any reasonably modern Windows PC) it shows a plethora of abstract yet smooth objects accompanied by an electro-pop soundtrack. "Poem to a Horse" therefore explores the fields of real-time rendering, generative art and approaching the Kolmogorov complexity of visuals. Copyright held by creator.
In Defense of PowerPoint
Authors: Neville Holmes
Venue: Computer (2004)

Professionals, not the software packages they use, are responsible for the presentations they make.
Uniform error estimates for a class of intermediate cylindrical shell problems
Authors: L. Beirão da Veiga
Venue: Numerische Mathematik (2004)

A uniform in thickness error estimate is obtained for a particular class of intermediate Koiter shell problems, solved with a classical conforming finite element method. The model problem is that of a cylinder under a class of irregular loads which, due to particular symmetries, allow a simplified reformulation on a one dimensional domain. The result is an almost hs error behavior in the H&#x2212;1 dual norm, were s>0 depends on the load regularity. Such estimate is believable to be sharp (this additional claim is supported by some numerical tests).