ppxscal/embedding_network huggingface dataset:
A new paradigm for programming competitions
Authors: James F. Bowring
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

The annual ACM International Collegiate Programming Contest produces a competitive paradigm that is at odds with the pedagogical goals of modern computer science and software engineering degree programs. This paradigm stresses the fast completion of a programming task and evaluates the results solely with black-box testing specified by the judges. In contrast, the pedagogical goals of contemporary college degree programs in computing emphasize the quality of processes inherent in software development and implementation. In 2007, the College of Charleston student chapter of the ACM hosted its annual high school programming competition by turning the conventional programming paradigm on its head to focus on quality-of-process rather than time-to-complete. The judging criteria included both technical and artistic merit. The implementation of the competition emphasized success by giving students working skeleton solution programs. This paper presents the motivation for the new paradigm, the details of its implementation for the 2007 competition, and the details of the new techniques for judging technical and artistic merit.
Involutive Brouwerian D-algebras
Authors: Mircea Sularia
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

We introduced the structure of Brouwerian D-algebra in order to obtain the algebraic counterpart of a logic of problem solving. A Brouwerian D-algebra is defined by a subdirect product of a couple of algebras associated with a Heyting lattice and a Brouwer lattice. Then in this paper we introduce the notion of involutive Brouwerian D-algebra having as models direct products between the lattice of open sets and the lattice of closed sets of a topological space. Different properties including basic distributivity equations for complete Brouwerian D-algebras are presented. An extension of the real graded membership space for fuzzy sets is obtained. A connection with the notion of prelinear Heyting MV-algebra is also established.
A platform for dynamic microcell redeployment in massively multiplayer online games
Authors: Bruno Van Den Bossche, Tom Verdickt, Bart De Vleeschauwer, Stein Desmet, Stijn De Mulder, Filip De Turck, Bart Dhoedt, Piet Demeester
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

As Massively Multiplayer Online Games enjoy a huge popularity and are played by tens of thousands of players simultaneously, an efficient software architecture is needed to cope with the dynamically changing loads at the server side. In this paper we discuss a novel way to support this kind of application by dividing the virtual world into several parts, called microcells. Every server is assigned a number of microcells and by dynamically redeploying these microcells when the load in a region of the world suddenly increases, the platform is able to adapt to changing load distributions. The software architecture for this system is described and we also provide some evaluation results that indicate the performance of our platform.
Development of a novel protective cover for micro manipulation process in the SEM chamber
Authors: Al. Cvetanovic, An. Cvetanovic, D. Andrijasevic, I. Giouroudi, W. Brenner
Venue: Microsystem Technologies (2008)

This paper presents a novel approach to assembly of micro components in a scanning electron microscope (SEM) chamber. A new set, called Protective Cover for micro components allows their quick positioning on the platform inside the SEM chamber without gluing. It is well known that the vacuum pumps, especially turbo one, which evacuated a SEM chamber, are highly sensitive to foreign object damage. This is the reason why the micro components are glued on the specimen holder in the SEM chamber. On the other hand, the grippers that have to pick, lift and place the micro components in a desired system (position, orientation) are very fragile. They can not overcome the adhesive force of the glue and remove the particle from the specimen holder. The presented system is standardized and can be mounted without additional time, modification or expenses into the SEM chamber. It enables, on the one hand, easier manipulation of the micro components that do not need to be glued on the specimen holder and, on the other hand, introduces further automation in the manipulation process in the SEM chamber since it creates thus a necessary basis for modular assembling system. Furthermore, it is very important for the automated assembly process that the micro components are exactly positioned. The standardization in the micro world becomes more and more essential. The uniformity of parts, operations and tools strongly supports an automatic assembly system.
Analysis of Algorithms, 2 edition
Authors: Jeffrey J. McConnell
Venue:  (2007)

