ppxscal/embedding_network huggingface dataset:
On deflation and singular symmetric positive semi-definite matrices
Authors: J. M. Tang, C. Vuik
Venue: Journal of Computational and Applied Mathematics (2007)

For various applications, it is well-known that the deflated ICCG is an efficient method for solving linear systems with invertible coefficient matrix. We propose two equivalent variants of this deflated ICCG which can also solve linear systems with singular coefficient matrix, arising from discretization of the discontinuous Poisson equation with Neumann boundary conditions. It is demonstrated both theoretically and numerically that the resulting methods accelerate the convergence of the iterative process. Moreover, in practice the singular coefficient matrix has often been made invertible by modifying the last element, since this can be advantageous for the solver. However, the drawback is that the condition number becomes worse-conditioned. We show that this problem can completely be remedied by applying the deflation technique with just one deflation vector.
Graph-based individual representation for evolutionary synthesis of arithmetic circuits
Authors: N. Homma, T. Aoki, T. Higuchi
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper presents a graph-based evolutionary optimization technique, called evolutionary graph generation (EGG), to synthesize arithmetic circuits. The potential capability of EGG has been investigated through an experiment of synthesizing fast constant-coefficient multipliers.
Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education
Venue: Annual Joint Conference Integrating Technology into Computer Science Education (2007)

We are pleased to present the Proceedings of the 12th Annual Conference on Innovation and Technology in Computer Science Education -- ITiCSE 2007. Two years ago, the privilege of hosting ITiCSE 2007 was awarded to the University of Dundee. Since then we have spent many hours planning to make this event as enjoyable and fulfilling as possible. We hope that we have been successful. In the academic program, we have paper presentations, panel discussions, working groups, keynote speeches, tutorials, faculty and student posters, plus practical demonstrations and tips & techniques. The social program includes a ship, a Countess, a castle and an interactive theatrical performance. ITiCSE 2007 received nearly 300 academic submissions, including a record 210 papers. Thanks to our team of over 400 reviewers, all papers received at least 3 reviews, most 4, 5 or even 6. The Program Committee accepted 28% of the papers submitted. All proposals in other submission categories were very carefully reviewed. The Program Committee worked hard to create the optimum mix of high quality, relevant and interesting submissions befitting an ITiCSE conference and contributing to the special theme for 2007: Inclusive Education in Computer Science. We are fortunate to have three excellent invited speakers, each of whom will provide a different perspective on that theme: Paul Curzon (Queen Mary, University of London); Chris van der Kuyl (Chairman, Tayforth Consulting Ltd), and Vicki Hanson (IBM T.J. Watson Research Center). ITiCSE 2007 is a truly international event; submissions were received from 31 different countries: 15 European and 16 non-European. To date (April 2007), the conference website has received hits from 83 countries. The University of Dundee is pleased to be ITiCSE's first Scottish host, especially in this the University's 40th anniversary year. This is also the 50th anniversary of the British Computer Society and the 60th anniversary of the founding of the ACM. The School of Computing welcomes ITiCSE visitors to its new home, the Queen Mother Building, which opened in 2005 and is named in memory of the first Chancellor of the University.
More efficiency in multiple kernel learning
Authors: Alain Rakotomamonjy, Francis Bach, Stéphane Canu, Yves Grandvalet
Venue: Proceedings of the 24th international conference on Machine learning (2007)

