ppxscal/embedding_network huggingface dataset:
FastDer++, efficient automatic differentiation for non-linear PDE solvers
Authors: E. Tijskens, D. Roose, H. Ramon, J. De Baerdemaeker
Venue: Mathematics and Computers in Simulation (2004)

FastDer++ is a C++ class library for automatic differentiation designed for use in situations where a set of dependent variables and their gradients are to be evaluated in a large number of points. Typical settings constitute non-linear systems of partial differential equations (PDEs) and ODEs. Although automatic differentiation is traditionally considered to slow for implementation in non-linear PDE and ODE solvers, it has recently been demonstrated [E. Tijskens, H. Ramon, J. De Baerdemaeker, Efficient operator overloading AD for solving non-linear PDEs, in: G. Corliss, C. Faure, A. Griewank, L. Hascoët, U. Nauman (Eds.), Automatic Differentiation of Algorithms--From Simulation to Optimisation, Springer, Verlag, 2002; Num. Algorithms 30 (2002) 259] that thanks to an extension called vectorised AD and careful design handcoded derivatives, finite differencing and state of the art AD tools can be outperformed in common situations. In addition, the user gains the advantage of directly dealing with the non-linear equations rather than with its linearised counterpart. This paper describes the FastDer++ library and its underlying principles in detail, both from the point of implementation and of user programming.
Modeling integrated CAPP/PPS systems
Authors: Liu Min, Bai Li, Zhang Shensheng
Venue: Computers and Industrial Engineering (2004)

In order to solve the isolation and the unilateral sequence integration between CAPP and PPS, this paper proposes the integrated system of CAPP and PPS based on distributed and dynamic process planning (ICAPPS), aiming for single-piece, small-lot and made-to-order production (SPSLMOP), and then systematically builds the integrated ICAPPS model. On the basis of the integrated model, this paper constructs the function model of ICAPPS, which includes the designing layer, the part planning layer, the shop planning layer and the scheduling layer in detail, according to the requirement for the rationalization of resource utilization, process design and plan scheduling in SPSLMOP.
Using Poxels for Reproducing Traditional Pierced Byzantine Jewellery
Authors: Vasiliki Stamati, Ioannis Fudos, Sofia Theodoridou, Christina Edipidi, Dimitris Avramidis
Venue: Proceedings of the Computer Graphics International (2004)

We present ByzantineCAD, a feature-based parametricCAD system for designing pierced Byzantine jewellery.ByzantineCAD is an automated system where jewellery isdesigned according to the values of parameters and constraintsthat are determined by the end-user. In this paper,we introduce an approach to reproducing traditionalpierced Byzantine jewellery using pierced voxels ("poxels").Poxels are voxels with specific attributes and propertiesthat are appropriately combined to create large complexpierced designs. We also present a scaling algorithmfor enlarging pierced designs without altering the size of thepoxels used to construct them and an algorithm for engravingarbitrary images in pierced jewellery.
On the effectiveness of flow aggregation in improving instruction reuse in network processing applications
Authors: G. Surendra, S. Banerjee, S. K. Nandy
Venue: International Journal of Parallel Programming (2003)

Instruction Reuse is a microarchitectural technique that exploits dynamic instruction repetition to remove redundant computations at run-time. In this paper we examine instruction reuse of integer ALU and load instructions in network processing applications and attempt to answer the following questions: (1) How much of instruction repetition can be reused in packet processing applications?, (2) Can the temporal locality of network traffic be exploited to reduce interference in the Reuse Buffer and improve reuse? and (3) What is the effect of reuse on microarchitectural features such as resource contention and memory accesses? We use an execution driven simulation methodology to evaluate instruction reuse and find that for the benchmarks considered, 1 to 50% of the dynamic instructions are reused yielding performance improvement between 1 and 20%. To further improve reuse, a flow aggregation scheme as well as an architecture for exploiting the same is proposed. This scheme is mostly applicable to header processing applications and exploits temporal locality in packet data to uncover higher reuse. As a side effect, instruction reuse reduces memory traffic and improves performance.
Seamless channel transition for the staircase video broadcasting scheme
Authors: Yu-Chee Tseng, Yu-Chi Chueh, Jang-Ping Sheu
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