Updated to follow the recommendations put forth by the ACM/SIGCSE 2001 task force, Analysis of Algorithms, Second Edition raises awareness of the effects that algorithms have on the efficiency of a program and develops the necessary skills to analyze general algorithms used in programs. The text presents the material with the expectation that it can be used with active and cooperative learning methodology, based on the premise that students learn more effectively and retain more information longer when they are active participants in the learning process. To accomplish this, the chapters are clear and complete to encourage students to prepare by reading before class, and the text is filled with exciting examples and exercises that look at the efficiency of various algorithms to solve a problem. The author is well known for workshops that he presents on the active learning model. He has written an instructor's manual that helps instructors understand how to present the material in an "active" way.
Transformation from CIM to PIM Using Patterns and Archetypes
Authors: Samir Kherraf, Éric Lefebvre, Witold Suryn
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Model transformations form a key part of MDA (Model-Driven Architecture). Most of the studies deal with the transformations from PIM (Platform-Independent Model) to PSM (Platform-Specific Model) and PSM to Code, but very few deal with the transformation from CIM (Computation-Independent Model) to PIM. This last transformation usually depends on business analysts’ and software architects’ experience and creativity. This paper proposes a disciplined approach to transform a CIM into a PIM. It first uses UML2 activity diagrams to model the business processes up to the users’ tasks. The activity diagrams are then detailed to specify the system requirements. The system components are directly deduced from the requirement model elements. Finally, a set of business archetypes helps detail the system components to yield the PIM. The same approach applies equally to CIM and PIM built to model inter-enterprise processes and systems. A case study illustrates our approach. It demonstrates how it reinforces the components traceability and reusability and how it globally improves the modeler’s efficiency. Furthermore, the use of the activity diagrams, as a single technique to build business process and requirement models, is an important facilitator which prepares our further work to automate this approach.
Active Contour Model based on Dynamic Extern Force and Gradient Vector Flow
Authors: Hongguang Fu, Rongqiu Wu, Weimin Wang, Junhua Yang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Active contour model, or snakes, are used extensively in digital image processing, particularly to locate object boundary, the model include geometric and parametric active models. Problems associated with initialization and convergence restrict their utility, which have been solved by Xu, who proposed Gradient Vector Flow. However, parametric active models still face the problem that the whole curve may evolve into only a side of the true boundary. This paper presents a new approach based on the parametric active models with Generalized Gradient Vector Flow(GGVF) and Dynamic Extern Force, which decreases when iterative number increases and thus makes terminal contour less dependent on the initial curve and it can speed up the iterate process. The image edge and the field that point to round from center decide the initial extern force, which can prevent curve evolution from possible wrong segmentation. The tongue edge can be detected faster and more accurately than ever in the tongue image experiments.
Investigating solution convergence in a global ocean model using a 2048-processor cluster of distributed shared memory machines
Authors: Chris Hill, Dimitris Menemenlis, Bob Ciotti, Chris Henze
Venue: Scientific Programming (2007)

Up to 1920 processors of a cluster of distributed shared memory machines at the NASA Ames Research Center are being used to simulate ocean circulation globally at horizontal resolutions of 1/4, 1/8, and 1/16-degree with the Massachusetts Institute of Technology General Circulation Model, a finite volume code that can scale to large numbers of processors. The study aims to understand physical processes responsible for skill improvements as resolution is increased and to gain insight into what resolution is sufficient for particular purposes. This paper focuses on the computational aspects of reaching the technical objective of efficiently performing these global eddy-resolving ocean simulations. At 1/16-degree resolution the model grid contains 1.2 billion cells. At this resolution it is possible to simulate approximately one month of ocean dynamics in about 17 hours of wallclock time with a model timestep of two minutes on a cluster of four 512-way NUMA Altix systems. The Altix systems' large main memory and I/O subsystems allow computation and disk storage of rich sets of diagnostics during each integration, supporting the scientific objective to develop a better understanding of global ocean circulation model solution convergence as model resolution is increased.
Generation of heterogeneous distributed architectures for memory-intensive applications through high-level synthesis
Authors: Chao Huang, Srivaths Ravi, Anand Raghunathan, Niraj K. Jha
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Memory-intensive applications present unique chal lenges to an application-specific integrated circuit (ASIC) designer in terms of the choice of memory organization, memory size requirements, bandwidth and access latencies, etc. The high potential of single-chip distributed logic-memory architectures in addressing many of these issues has been recognized in general-purpose computing, and more recently, in ASIC design. The high-level synthesis (HLS) techniques presented in this paper are motivated by the fact that many memory-intensive applications exhibit irregular array data access patterns. Synthesis should therefore, be capable of determining a partitioned architecture wherein array data and computations may have to be heterogeaeously distributed for achieving the best performance speed-up We use a combination of clustering and min-cut style partitioning Lechniques to yield distributed architectures, based on simulation profiling while considering various factors including data access, locality, balanced workloads, inter-partition communication, etc. Our experiments with several benchmark applications show that the proposed techniques yielded two-way partitioned architectures that can achieve upto 2.1 × (average of 1.9 ×) performance speed-up over conventional HLS solutions, while achieving upto 1.5× (average of 1.4×) performance speed-up over the best homogeneous partitioning solution feasible. At the same time the reduction in the energy-delay product over conventional single-memory designs is upto 2.7× (average of 2.0 ×). A large amount of partitioning makes further system performance improvement achievable at the cost of chip area.
Standardized TTCN-3 specifications for SIP-ISUP/ISDN interworking testing
Authors: Michael Gl&#x00e4;ser, Sebastian M&#x00fc;ller, Axel Rennoch, Peter Schmitting
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2008)