An efficient and general multiple kernel learning (MKL) algorithm has been recently proposed by Sonnenburg et al. (2006). This approach has opened new perspectives since it makes the MKL approach tractable for large-scale problems, by iteratively using existing support vector machine code. However, it turns out that this iterative algorithm needs several iterations before converging towards a reasonable solution. In this paper, we address the MKL problem through an adaptive 2-norm regularization formulation. Weights on each kernel matrix are included in the standard SVM empirical risk minimization problem with a l1 constraint to encourage sparsity. We propose an algorithm for solving this problem and provide an new insight on MKL algorithms based on block 1-norm regularization by showing that the two approaches are equivalent. Experimental results show that the resulting algorithm converges rapidly and its efficiency compares favorably to other MKL algorithms.
Service Discovery Reliability and Network Neighbor Knowledge in Pervasive Computing Environments
Authors: Michael S. Thompson, Scott F. Midkiff
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Current service discovery methods offer a single level of discovery reliability since they utilize a single method of discovery communication. However, the value of services vary by service type and consumer. Also, the number of similar services may vary. While it is acceptable to use best effort location in the case of a large number of similar or low-value services, it is undesirable to fail to locate available services in scenarios of high value services or situations where there is only a single instance of a desired service. Current schemes do not take into account variations in value or importance. This paper discusses the need for various levels of discovery reliability and our approach to fulfilling this need, including a discussion of development, testing, and experimental results. The results show that our reliability mechanisms provide higher levels of discovery probability when desired by a consumer.
Development of an augmented reality game by extendinga 3D authoring system
Authors: Christian Geiger, Joerg Stoecklein, Florian Klompmaker, Robin Fritze
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In this paper, we describe the development of augmented reality games using the virtools dev 3D authoring system and custom extensions that allows to integrate augmented reality features and advanced interaction techniques. We used this system to create an AR game by extending an existing board game with virtual objects. The concept of predefined high-level building blocks and the visual programming environment supports the iterative design approach and allows to quickly develop and test new game ideas.
The RUNES Middleware for Networked Embedded Systems and its Application in a Disaster Management Scenario
Authors: Paolo Costa, Geoff Coulson, Richard Gold, Manish Lad, Cecilia Mascolo, Luca Mottola, Gian Pietro Picco, Thirunavukkarasu Sivaharan, Nirmal Weerasinghe, Stefanos Zachariadis
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

Due to the inherent nature of their heterogeneity, resource scarcity and dynamism, the provision of middleware for future networked embedded environments is a challeng- ing task. In this paper we present a middleware approach that addresses these key challenges; we also discuss its ap- plication in a realistic networked embedded environment. Our application scenario involves fire management in a road tunnel that is instrumented with networked sensor and actuator devices. These devices are able to reconfigure their behaviour and their information dissemination strate- gies as they become damaged under emergency conditions, and firefighters are able to coordinate their operations and manage sensors and actuators through dynamic reprogram- ming. Our supporting middleware is based on a two-level architecture: the foundation is a language-independent, component-based programming model that is sufficiently minimal to run on any of the devices typically found in net- worked embedded environments. Above this is a layer of software components that offer the necessary middleware functionality. Rather than providing a monolithic middle- ware "layer', we separate orthogonal areas of middleware functionality into self-contained components that can be se- lectively and individually deployed according to current re- source constraints and application needs. Crucially, the set of such components can be updated at runtime to provide the basis of a highly dynamic and reconfigurable system.
Large Scale Activity Monitoring for distributed honeynets
Authors: Jerome Francois, Radu State, Olivier Festor
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

This paper proposes a new distributed monitoring approach based on the notion of centrality of a graph and its evolution in time. We consider an activity profiling method for a distributed monitoring platform and illustrate its usage in two different target deployments. The first one concerns the monitoring of a distributed honeynet, whilst the second deployment target is the monitoring of a large network telecope. The central concept underlying our work are the intersection graphs and a centrality based locality statistics. These graphs have not been used widely in the field of network security. The advantage of this method is that analyzing aggregated activity data is possible by considering the curve of the maximum locality statistics and that important change point moments are well identified.
Highly interactive online study skills course: "unstuck"
Authors: Maths Halstensen, Frode Haug
Venue: ACM SIGCSE Bulletin (2007)

