ppxscal/embedding_network huggingface dataset:
Simulation analysis of inbound call center of a city-gas company
Authors: Soemon Takakuwa, Takako Okada
Venue: Proceedings of the 37th conference on Winter simulation (2005)

An inbound call center of a city-gas company was simulated to examine the proper target of the service level procedures were proposed to find the optimal number of agents, considering their skills and the scheduling of the agents to meet the frequency of customer calls. First, integer programming was adopted to obtain an initial feasible solution. Second, a special-purpose system was designed and developed to modify planned recesses for each agent. Then, optimal solutions were obtained by performing simulation together with direct-search methods. The proposed procedure was applied to a real case in order to confirm its effectiveness.
Convergence of an Implicit Finite Element Method for the Landau--Lifshitz--Gilbert Equation
Authors: Sören Bartels, Andreas Prohl
Venue: SIAM Journal on Numerical Analysis (2006)

The Landau--Lifshitz--Gilbert equation describes the dynamics of ferromagnetism, where strong nonlinearity and nonconvexity are hard to tackle: so far, existing explicit schemes to approximate weak solutions suffer from severe time-step restrictions. In this paper, we propose an implicit fully discrete scheme and verify unconditional convergence.
Scamseek: a language technology project fulfilling research objectives with industrial obligations
Authors: Jon Patrick
Venue: Proceedings of the 2005 South East Asia Regional Computer Science Confederation (SEARCC) Conference - Volume 46 (2005)

The Scamseek project, as commissioned by the Australian Securities & Investment Commission (ASIC), had the principal objective of building an industrially viable system that retrieves scam candidate texts from the Internet and classifies them as to their potential risk of containing an illegal investment proposal or advice. The value of the system is the gain of significant time and efficiency savings for the human analyst. On the other hand the classificatory precision of discovering classes consisting of less than 1% of the corpus was considered unachievable by conventional word based text classification methods, hence a hitherto unexplored semantic model of language was adopted for expressing the feature space of the documents. The project thus was defined in terms of research objectives, particularly accurate detection of minute classes and representation of text classification as modelled through a strong linguistic theory. At the same time the project was obliged to produce an industrial quality system with adherence to concomitant performance criteria.
Moving Out of the Lab: Deploying Pervasive Technologies in a Hospital
Authors: Thomas Riisgaard Hansen, Jakob E. Bardram, Mads Soegaard
Venue: IEEE Pervasive Computing (2006)

The authors deployed a distributed system containing a location-tracking system, a context-awareness system, wall-sized displays, and mobile phones in a Danish hospital's operating ward. This article presents the lessons they learned from deploying these pervasive computing technologies and a checklist of questions for researchers to consider relating to hardware, software, and organizational issues when moving pervasive systems out of the laboratory. This article is part of a special issue on Real-World Deployments.
Development of VR-STEF system with force display glove system
Authors: Ken'ichi Koyanagi, Yuki Fujii, Junji Furusho
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

For functional training, however it is important to evaluate the motion functions of trainee, traditional evaluations have problems on subjectivity. We aimed to quantitatively and objectively recreate clinically relevant motion function evaluations by VR technology; to use data gained from traditional evaluations and to computerize evaluation. We also aimed to consider a gap between robotic and conventional rehabilitation. In this paper, we reported virtual glove and VR-STEF systems that are able to recreate a Simple Test for Evaluating Hand Function, STEF.
Randomized registers and iterative algorithms
Authors: Hyunyoung Lee, Jennifer L. Welch
Venue: Distributed Computing (2005)

We present three different specifications of a read-write register that may occasionally return out-of-date values -namely, a (basic) random register, a P-random register, and a monotone random register. We show that these specifications are implemented by the probabilistic quorum algorithm of Malkhi, Reiter, Wool, and Wright, and we illustrate how to program with such registers in the framework of Bertsekas, using the notation of Üresin and Dubois. Consequently, existing iterative algorithms for a significant class of problems (including solving systems of linear equations, finding shortest paths, constraint satisfaction, and transitive closure) will converge with high probability if executed in a system in which the shared data is implemented with registers satisfying the new specifications. Furthermore, the algorithms in this framework will inherit positive attributes concerning load and fault-tolerance from the underlying register implementation. The expected convergence time for iterative algorithms using the monotone implementation is analyzed and shown experimentally to improve on that of the original implementation. The message complexity for iterative algorithms using the monotone probabilistic quorum implementation is shown to improve on that of non-probabilistic implementations in a quantifiable situation.
A Cognac-Glass Algorithm for Conditionally Guaranteed Budgets
Authors: Reinder J. Bril, Wim F. J. Verhaegh, Clemens C. Wust
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

