ppxscal/embedding_network huggingface dataset:
Integrating DTN and MANET routing
Authors: Jörg Ott, Dirk Kutscher, Christoph Dwertmann
Venue: Proceedings of the 2006 SIGCOMM workshop on Challenged networks (2006)

Mobile Ad-hoc Network (MANET) routing protocols aim at establishing end-to-end paths between communicating nodes and thus support end-to-end semantics of existing transports and applications. In contrast, DTN-based communication schemes imply asynchronous communication (and thus often require new applications) but achieve better reachability, particularly in sparsely populated environments. In this paper, we suggest a hybrid scheme that combines AODV and DTN-based routing and allows keeping the AODV advantage of maintaining end-to-end semantics whenever possible while, at the same time, also offering DTN-based communication options whenever available---leaving the choice to the application. We present our protocol and system design, particularly including the interaction of AODV and DTN, demonstrate achievable performance gains based upon measurements, and report on initial experiments with our implementation in an emulation environment.
A multiscale approximation algorithm for the cardinality constrained knapsack problem
Authors: George A. Kocur
Venue:  (2006)

I develop a multiscale approximation algorithm for the cardinality constrained knap-sack problem. The algorithm consists of three steps: a rounding and reduction step where a hierarchical representation of the problem data ranging from coarse to fine is generated, a solution step where a coarse solution is computed, and a refinement step where the accuracy of the solution is improved by refining the problem representation. I demonstrate that the algorithm is fully polynomial with a runtime complexity that improves upon the previous best known fully polynomial approximation scheme. Through an extensive computational study, I show that the running times of the algorithm is less than or equal to that of a commercial integer programming package with little loss in solution accuracy. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
fMRI Study of Cognitive Interference Processing in Females with Fragile X Syndrome
Authors: Leanne Tamm, Vinod Menon, Cindy K. Johnston, David R. Hessl, Allan L. Reiss
Venue: Journal of Cognitive Neuroscience (2002)

Females with fragile X syndrome, the most common form of inherited developmental and learning problems, are known to be impaired in executive function. The current study is the first to investigate the performance of females with fragile X on a cognitive interference task utilizing functional magnetic resonance imaging (fMRI). Fourteen females with fragile X and 14 age-matched healthy controls were imaged while they performed a counting Stroop interference task. Compared to controls, females with fragile X appeared to have longer reaction times during the interference condition of the task, and adopted a strategy trading speed for accuracy. Females with fragile X also had a significantly different pattern of activation than controls. Whereas controls showed significant activation in the inferior/middle frontal gyrus and inferior/superior parietal lobe, females with fragile X showed more extensive activation in the anterior region of the prefrontal cortex, and failed to show expected activation in the inferior/superior parietal lobe. Further, between-group analyses revealed that females with fragile X had reduced activation in the left orbitofrontal gyrus, thought to be involved in modulating goal-directed behavior. Females with fragile X also demonstrated a markedly different pattern of deactivation from controls. These findings suggest that deficits in cognitive interference processing during the counting Stroop task observed in females with fragile X may arise from inability to appropriately recruit and modulate lateral prefrontal and parietal resources.
Incremental training of support vector machines using hyperspheres
Authors: Shinya Katagiri, Shigeo Abe
Venue: Pattern Recognition Letters (2006)

In the conventional incremental training of support vector machines, candidates for support vectors tend to be deleted if the separating hyperplane rotates as the training data are added. To solve this problem, in this paper, we propose an incremental training method using one-class support vector machines. First, we generate a hypersphere for each class. Then, we keep data that exist near the boundary of the hypersphere as candidates for support vectors and delete others. By computer simulations for two-class and multiclass benchmark data sets, we show that we can delete data considerably without deteriorating the generalization ability.
Evaluating the performance of supply chain simulations with tradeoffs between mulitple objectives
Authors: Pattita Suwanruji, S. T. Enns
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Simulation is well suited to the development and analysis of supply chain models, since the problems of interest tend to be complex and encompass uncertainty. However, there are typically multiple performance objectives that tend to conflict. A major problem in supply chain studies is that assumptions need to be made about the performance tradeoffs involved. Therefore, the conclusions may not be general. In this paper we develop an approach that allows both delivery performance and inventory levels to be considered over a range of tradeoffs. By developing tradeoff curves and analyzing the area under each we are able to reach conclusions that are more general and can be shown to be statistically valid.
Perception and Planning Architecture for Autonomous Ground Vehicles
Authors: Bob Touchton, Tom Galluzzo, Danny Kent, Carl Crane
Venue: Computer (2006)