ETSI technical committee TISPAN currently funds the development of TTCN-3 network integration test suites using TTCN-3. Specialist task forces (STF) have already been initiated to implement and validate abstract test suites focusing on, e.g., SIP/ISUP and SIP/ISDN interworking units. In this paper, we report on our implementation approach and experiences made in the STF on testing interworking between SIP and ISDN/ISUP. Special attention has been given to the reuse of know-how and of existing TTCN-3 code available due to the existing SIP conformance test suite and the TTCN-3 test framework developed by ETSI for IPv6. Validation has been done using the test laboratory of a telecom network provider.
Computational complexity of numerical solutions of initial value problems for differential algebraic equations (abstract only)
Authors: Silvana Ilie
Venue: ACM Communications in Computer Algebra (2008)

We investigate the cost of solving initial value problems for differential algebraic equations depending on the number of digits of accuracy requested. A recent result showed that the cost of solving initial value problems (IVP) for ordinary differential equations (ODE) is polynomial in the number of digits of accuracy. This improves on the classical result of information-based complexity, which predicts exponential cost. The new theory is based on more realistic assumptions. The algorithm analyzed in this thesis is based on a previously published Taylor series method for solving a general class of differential algebraic equations. We consider DAE of constant index to which the method applies. The DAE is allowed to be of arbitrary index, fully implicit and have derivatives of order higher than one. Similarly, by considering a realistic model, we show that the cost of computing the solution of IVP for DAE with the algorithm adopted and by using automatic differentiation is polynomial in the number of digits of accuracy. We also show that non-adaptation is more expensive than adaptation, giving thus a theoretical justification of the success of adaptivity in practice. A particular case frequently arising in practical applications, the index-1 DAE, is treated separately, in more depth. On the other hand, an analysis of the higher-index DAE is significantly more complicated and applies to a wider class of problems. In both cases, continuous output is also given. These results apply to many important problems arising in practice. We present an interesting theoretical application to polynomial system solving.
Is the power of web search diminishing?
Authors: Win Treese
Venue: netWorker (2008)

Back in the early days of the World Wide Web, many sites tried to organize the information that was starting to be available on the Internet. At the time, most were taking a "naive library" approach. That is, they were attempting to collect websites and Web pages into categories and sub-categories---an Internet hierarchy of information.
A novel and practicable on-chip adaptive lossless image compression scheme using intrinsic evolvable hardware
Authors: Jingsong He, Xin Yao, Yunbi Chen
Venue: Connection Science (2007)

Adaptive lossless image compression is one of the most important applications in the field of evolvable hardware (EHW). However, related studies in the past focused on implementations with extrinsic EHW, which uses a host computer to run software simulation and compiling, and then download the final circuit to the silicon chip. This is not suitable for tasks of on-chip adaptation. This paper presents a novel technique to reformulate the problem as a task of evolving a set of switches. As a result, the whole scheme can be implemented easily using intrinsic EHW. In order to enhance the scalability of the whole scheme, a strategy based on data-decomposition and pyramidal fitness evaluation strategy is developed for evolving larger scale images. Software simulation shows that the proposed method can largely reduce the computation time, and can scale up the image size up to 70 times with relatively slow increase in computation time. Hardware simulation shows that the method can be applied in practice.
Flow Loss Characteristics in the Presence of Correlated Background Traffic
Authors: Dieter Fiems, Stijn De Vuyst, Herwig Bruneel
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Packet loss in wired communication networks is almost entirely caused by buffer overflow in intermediate network nodes. Although the packet loss ratio at a (bottleneck) buffer is an important performance measure, it is often an insufficient measure to accurately assess the impact of loss on overall network performance. This contribution therefore focuses on various flow level packet loss characteristics of a network node. The network node is modelled as a quasi-birth-death finite-capacity queueing system such that various levels of arrival correlation can be captured while maintaining analytical tractability. Some numerical examples illustrate the approach considered.
Implementation of unsteady sampling procedures for the parallel direct simulation Monte Carlo method
Authors: H. M. Cave, K. -C. Tseng, J. -S. Wu, M. C. Jermy, J. -C. Huang, S. P. Krumdieck
Venue: Journal of Computational Physics (2008)