This poster describes the most important aspects concerning design and development of an highly interactive web based study skills course called "Unstuck" which is a work in progress to be finished June 2008."Unstuck" is a project started by both teachers and students from Gjøvik University College and Telemark University College in Norway. This project started in 2006 as a result of experience from more than 10 years of teaching students with insufficient study skills. In this course we aim to present the theory and practice of "How to study" in an exiting interactive multimedia environment. Telemark University College has since 2002 educated students starting with only a certificate of completed apprenticeship. In 2007, approximately 70% of all the students studying electrical engineering have this type of background, and insufficient study skills are a challenge. "Unstuck" will be used by students in secondary High school and University Colleges in Telemark, and Gjøvik in Norway from August 2008. What makes Unstuck different from other study skills courses? The content of Unstuck is similar to other courses; the difference is the way the content is presented for the students. Unstuck will contain intensive use of interaction with the student, which involves various active actions such as pressing buttons, placing objects to specific locations on the screen, marking key words etc. Videos are used to demonstrate how to study in practice and to illustrate class room and other study related situations. At the end of the course the student will have a short test (quiz). If the student don't pass, it is possible to immediately repeat relevant sections, and subsequently repeat the test. "Unstuck" will be an easy to use interactive multimedia study skills course on the weB.
Eliciting Conceptual Models to Support Interdisciplinary Research
Authors: Pieter J. Beers, Pieter W. G. Bots
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Constructing interdisciplinary knowledge requires knowledge sharing between researchers studying the same object from different disciplinary angles. Such sharing is particularly difficult because the knowledge is situated in different scientific disciplines. Researchers must find common ground to share, and this causes high transaction costs. This paper reports on an experiment with a method of conceptual analysis to elicit, analyse and compare conceptual models used by individual researchers, with the ultimate aim to facilitate researchers in sharing these models. Using an open coding method, we analysed the papers of two researchers from an interdisciplinary research project. The resulting conceptual models were validated in semi-structured interviews. The method was found to be effective in eliciting concepts, also those used implicitly. The interviews also revealed certain mechanisms by which researchers adopt new concepts and choose words for strategic reasons. However, the analysis costs are high, while the benefits remain as of yet uncertain.
Using Tcl to control a computer-participative multimedia programming environment
Authors: Christopher J. Lindblad
Venue: Proceedings of the USENIX 1994 Very High Level Languages Symposium Proceedings on USENIX 1994 Very High Level Languages Symposium Proceedings (1994)

This paper describes how the VuSystem, a programming environment for the development of computer-participative multimedia applications, is controlled through Tcl scripts. In the VuSystem, networks of in-band media-processing modules are created and controlled by interpreted out-of-band Tcl scripts through object commands and callbacks. Tcl's extensibility, simple type system, efficient interface to C, and introspective capabilities are used by the VuSystem to produce a highly dynamic and capable media processing system.
Methods and Tools for Reasoning by Analogy in Intelligent Decision Support Systems
Authors: Alexandr P. Eremeev, Pavel R. Varshavsky
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Development of tools for modeling human reasoning (common sense reasoning) by analogy in intelligent decision support systems is considered. Special attention is drawn to modeling reasoning by structural analogy taking the context into account. This work was supported by RFBR.
Problem-based engineering design and assessment in a digital systems program
Authors: D. Maskell
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Engineering design is being used to better prepare graduates for engineering practice by providing a balance between the theoretical and practical aspects of the engineering degree program. Capstone design courses have become increasingly popular, particularly with engineering educators in North America. However, there is some concern that the skills and experiences derived from design-based courses are occurring much too late in a students education and instead should be spread throughout the degree program. This paper describes a strategy for reaching digital systems which includes the integration of design and theory at all levels in the students' engineering education and which is particularly suitable for the early years of the engineering degree program. Student-based assessment is used in conjunction with open-ended design to develop problem-solving strategies and to encourage students to take more responsibility for their learning. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Distortion in 3D shape estimation with changes in illumination
Authors: Franck Caniard, Roland W. Fleming
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

In many domains it is very important that observers form an accurate percept of 3-dimensional structure from 2-dimensional images of scenes or objects. This is particularly relevant for designers who need to make decisions concerning the refinement of novel objects that haven't been physically built yet. This study presents the results of two experiments whose goal was to test the effect of lighting direction on the shape perception of smooth surfaces using shading and lighting techniques commonly used in modeling and design software. The first experiment consisted of a 2 alternate forced choice task which compared the effect of the amount of shape difference between smooth surfaces lit by a single point light with whether the position of the light sources were the same or different for each surface. Results show that, as the difference between the shapes decreased, participants were more and more biased towards choosing the match shape lit by the same source as the test shape. In the second experiment, participants had to report the orientation at equivalent probe locations on pairs of smooth surfaces presented simultaneously, using gauge figures. The surfaces could either be the same or slightly different and the light source of each shape could either be at the same relative location or offset by 90&deg; horizontally. Participants reported large differences in surface orientation when the lighting condition was different, even when the shapes were the same, confirming the first results. Our findings show that lighting conditions can have a strong effect on 3-dimensional perception, and suggest that great care should be taken when projection systems are used for 3D visualisation where an accurate representation is required, either by carefully choosing lighting conditions or by using more realistic rendering techniques.
Message scheduling in a cluster-based active router for multimedia applications
Authors: Laxmi Bhuyan
Venue:  (2006)