By combining smart sensors and traversability grids with a JAUS-based component and messaging architecture, DARPA Grand Challenge finalist Team CIMAR quickly developed a robust autonomous ground vehicle platform with advanced sensing and planning capabilities.
Run-time model checking of interaction and deontic models for multi-agent systems
Authors: Nardine Osman, David Robertson, Christopher Walton
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their BDI logic. The most popular approaches to this in practise have been to model interaction protocols and to model the deontic constraints imposed by individual agents. Both of these approaches are appropriate and necessary but their combination creates the practical problem of ensuring that interaction protocols come into contact with agents that possess compatible deontic constraints. This is essentially an issue of property checking dynamically at run-time. We show how model checking can be applied to this problem.
Evaluation of a Queuing Theory and Systems Modeling Course Based on UML
Authors: Athanasios Perdos, Alexander Chatzigeorgiou, George Stephanides
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper presents how a new teaching method in the way that a queuing theory and systems modeling or simulation course can be done, was evaluated by the teachers and the students that attended the course and answered a questionnaire. This course is based on the use of Unified Modeling Language (UML) as the mean to teach modeling of discrete event systems such as queues and networks and not on Mathematics that sometimes is too difficult for students to understand.
CPM: A UML Profile to Design Cooperative PBL Situations at Didactical Level
Authors: Thierry Nodenot, Pierre Laforcade
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper, we present our research results about a UML-based modeling language dedicated to Problem-Based Learning design. The CPM (Cooperative Problem-Based learning Metamodel) language provides a rich graphical formalism to designers/authors of PBL situations; It covers the instructional design process from initial requirements (and didactical choices) to the detailed design step.
CAA-DRIP: a framework for implementing Coordinated Atomic Actions
Authors: A. Capozucca, N. Guelfi, P. Pelliccione, A. Romanovsky, A. Zorzo
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

This paper presents an implementation framework, called CAA-DRIP, that has been defined to allow a straightforward implementation of dependable distributed applications designed using the Coordinated Atomic Action (CAA) paradigm. CAAs provide a coherent set of concepts adapted to the design of fault tolerant distributed systems that includes: structured transactions, distribution, cooperation, competition, and forward and backward error recovery mechanisms triggered by exceptions. DRIP (Dependable Remote Interacting Processes) is an efficient Java implementation framework, which provides support for implementing "Dependable Multiparty Interactions (DMI)" which includes a general exception handling mechanism. As DMI has a softer exception handling semantics with respect to CAA semantics, a CAA design can be implemented by DRIP. The aim of the CAA-DRIP framework is to provide a set of Java classes that allows programmers to implement only the semantics of CAAs with the same terminology and concepts at the design and implementation levels. The new framework simplifies the implementation phase and at the same time reduces the size of the final system since it requires fewer number of instances for creating a CAA at runtime. Details of these improvements as well as a precise description of the CAAs behaviour in terms of Statecharts, which is used as a reference model to define the CAA-DRIP framework, are presented in this paper.
Collaborative Questioning: A Case of Short Message Services (SMS) for Knowledge Sharing
Authors: Dick Ng'ambi
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Whenever a class is invited to ask questions, it is individual learners who ask and their questions do not often represent the questions of the whole class. The benefit to those present during the questioning session is usually by osmosis. It could be disruptive for several students to interject a question because they want to add to a question asked just before a teacher responds. This paper argues that collaborative questioning, which is a form of group interjection in a question is a useful learning tool. It exploits the ubiquitous SMS texting coupled with the power of the web to create an anonymous collaborative questioning environment. The paper reports on the case study in which students interrogate an academic text and collaboratively ask questions using SMS.
L∞-Stable Approximation of a Solution to Div(Y) = f for f &isin; L^2 in Two Dimensions
Authors: Yvon Maday
Venue: Journal of Scientific Computing (2006)

In this paper, we propose a numerical approach for the derivation of a stable approximation in L $$^\infty$$ -norm of a solution to div(Y) = f for $$f\in L^2$$ in two dimensions. The derivation of this result is based on preliminary stability results in Fourier approximationtheory that are interesting by themselves. Numerical simulation sustain the proof of the theorem.
Integrated approach for optimizing service level and reproduction point under stochastic demand
Authors: Zhao Yong-quan, Fang Shu-fen, Lu Li-bin, Wu Chong
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