In the literature, many broadcasting-based schemes have been proposed to efficiently support near-VOD services. However, none of these schemes allows the server to dynamically and seamlessly change the number of channels allocated to a video. Naively allocating a new set of channels for the transition could increase server's load, waste communication bandwidth, and even drain the channels of the system. In Tseng et al. (2000), it is shown how to enhance the Fast Broadcasting (FB) scheme for seamless channel transition. The problem remains open whether other broadcasting-based schemes can sustain seamless channel transition. In this paper, we show how to enhance the Staircase Broadcasting (SB) scheme so that a server can seamlessly increase or decrease the channels allocated to a video. The SB scheme has been proved to require significantly less buffering space than FB, while sustaining the same startup latency as FB. Detailed performance comparisons are presented to demonstrate the advantages of the proposed scheme.
WebROBOT: internet based robotic assembly planning system
Authors: V. B. Sunil, S. S. Pande
Venue: Computers in Industry (2004)

WebROBOT is an Internet based assembly planning system for intelligent task level programming of assembly robots. Developed as the client-server architecture, WebROBOT typically enables the client to graphically synthesise and model the world, specify assembly tasks, enable automated task/motion planning, generate robot control program and transfer it to the remote robot site through server. Clients can communicate with the robot administrator through chat to set up and execute the robot program in the real assembly world. The design and implementation issues of WebROBOT are presented at length in this paper.
Transactional Memory Coherence and Consistency
Authors: Lance Hammond, Vicky Wong, Mike Chen, Brian D. Carlstrom, John D. Davis, Ben Hertzberg, Manohar K. Prabhu, Honggo Wijaya, Christos Kozyrakis, Kunle Olukotun
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

In this paper, we propos a new shared memory model: Transactionalmemory Coherence and Consistency (TCC).TCC providesa model in which atomic transactions are always the basicunit of parallel work, communication, memory coherence, andmemory reference consistency.TCC greatly simplifies parallelsoftware by eliminating the need for synchronization using conventionallocks and semaphores, along with their complexities.TCC hardware must combine all writes from each transaction regionin a program into a single packet and broadcast this packetto the permanent shared memory state atomically as a large block.This simplifies the coherence hardware because it reduces theneed for small, low-latency messages and completely eliminatesthe need for conventional snoopy cache coherence protocols, asmultiple speculatively written versions of a cache line may safelycoexist within the system.Meanwhile, automatic, hardware-controlledrollback of speculative transactions resolves any correctnessviolations that may occur when several processors attemptto read and write the same data simultaneously.The cost of thissimplified scheme is higher interprocessor bandwidth.To explore the costs and benefits of TCC, we study the characterisitcsof an optimal transaction-based memory system, and examinehow different design parameters could affect the performanceof real systems.Across a spectrum of applications, the TCC modelitself did not limit available parallelism.Most applications areeasily divided into transactions requiring only small write buffers,on the order of 4-8 KB.The broadcast requirements of TCCare high, but are well within the capabilities of CMPs and small-scaleSMPs with high-speed interconnects.
MISSION: An Agent-Based System for Semantic Integration of Heterogeneous Distributed Statistical Information Sources
Authors: Sally McClean, Bryan Scotney, Hans Rutjes, Jannes Hartkamp, Isambo Karali, Mike Hatzopoulos, Joanne Lamb, Defeng Ma
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

The MISSION system utilises query agents, inparticular the matching and negotiation agents that areresponsible for pre-integration where the matching agentdecomposes the query into sub-queries, and then searchesmetadata to find datasets that match the query fragments.Such an approach provides a capability of automating theprocess of executing queries on heterogeneous statisticaldatabases that are distributed over the Internet. Thenovelty lies in the provision of automated methods forstatistical aggregation, where the heterogeneityessentially resides in the classification schemes ofcategorical data, including both heterogeneity ofnomenclature and heterogeneity of granularity. Inaddition, our solution permits queries to be specified in agoal-driven query-by-example format. Rather than imposean a priori global standard, the user can query through aunified interface where integration is done at run-time.
Natural language processing for browse help
Authors: Eric Crestan, Claude de Loupy
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this paper, we will present three "browsing" systems that should save user's time. The first uses named entities and gives a way to reduce search space. By using a information visualization system, the user can comprehend more easily the content of a corpus or a document. Named entities are highlighted for quick reading, temporal and geographic representation gives a global view of the result of a query. All these browse and search helps seem to be very useful. Nevertheless, an evaluation would give more practical results.
Enabling Social Dimensions of Learning through a Persistent, Unified, Massively Multi-User, and Self-Organizing Virtual Environment
Authors: Julian Lombardi, Mark P. McCahill
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