To analyse the schedulability of conditionally guaranteed budgets (CGBs) in the context of fixed-priority preemptive scheduling (FPPS), we present a so-called cognacglass algorithm (CGA). CGBs have been conceived in the context of software video processing for consumer terminals to exploit the relative importance of applications. CGBs are similar to normal budgets, but are only conditionally guaranteed. This paper presents the schedulability analysis of CGBs under FPPS, based on both best-case and worst-case analysis techniques. We show that because both techniques are used, it is not straightforward to base the analysis on a critical instant. We therefore have to investigate multiple phasings of budgets during the analysis, for which we present a socalled cognac-glass algorithm. We derive that it suffices to consider only a subset of so-called dominating values for the phasing, which improves the efficiency of our algorithm. Given our analysis, we evaluate the effectiveness of CGBs, and conclude that CGBs are particularly useful for software video processing. Finally, we briefly compare our approach for CGBs with existing analysis techniques for hierarchical FPPS, and illustrate that best-case analysis techniques and a CGA can reduce the inherent pessimism in these existing techniques.
Automatic generation of defect injectable VHDL fault models for ASIC standard cell libraries
Authors: Donald Shaw, Dhamin Al-Khalili, Come Rozon
Venue: Integration, the VLSI Journal (2006)

Popular generic fault models, which exhibit limited realism for different IC technologies, have been widely misused due to their simplicity and cost-effective implementation. This paper introduces a system for deriving accurate, technology specific fault models that are based on analog defect simulation. This technique, though used in other research efforts, is formally defined in this paper and a systematic approach is developed. It is supported by a new software tool that provides a push-button solution for the previously tedious task of obtaining accurate ASIC cell defect to fault mappings. Furthermore, upon completion of the cell defect analysis, the tool automatically generates VITAL compliant, defect-injectable, VHDL cell models.
Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study
Authors: Giovanni Neglia, Xiaolan Zhang
Venue: Proceedings of the 2006 SIGCOMM workshop on Challenged networks (2006)

In this paper we present a first attempt to study analytically the tradeoff between delivery delay and resource consumption for epidemic routing in Delay Tolerant Networks. We assume that the nodes cooperate in order to minimize a common cost equal to a weighted sum of the packet delivery delay and the total number of copies, which is strongly related to the power consumption. In this framework we determine the best policy each node should deploy in a very simple scenario where all the nodes have perfect knowledge of the system status. The result is used as an ideal reference to evaluate the performance of some heuristics proposed, investigating potential performance improvements and configuration criteria.
Localization using discrete event simulation
Authors: Baybora Aksoy, Volkan Ustun, Jeffrey S. Smith
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In this paper, we focus on the implementation of a localization algorithm for sensor networks using a discrete event simulation (DES) architecture. In this implementation, DES is used to calculate the distances between the sensors in terms of hop lengths and to implement a mass-spring optimization scheme. This implementation allows us to estimate the number of packets required during the localization process after the deployment of the sensors.
Cache Strategies for Semantic Prefetching Data
Authors: Sang-Won Kang, Jongwan Kim, SeokJin Im, HaRim Jung, Chong-Sun Hwang
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

In this paper, we propose a Semantic Prefetching (SP) scheme as a new dissemination method for semantic information, using a dynamic caching strategy that considers a preference of user in Semantic Prefetching Area (SPA). Our contribution is that a proposed mechanism maintains query results in the cache before a user requests a query. In SP, an efficient algorithm for searching a prefetching description Fd is introduced with definitions, and we propose a new query processing algorithm with a Preference Priority Replacement (PPR) strategy to manage cache. Through an extensive performance analysis, we show that SP is superior to existing caching mechanisms for location-based services.
Early Event-related Potential Effects of Syllabic Processing during Visual Word Recognition
Authors: Manuel Carreiras, Marta Vergara, Horacio Barber
Venue: Journal of Cognitive Neuroscience (2005)