An integrated model for studying demand uncertainty in the production-inventory problem is proposed. To realize the integrative decision of service level and reproduction point, the service level of a production-inventory system is defined as the probability of satisfying product demand in each period. Inventory variation in stochastic demand is analyzed, and the average inventory in planning periods is invited into the decision model. The planning output in every period is stochastic variables having the same distributions with the production demands. The approach is demonstrated in case of a Chinese automobile company. Sensitivity analysis shows the significant influence of production cycle and standard deviation on optimal reproduction point and the expected profit.
A Junction Based Segmentation Algorithm for Offline Handwritten Connected Character Segmentation
Authors: U. K. S. Jayarathna, G. E. M. D. C. Bandara
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

A junction based approach for Segmenting and recognizing offline handwritten connected two-digit strings is presented in this paper. Very often even in a printed text, adjacent characters tend to touch or connect. This makes it a problem in performing proper character isolation, hence difficult in segmenting the digit strings in order to recognize its individual characters. We, in our study have developed an algorithm, which provides a solution based on the analysis of the foreground pixel distribution to segment, connected digit string pairs. Each of pixels at the connected character skeleton is used to identify a major feature point called a junction point; a pixel point having three or more neighboring pixels, and possible segmentation paths are defined upon the junction points. In the segmentation stage, the junction based splitting technique decides complete segments of the connected digit strings. Use of fuzzy characteristic values at the merging of the complete segments isolates the major segments (Merged complete segments) from the minor segments. In this work, it was found that the unwanted connection resides within the minor segments of the connected character skeleton. At the character isolation stage, all major segments are combined with each of minor segments to generate set of different connection sketches. In order to recognize individual characters of the connection string, these sketches are formulated into a new input character image, which then can be used as an input for a character recognition system.
Packetizing OCP Transactions in the MANGO Network-on-Chip
Authors: Tobias Bjerregaard, Jens Sparso
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The scaling of CMOS technology causes a widening gap between the performance of on-chip communication and computation. This calls for a communication-centric design flow. The MANGO network-on-chip architecture enables globally asynchronous locally synchronous (GALS) systemon- chip design, while facilitating IP reuse by standard socket access points. Two types of services are available: connection-less best-effort routing and connection-oriented guaranteed service (GS) routing. This paper presents the core-centric programming model for establishing and using GS connections in MANGO. We show how OCP transactions are packetized and transmitted across the shared network, and illustrate how this affects the end-to-end performance. A high predictability of the latency of communication on shared links is shown in a MANGO-based demonstrator system.
Reducing Cache Pollution via Dynamic Data Prefetch Filtering
Authors: Xiaotong Zhuang, Hsien-Hsin S. Lee
Venue: IEEE Transactions on Computers (2007)

In order to bridge the gap of the growing speed disparity between processors and their memory subsystems, aggressive prefetch mechanisms, either hardware-based or compiler-assisted, are employed to hide memory latencies. As the first-level cache gets smaller in deep submicron processor design for fast cache accesses, data cache pollution caused by overly aggressive prefetch mechanisms will become a major performance concern. Ineffective prefetches not only offset the benefits of benign prefetches due to pollution but also throttle bus bandwidth, leading to an overall performance degradation. In this paper, we propose and analyze a number of hardware-based prefetch pollution filtering mechanisms to differentiate good and bad prefetches dynamically based on history information. We designed three prefetch pollution filters organized as a one-level, two-level, or gshare style. In addition, we examine two table indexing schemes: Per-Address (PA) based and Program Counter (PC) based. Our prefetch pollution filters work in tandem with both hardware and software prefetchers. As our analysis shows, the cache pollution filters can reduce the ineffective prefetches by more than 90 percent and alleviate the excessive memory bandwidth induced by them. Also, the performance can be improved by up to 16 percent when our filtering mechanism is incorporated with aggressive prefetch filters as a result of reduced cache pollution and less competition for the limited number of cache ports. In addition, a number of sensitivity studies are performed to provide more understandings of the prefetch pollution filter design.
An interpretable and converging set-membership algorithm
Authors: M. Nayeri, M. S. Liu, J. R. Deller
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Set membership (SM)-based techniques, with least square error overlay, suffer from a trade-off between interpretability and proof of convergence. The authors introduce a modified SM algorithm with 'forgetting' covariance updating in conjunction with minimum volume data selecting strategy. The convergence properties of this algorithm and its resemblance to the stochastic approximation method are discussed.
RMIS: middleware for transparent object-oriented modeling in multi-simulator systems
Authors: Niels A. Lang, Peter H. M. Jacobs, Alexander Verbraeck
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A system of middleware services is proposed to realize transparent Object Oriented (OO) modeling in multi-simulator systems. Shortcomings of Remote Procedure Call schemes in a multi-simulator setting are identified. The use of simulation time synchronization services is suggested instead.The resulting middleware system supports both asynchronous and synchronous interaction. Remote Method Invocation Scheduling (RMIS) is introduced as the main enabling mechanism. Special naming services are introduced to generate required middleware objects. The middleware system is fully transparent to model objects, which may thus remain deployment neutral. Current results and directions for further research are presented.
Fanout-based fault diagnosis for open faults on pass/fail information
Authors: Koji Yamazaki, Yuzo Takamatsu
Venue: Proceedings of the 15th Asian Test Symposium (2006)