Existing online learning experiences lack the socialdimension that characterizes learning in the realworld. This social dimension extends beyond thetraditional classroom into the universityýs commonareas where learners build knowledge andunderstanding through serendipitous andcollaborative exchanges both within and acrosstraditional subject area boundaries. A next generationVirtual Learning Environment (VLE) can address thelimitations of current online systems by providing aricher social context for online learning. We describethe end-user properties of a highly-scalable self-organizingCroquet-based VLE that fosters dynamicgroup learning experiences and the development ofcommunities of practice. This proposed VLE providesthe capacity to merge the institutional infrastructurefor academic computing, enterprise-level networks,Squeak/Croquet-based content authoring, and theeducational principles of constructivist pedagogy.
Hardware Reconfiguration Scheme for High Availability Systems
Authors: C. Metra, A. Ferrari, M. Omana, A. Pagni
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

We propose a hardware reconfiguration scheme that,together with the adoption of an on-line testing strategy,can be employed to meet the goal of designing highlyavailable systems to be implemented by means of very deepsub-micron technology. Compared to alternate softwarereconfiguration schemes frequently employed for highreliability systems, that proposed here allows to minimizethe reconfiguration impact on systemýs performance, thusbeing suitable to applications with strong constraints interms of performance and availability. Our schemefeatures self-checking ability with respect to its possibleinternal faults, thus guaranteeing that no erroneousreconfiguration can occur, because of faults affecting thereconfiguration hardware itself.
Creating Mixed Reality Content: Problems, Concepts and Solutions
Authors: Daniel F. Abawi, Ralf Dorner
Venue: Proceedings of the Computer Graphics International (2004)

Efficient creation of high-quality mixed reality content is challenging today due to a variety of difficult problems not only on a technological level, but also on an author role level, production process level and testing level. In this paper, we propose a concept that takes a significant step towards solving these problems on all different levels simultaneously. Our concept combines component and framework-based approaches with the idea of providing a dedicated authoring environment in mixed reality. The concept serves as a basis for novel authoring metaphors and production processes that can be supported by specific authoring tools. Besides the concepts, the paper also deals with implementation aspects and gives an illustration in the context of communicating cultural heritage.
Deriving tabular event-based specifications from goal-oriented requirements models
Authors: Renaud De Landtsheer, Emmanuel Letier, Axel van&#x00a0;Lamsweerde
Venue: Requirements Engineering (2004)

Goal-oriented methods are increasingly popular for elaborating software requirements. They offer systematic support for incrementally building intentional, structural and operational models of the software and its environment. They also provide various techniques for early analysis, notably, to manage conflicting goals or to anticipate abnormal environment behaviours that prevent goals from being achieved. On the other hand, tabular event-based methods are well-established for specifying operational requirements for control software. They provide sophisticated techniques and tools for late analysis of software behaviour models through simulation, model checking or table exhaustiveness checks. The paper proposes to take the best out of these two worlds to engineer requirements for control software. It presents a technique for deriving event-based specifications, written in the SCR tabular language, from operational specifications built according to the KAOS goal-oriented method. The technique consists of a series of transformation steps each of which resolves semantic, structural or syntactic differences between the KAOS source language and the SCR target language. Some of these steps need human intervention and illustrate the kind of semantic subtleties that need to be taken into account when integrating multiple formalisms. As a result of our technique SCR specifiers may use upstream goal-based processes &#x00e0; la KAOS for the incremental elaboration, early analysis, organization and documentation of their tables, while KAOS modelers may use downstream tables &#x00e0; la SCR for later analysis of the behaviour models derived from goal specifications.
Access Control Method with Variable Retransmission Probability in Ad-Hoc networks and Its consideration of the Changing Point
Authors: Yosuke Nakamura, Xuejun Tian, Tetsuo Ideguchi, Takashi Okuda
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Ad-Hoc networks do not need infrastructures such as a base station and it is an interested technology. One of the important subjects of Ad-Hoc networks is an access control method in radio media. A control channel is usually used with a method of TDMA base. A big influence is given to a performance of Ad-Hoc networks when a frequency channel zone is used as a method of TDMA base. We have already proposed the access control method that is called the Two Division Back off Algorithm (TDBA). This algorithm can solve collisions with a few overheads. But, this method has the problem that the success probability which a node acquires a channel decreases, when the number of the collision-nodes increases. This paper introduces a variable retransmission probability instead of a fixed retransmission probability. And the characteristic of performances is compared and evaluated. Then, as for the point as well that value is made to change, it is examined.
Context sensitive vocabulary and its application in protein secondary structure prediction
Authors: Yan Liu, Jaime Carbonell, Judith Klein-Seetharaman, Vanathi Gopalakrishnan
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Protein secondary structure prediction is an important step towards understanding the relation between protein sequence and structure. However, most current prediction methods use features difficult for biologists to interpret. In this paper, we present a new method that applies information retrieval techniques to solve the problem:we extract a context sensitive biological vocabulary for protein sequences and apply text classification methods to predict protein secondary structure. Experimental results show that our method performs comparably to the state-of-art methods. Furthermore, the context sensitive vocabularies can serve as a useful tool to discover meaningful regular expression patterns for protein structures.
Interactive Retrieval of 3D Virtual Shapes using Physical Objects
Authors: Hiroyasu Ichida, Yuichi Itoh, Yoshifumi Kitamura, Fumio Kishino
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