A number of behavioral studies have suggested that syllables might play an important role in visual word recognition in some languages. We report two event-related potential (ERP) experiments using a new paradigm showing that syllabic units modulate early ERP components. In Experiment 1, words and pseudowords were presented visually and colored so that there was a match or a mismatch between the syllable boundaries and the color boundaries. The results showed color&ndash;syllable congruency effects in the time window of the P200. Lexicality modulated the N400 amplitude, but no effects of this variable were obtained at the P200 window. In Experiment 2, high- and low-frequency words and pseudowords were presented in the congruent and incongruent conditions. The results again showed congruency effects at the P200 for low-frequency words and pseudowords, but not for high-frequency words. Lexicality and lexical frequency effects showed up at the N400 component. The results suggest a dissociation between syllabic and lexical effects with important consequences for models of visual word recognition.
Design and Validation of Digital Channels for a Galileo Receiver Prototype
Authors: Francesco Rossi, Massimo Rovini, Luca Fanucci
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

This paper describes the design activity for the digital baseband processing of a prototype receiver for the Galileo system. According to the applied hardware-software partitioning, the high rate elaborations have been implemented on a dedicated hardware, a Xilinx Virtex2 FPGA, while the remaining low rate processing has been programmed on an Analog Device DSP. A customarily designed prototype board has been used to validate the receiver under real working conditions: a dynamic GPS and Galileo scenarios. Particularly, the paper focus on the receiver Digital Channel, which is the critical core of the FPGA, from VHDL modeling to hardware implementation and testing.
Brain Signatures of Meaning Access in Action Word Recognition
Authors: Friedemann Pulvermu&uml;ller, Yury Shtyrov, Risto Ilmoniemi
Venue: Journal of Cognitive Neuroscience (2005)

The brain basis of action words may be neuron ensembles binding language- and action-related information that are dispersed over both language- and action-related cortical areas. This predicts fast spreading of neuronal activity from language areas to specific sensorimotor areas when action words semantically related to different parts of the body are being perceived. To test this, fast neurophysiological imaging was applied to reveal spatiotemporal activity patterns elicited by words with different action-related meaning. Spoken words referring to actions involving the face or leg were presented while subjects engaged in a distraction task and their brain activity was recorded using high-density magnetoencephalography. Shortly after the words could be recognized as unique lexical items, objective source localization using minimum norm current estimates revealed activation in superior temporal (130 msec) and inferior frontocentral areas (142&ndash;146 msec). Face-word stimuli activated inferior frontocentral areas more strongly than leg words, whereas the reverse was found at superior central sites (170 msec), thus reflecting the cortical somatotopy of motor actions signified by the words. Significant correlations were found between local source strengths in the frontocentral cortex calculated for all participants and their semantic ratings of the stimulus words, thus further establishing a close relationship between word meaning access and neurophysiology. These results show that meaning access in action word recognition is an early automatic process ref lected by spatiotemporal signatures of word-evoked activity. Word-related distributed neuronal assemblies with specific cortical topographies can explain the observed spatiotemporal dynamics reflecting word meaning access.
Operational rate-distortion optimal bit allocation between shape and texture for MPEG-4 video coding
Authors: Haohong Wang, G. M. Schuster, A. K. Katsaggelos
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

MPEG-4 is the first multimedia standard that supports the decoupling of a video object into object shape and object texture information, which consequently brings up the optimal encoding problem for object-based video. In this paper, we present an operational rate-distortion optimal bit allocation scheme between shape and texture for MPEG-4 encoding. Our approach is based on the Lagrange multiplier method, while the adoption of dynamic programming techniques enables its higher efficiency over the exhaustive search algorithm. Our work will not only benefit the further study of joint shape and texture encoding, but also make possible the deeper study of optimal joint source-channel coding of object-based video.
Video Multiplexing for the MPEG-2 VBR Encoder Using a Deterministic Method
Authors: Jasman Kammin, Kazuo Ohzeki
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

Variable bit-rate (VBR) encoding provides better visual quality compared to constant bit-rate (CBR) encoding. The present paper proposes a new VBR coding system for digital broadcasting with two TV programs, under the condition that the total bit-rate is 12 Mbps. To avoid feedback delay caused by rate control, we introduce parallel encoders to work at different bit-rates and select the best pair of results from the sum of the Mean Square Errors (MSEs) of the two TV programs. Simulation results for various types of images indicate that the proposed method can produce better bitrate allocation for an improvement in PSNR of up to 0.9 dB, compared to CBR encoding.
Solving System of Linear Equations in a Network of Workstations
Authors: Gabriel Dimitriu, Felicia Ionescu
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

In this article we propose an evaluation of the three common algorithms for solving linear system of equations: Gauss Elimination, Gauss-Jordan without pivoting and Jacobi with dominant rows. The parallel design of the chosen algorithms is a compromise between the easies and elegant way to implement in MPI and the performance. The result confirmed that for a small number of low cost computers the speedup is acceptable for the Gauss Elimination and Gauss-Jordan but for Jacobi with dominant rows if data is not already distributed it is better to implement the serial version.
Spreadsheet Simulation
Authors: Andrew F. Seila
Venue: Proceedings of the 36th conference on Winter simulation (2004)