With the increasing of circuit density, the importance of locating open faults becomes larger. In recent years, built-in self test (BIST) is widely used to reduce test cost. Therefore, development of efficient fault diagnosis approach under BIST environment is much wanted. In this paper, we propose fanout-based fault diagnosis approach for open faults on pass/fail information. Experimental results for ISCAS'85 and ITC'99 benchmark circuits show that the number of candidate faults becomes less than 2 at most cases by using error path tracing and multiple stuck-at fault simulator.
Co-clustering Documents and Words Using Bipartite Isoperimetric Graph Partitioning
Authors: Manjeet Rege, Ming Dong, Farshad Fotouhi
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

In this paper, we present a novel graph theoretic approach to the problem of document-word co-clustering. In our approach, documents and words are modeled as the two vertices of a bipartite graph. We then propose Isoperimetric Co-clustering Algorithm (ICA) - a new method for partitioning the document-word bipartite graph. ICA requires a simple solution to a sparse system of linear equations instead of the eigenvalue or SVD problem in the popular spectral co-clustering approach. Our extensive experiments performed on publicly available datasets demonstrate the advantages of ICA over spectral approach in terms of the quality, efficiency and stability in partitioning the document-word bipartite graph.
An Efficient Assignment of Transmission Opportunity in QoS Guaranteed Wireless LAN
Authors: Masahiro Yamane, Shigeaki Tagashira, Satoshi Fujita
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

IEEE802.11e standard adopts several important techniques to guarantee the quality of service (QoS) of multimedia communications in wireless LAN. A key technique introduced in the standard is an efficient media access control based on Hybrid Coordination Function (HCF), in which each flow is assigned an appropriate transmission opportunity (TXOP) to satisfy several requirements on the flow such as the delay bound and the communication bandwidth. Although it could provide an efficient tool to guarantee the QoS in wireless LAN, HCF has a serious drawback such that a useless bandwidth assignment frequently occurs, which is primarily due to the limitation of the scheme such that all flows share the same service interval (SI). In this paper, we propose a new scheduling scheme that associates each flow with its own SI according to the hardness of the delay bound. The effect of the scheme is experimentally evaluated by simulation. The result of simulations indicates that the number of admitted flows and the data transmission rate certainly increase by the proposed scheme.
Discrete H/sub /spl infin// filter design with application to speech enhancement
Authors: X. Shen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Discrete H/sub /spl infin// filter design with a linear quadratic (LQ) game approach is presented. The exogenous inputs composed of the "hostile" noise signals and system initial condition are assumed to be finite energy signals with unknown statistics. The design criterion is to minimize the worst possible amplification of the estimation error signal, which is different from the classical minimum variance estimation error criterion for the modified Wiener or Kalman filter design. The approach can show how far the estimation error can be reduced under an existence condition on the solution to a corresponding Riccati equation. The application of the discrete H/sub /spl infin// filter to enhance speech contaminated by additive noise is then investigated. In the H/sub /spl infin// estimation, the noise sources can be arbitrary signals with only the requirement of bounded energy, this estimation is more appropriate in practical speech enhancement.