An unsteady sampling routine for a general parallel direct simulation Monte Carlo method called PDSC is introduced, allowing the simulation of time-dependent flow problems in the near continuum range. A post-processing procedure called DSMC rapid ensemble averaging method (DREAM) is developed to improve the statistical scatter in the results while minimising both memory and simulation time. This method builds an ensemble average of repeated runs over small number of sampling intervals prior to the sampling point of interest by restarting the flow using either a Maxwellian distribution based on macroscopic properties for near equilibrium flows (DREAM-I) or output instantaneous particle data obtained by the original unsteady sampling of PDSC for strongly non-equilibrium flows (DREAM-II). The method is validated by simulating shock tube flow and the development of simple Couette flow. Unsteady PDSC is found to accurately predict the flow field in both cases with significantly reduced run-times over single processor code and DREAM greatly reduces the statistical scatter in the results while maintaining accurate particle velocity distributions. Simulations are then conducted of two applications involving the interaction of shocks over wedges. The results of these simulations are compared to experimental data and simulations from the literature where there these are available. In general, it was found that 10 ensembled runs of DREAM processing could reduce the statistical uncertainty in the raw PDSC data by 2.5-3.3 times, based on the limited number of cases in the present study.
Harnessing Theories for Tool Support
Authors: Zhiming Liu, Vladimir Mencl, Anders P. Ravn, Lu Yang
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Software development tools need to support more and more phases of the entire development process, because applications must be developed more correctly and efficiently. The tools therefore need to integrate sophisticated checkers, generators and transformations. A feasible approach to ensure high quality of such add-ins is to base them on sound formal foundations. In order to know where such add-ins will fit, we investigate the use of an existing successful commercial tool and identify suitable places for adding formally supported checking, transformation and generation modules. The paper concludes with a discussion of feasibility of developing the proposed add-ins and how to give conditions such that they will actually be used.
Conservation of energy, momentum and actions in numerical discretizations of non-linear wave equations
Authors: David Cohen, Ernst Hairer, Christian Lubich
Venue: Numerische Mathematik (2008)

For classes of symplectic and symmetric time-stepping methods&#x2014; trigonometric integrators and the St&#x00f6;rmer&#x2013;Verlet or leapfrog method&#x2014;applied to spectral semi-discretizations of semilinear wave equations in a weakly non-linear setting, it is shown that energy, momentum, and all harmonic actions are approximately preserved over long times. For the case of interest where the CFL number is not a small parameter, such results are outside the reach of standard backward error analysis. Here, they are instead obtained via a modulated Fourier expansion in time.
Research of Multi-Path Routing Protocol Based on Parallel Ant Colony Algorithm Optimization in Mobile Ad Hoc Networks
Authors: Chengyong Liu, Layuan Li, Yang Xiang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In the research of routing protocol in the ad hoc networks, single path routing protocol, known as Ad hoc On-demand Distance Vector, has attracted the attention of scholars. At present ants-based routing algorithms have been widely studied because they are suitable for mobile ad-hoc networks where nodes move dynamically and topology changes frequently. Study shows when the number of nodes increases, however, the number of ants (control messages) also increases, which means poor scalability. The proposed routing protocol in this paper applies the parallel ant colony algorithm to establish multi-path routing between source node and destination node, and it improves the packet delivery performance greatly. We also describe the strategy of information exchange and the refresh rules of pheromone in the parallel ACO. In simulation experiments of NS 2.28 the proposed protocol reduces route discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. Meanwhile the parallel ACO can improve the probability of rout discovery and the speed of constringency is obviously increased in ad hoc networks.