We present a novel method for interactive retrieval ofvirtual 3D shapes using physical objects. Our method isbased on simple physical 3D interaction with a set oftangible blocks. As the user connects blocks, the systemautomatically recognizes the shape of the constructedphysical structure and picks similar 3D virtual shapesfrom a preset model database, in real time. Our systemfully supports interactive retrieval of 3D virtual models inan extremely simple fashion, which is completely non-verbaland cross-cultural. These advantages make it anideal interface for inexperienced users, previously barredfrom many applications that include 3D shape retrieval tasks.
Corpus consultation and advanced learners&rsquo; writing skills in French
Authors: Angela Chambers, Íde O'Sullivan
Venue: ReCALL (2004)

In the rapidly changing environment of language learning and teaching, electronic literacies have an increasingly important role to play. While much research on new literacies focuses on the World Wide Web, the aim in this study is to investigate the importance of corpus consultation as a new type of literacy which is of particular relevance in the context of language learning and teaching. After briefly situating the theoretical and pedagogical context of the study in relation to authenticity and learner autonomy, the paper describes an empirical study involving eight postgraduate students of French. As part of a Masters course they write a short text and subsequently attempt to improve it by using concordancing software to consult a small corpus containing texts on a similar subject. The analysis of the results reveals a significant number of changes made by the learners which may be classified as follows in order of frequency: grammatical errors (gender and agreement, prepositions, verb forms/mood, negation and syntax); misspellings, accents and hyphens; lexico-grammatical patterning (native language interference, choice of verb and inappropriate vocabulary); and capitalisation. The conclusion notes that the situation in which these students found themselves (i.e. faced with a text on which the teacher had indicated phrases which could be improved) is replicated in many cases every day, and suggests that corpus consultation may have a useful role to play in the context of interactive feedback, particularly in cases where traditional language learning resources are of little use.
A Proposed Physical Based Multilayered Illumination Model
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

This paper introduces a model for the illuminationof multilayered surfaces. The model enables thesimulation of numerous optical characteristics basedupon the physics of light, such as thin film interferencethat occurs between layers. The technique can alsoaccount for spatial distribution, scattering anddiffraction characteristics associated with subsurfaceparticles.
FigSearch: Using Maximum Entropy Classifier to Categorize Biological Figures
Authors: Fang Liu, Tor-Kristian Jenssen, Vegard Nygaard, John Sack, Eivind Hovig
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Figures in scientific papers represent an intuitive and concise way of knowledge presentation. With more attention being paid on full-text mining in bioinformatics, we initiated an effort of studying figures in full articles. FigSearch is a prototype figure legend indexing and classification system, using both text-mining and supervised machine learning. We defined schematic representations of protein interactions and signaling events as an interesting figure type. A maximum entropy classifier was used in categorizing each figure, by assigning an estimated likelihood, as being relevant/non-relevant according to our definition. One advantage of the maximum entropy principle is that it provides a probability of decision, instead of a binary assignment. In our pilot study, FigSearch showed satisfactory performance in a preliminary validation by domain experts. Such a system can be useful in applications such as for a publisherýs website, in bio-picture gallery constructions, or as an aid for other complicated text-mining projects.
Dependence language model for information retrieval
Authors: Jianfeng Gao, Jian-Yun Nie, Guangyuan Wu, Guihong Cao
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This paper presents a new dependence language modeling approach to information retrieval. The approach extends the basic language modeling approach based on unigram by relaxing the independence assumption. We integrate the linkage of a query as a hidden variable, which expresses the term dependencies within the query as an acyclic, planar, undirected graph. We then assume that a query is generated from a document in two stages: the linkage is generated first, and then each term is generated in turn depending on other related terms according to the linkage. We also present a smoothing method for model parameter estimation and an approach to learning the linkage of a sentence in an unsupervised manner. The new approach is compared to the classical probabilistic retrieval model and the previously proposed language models with and without taking into account term dependencies. Results show that our model achieves substantial and significant improvements on TREC collections.
Smarandache zero divisors
Authors: W. B. Vasantha Kandasamy
Venue: Smarandache Notions Journal (2004)

In this paper, we study the notion of Smarandache zero divisor in semigroups and rings. We illustrate them with examples and prove some interesting results about them.