"Spreadsheet simulation" refers to the use of a spreadsheet as a platform for representing simulation models and performing simulation experiments. This tutorial explains the reasons for using this platform for simulation, discusses why this is frequently an efficient way to build simulation models and execute them, describes how to setup a spreadsheet simulation, and finally examines some limitations on the use of spreadsheets for simulation.
Effects of digital switching noise on analog voltage references in mixed-signal CMOS ICs
Authors: Daniele Bonomi, Giorgio Boselli, Gabriella Trucco, Valentino Liberali
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

In this paper we present an approach to analyze effects of digital switching noise on sensitive nodes of the analog section in mixed analog/digital CMOS integrated circuits. As well known, a pre-layout estimation of digital switching noise is a very important target in mixed-signal system-on-chip design.To speed up simulation time, we analyzed the digital and the analog section separately. Digital switching current are evaluated using a dedicated simulation algorithm, while propagation of digital disturbances and their effects on analog blocks are simulated with SPICE. The flexibility of this approach allows us to evaluate the effects of package parasitics, of different switching noise amplitudes, and of different current pulse durations on the same analog circuit, while keeping computational cost and simulation time at low levels.The proposed case study is represented by a flash ADC, acting as analog noise collector, and a set of disturbances due to the current consumption of a two phase clock generator, acting as digital noise generator.
Lessons Learned from MammoGrid for Integrated Biomedical Solutions
Authors: R. H. McClatchey, D. Manset, A. E. Solomonides
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper presents an overview of the MammoGrid project and some of its achievements. In terms of the global grid project, and European research in particular, the project has successfully demonstrated the capacity of a grid-based system to support effective collaboration between physicians, including handling and querying image databases, as well as using grid services, such as image standardization and Computer-Aided Detection (CADe) of suspect or indicative features. In terms of scientific results, in radiology, there have been significant epidemiological findings in the assessment of breast density as a risk factor, but the results for CADe are less clear-cut. Finally, the foundations of a technology transfer process to establish a working "MammoGrid plus" system in Spain through the company Maat GKnowledge and the collaboration of CIEMAT and hospitals in Extremadura.
Reference Frames for Spatial Cognition: Different Brain Areas are Involved in Viewer-, Object-, and Landmark-Centered Judgments About Object Location
Authors: Giorgia Committeri, Gaspare Galati, Anne-Lise Paradis, Luigi Pizzamiglio, Alain Berthoz, Denis Lebihan
Venue: Journal of Cognitive Neuroscience (2004)

Functional magnetic resonance imaging was used to compare the neural correlates of three different types of spatial coding, which are implicated in crucial cognitive functions of our everyday life, such as visuomotor coordination and orientation in topographical space. By manipulating the requested spatial reference during a task of relative distance estimation, we directly compared viewer-centered, object-centered, and landmark-centered spatial coding of the same realistic 3-D information. Common activation was found in bilateral parietal, occipital, and right frontal premotor regions. The retrosplenial and ventromedial occipital&ndash;temporal cortex (and parts of the parietal and occipital cortex) were significantly more activated during the landmark-centered condition. The ventrolateral occipital&ndash;temporal cortex was particularly involved in object-centered coding. Results strongly demonstrate that viewer-centered (egocentric) coding is restricted to the dorsal stream and connected frontal regions, whereas a coding centered on external references requires both dorsal and ventral regions, depending on the reference being a movable object or a landmark.
Super-Resolution Reconstruction of Compressed Video Based on Adaptive Quantization Constraint Set
Authors: Zhong-qiang Xu, Xiu-chang Zhu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Super-resolution (SR) technique is to estimate the High-resolution (HR) images by combining the nonredundant information that is available into a set of Low-resolution (LR) images, which has been a great focus for compressed video. Based on the theory of Projection Onto Convex Set (POCS), this paper constructs Quantization Constraint Set (QCS) using the motion between the frames and the quantization information embedded from the video bit stream. By combing the statistical properties of image and the Human Visual System (HVS), a novel Adaptive Quantization Constraint Set (AQCS) is proposed. The proposed algorithm and its performance analysis are also described. Simulation results show that AQCSbased SR algorithm obtains better performance in both objective and subjective quality, which is applicable for compressed video.