Active network transforms the traditional network from pure packet-level routing to application-level processing by performing several customized computations at different nodes or active routers. We study the operation of Cisco Application Oriented Network (AON) system as a motivating example for our research, which has a backend cluster of processors to carry out the message scheduling and active computation. We provide some experimental results on scheduling various messages on the AON.This thesis concentrates on multimedia transcoding application, which dynamically transforms video streams to different output patterns to satisfy the bit rate and bandwidth requirements of a variety of clients. We build an active router cluster for real MPEG stream transcoding service in our laboratory; and design, implement and evaluate various scheduling algorithms in parallel processing literature for the online transcoding operation. We also propose a few adaptive scheduling algorithms based on online prediction of the processing time for individual task (media unit) without prior information. However, since the transcoding operation is performed by multiple processors in the cluster, it produces out-of-order departure of media units and high jitter. To provide better Quality of Service (QoS) to multimedia applications, we quantitatively define the QoS requirements for each media stream by classifying the streams into different service classes. That leads us to a two-step QoS aware scheduling scheme, which is tested and compared with other algorithms. It is shown that the proposed algorithms outperform the existing algorithms both in terms of performance and satisfying QoS requirements.All the above scheduling algorithms are based on heuristic techniques. Therefore, we develop a mathematical framework for scheduling to achieve zero out-of-order processing based on an existing Divisible Load Theory (DLT) for parallel computing. Several interesting results are presented regarding scalability of our algorithm based on analysis. The assumption in DLT that the workload is perfectly divisible does not really apply to transcoding workload consisting of variable length media units. Hence, we propose a Packetized Dynamic Batch-CoScheduling (P-DBCS) scheme, implement it in our laboratory, and show that the proposed scheduling technique provides better QoS guarantees than other schemes.
Porting a user-level communication architecture to NT: experiences and performance
Authors: Yuqun Chen, Stefanos N. Damianakis, Sanjeev Kumar, Xiang Yu, Kai Li
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

This paper describes our experiences in porting the VMMC user-level communication architecture from Linux to Windows NT. The original Linux implementation required no operating system changes and was done entirely using device drivers and user-level libraries. Porting the Linux implementation to NT was fairly straightforward and required no kernel modifications. Our measurements show that the performance of both platforms is fairly similar for the common data transfer operations because they bypass the OS. But Linux performs better than NT on operations that require OS support.
Lightweight Asymmetric Privacy-Preserving Authentication Protocols Secure against Active Attack
Authors: Yang Cui, Kazukuni Kobara, Kanta Matsuura, Hideki Imai
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

As pervasive computing technologies develop fast, the privacy protection becomes a crucial issue and needs to be coped with very carefully. Typically, it is difficult to efficiently identify and manage plenty of the low-cost pervasive devices like Radio Frequency Identification Devices (RFID), without leaking any privacy information. In particular, the adversary may not only eavesdrop the communication in a passive way, but also mount an active attack to ask queries adaptively, which is obviously more dangerous. Towards settling this problem, in this paper, we propose lightweight authentication protocols which are privacy-preserving against active attack. The protocols are based on a fast asymmetric encryption with novel simplification, which consequently can assign an easy work to pervasive devices. Besides, unlike the usual management of the identities, our approach does not require any synchronization nor exhaustive search in the database, which enjoys great convenience in case of a large-scale system.
On the effectiveness of detecting small delay defects in the slack interval
Authors: Haihua Yan, A. D. Singh
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

A new delay testing scheme that identifies abnormal delays in the slack interval by comparing switching delays in neighboring dies on a wafer has been recently proposed and validated on small experimental circuits. In this paper we evaluate the effectiveness of this new approach through the simulation of injected delay faults in the ISCAS benchmark circuits. The results indicate that the new delay testing approach is orders of magnitude more effective in detecting and diagnosing smaller delay defects that increase circuit path delays by 10-50%. Thus the new methodology can address increasing concerns that failure to detect such small delay faults during test may be the cause of significant unreliability in emerging nanometer technologies.
A Strategy-Based Model for E-Government Planning
Authors: Kolsoom Abbasi Shahkooh, Ali Abdollahi
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

This paper reviews different models in e-government in order to determine important parameters for e-government strategic planning. Lack of appropriate strategies and planning are some of the main challenges in e-government. For developing of e-government in local and national level, appropriate national planning is important. This paper tries to present a strategy based model for e-government planning. A proposed model consists of different dimensions which are Strategy, Finance, data and information, Management,, Legality, Logistics, Human Resource, Technical infrastructure, Security, Technology, Culture and Marketing.