ppxscal/embedding_network huggingface dataset:
Primal-dual algorithms for deterministic inventory problems
Authors: Retsef Levi, Robin Roundy, David B. Shmoys
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. These inventory models have been studied extensively, and play a fundamental role in broader planning issues, such as the management of supply chains. We shall give a novel primal-dual framework for designing algorithms for these models that significantly improve known results in several ways: the performance guarantees for the quality of the solutions improve on or match previously known results; the performance guarantees hold under much more general assumptions about the structure of the costs, and the algorithms and their analysis are significantly simpler than previous known results. Finally, our primal-dual framework departs from the structure of previously studied primal-dual approximation algorithms in significant ways, and we believe that our approach may find application in other settings.We provide 2-approximation algorithms for the joint replenishment problem and for the assembly problem, and solve the single-item lot-sizing problem to optimality. The results for the joint replenishment and the lot-sizing problems also hold for their generalizations with back orders allowed. As a byproduct of our work, we prove known and new upper bounds on the integrality gap of the LP relaxations for these problems.
If diversity is a problem could e-learning be part of the solution?: a case study
Authors: Liz Minton, Roger Boyle, Vania Dimitrova
Venue: ACM SIGCSE Bulletin (2004)

Diversity of students enrolling on Computing degrees is becoming increasingly important in higher education with the number of mature students noticeably increasing and the expectations for learning and teaching gradually changing. This year, the UK government has issued two policy documents; the first will in uence the make-up of the student body in the future, the second is pushing for a unified e-learning strategy within all education sectors which is driven by user needs and not by the technologies. This paper presents a study of two focus groups in a Computing department in a UK university, and discusses the needs of two diverse student groups, traditional and mature students. It is argued that if e-learning is to be driven by the needs of the users, then diversity should be a driving force behind the use of e-learning technology. Further, we suggest that participatory design would be extremely beneficial in developing effective e-learning.
Segmenting motion capture data into distinct behaviors
Authors: Jernej Barbič, Alla Safonova, Jia-Yu Pan, Christos Faloutsos, Jessica K. Hodgins, Nancy S. Pollard
Venue: Proceedings of Graphics Interface 2004 (2004)

Much of the motion capture data used in animations, commercials, and video games is carefully segmented into distinct motions either at the time of capture or by hand after the capture session. As we move toward collecting more and longer motion sequences, however, automatic segmentation techniques will become important for processing the results in a reasonable time frame.We have found that straightforward, easy to implement segmentation techniques can be very effective for segmenting motion sequences into distinct behaviors. In this paper, we present three approaches for automatic segmentation. The first two approaches are online, meaning that the algorithm traverses the motion from beginning to end, creating the segmentation as it proceeds. The first assigns a cut when the intrinsic dimensionality of a local model of the motion suddenly increases. The second places a cut when the distribution of poses is observed to change. The third approach is a batch process and segments the sequence where consecutive frames belong to different elements of a Gaussian mixture model. We assess these three methods on fourteen motion sequences and compare the performance of the automatic methods to that of transitions selected manually.
Approaches to object persistence in java projects
Authors: James H. Paterson, John Haddow
Venue: ACM SIGCSE Bulletin (2004)

This presentation discusses and demonstrates the advantages and limitations of a range of object persistence strategies for use in student projects.
TAM Optimization for Mixed-Signal SOCs using Analog Test Wrappers
Authors: Anuja Sehgal, Sule Ozev, Krishnendu Chakrabarty
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We present a new approach for TAM optimization and testscheduling in the modular testing of mixed-signal SOCs. A testplanning approach for digital SOCs is extended to handle analogcores in a plug-and-play fashion. A test wrapper based on anADC/DAC pair and a digital configuration circuit is designed foranalog cores such that these cores can be accessed through digitalTAMs. In this way, there is no dependence on an analog testbus and expensive mixed-signal testers. Experimental results arepresented for several ITC'02 SOC test benchmarks to which threeanalog cores are added. The results show that the testing of analogcores can be interleaved with the testing of digital cores to reducethe overall testing time for a mixed-signal SOC.
Sound-Based Mobile Payment System
Authors: Ook Lee
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

This study introduces a sound-based mobile paymentsystem as a wireless web service. Using a mobile phonefor payment for mobile commerce is essential for itssuccess. The proposed system will use sound that isgenerated from the existing mobile phone and the soundcan be recognized by the existing credit card reader of theshop with an installation of an ordinary microphone andsimple software to process sound input. This system is abetter system since it doesn't require customers to buy anew mobile phone and the cost for the microphone andthe software is very low.
Exploring semantic groups through visual approaches
Authors: Olivier Bodenreider, Alexa T. McCray
Venue: Journal of Biomedical Informatics (2003)

Objectives. We investigate several visual approaches for exploring semantic groups, a grouping of semantic types from the Unified Medical Language System (UMLS) semantic network. We are particularly interested in the semantic coherence of the groups, and we use the semantic relationships as important indicators of that coherence.Methods. First, we create a radial representation of the number of relationships among the groups, generating a profile for each semantic group. Second, we show that, in our partition, the relationships are organized around a limited number of pivot groups and that partitions created at random do not exhibit this property. Finally, we use correspondence analysis to visualize groupings resulting from the association between semantic types and the relationships.Results. The three approaches provide different views on the semantic groups and help detect potential inconsistencies. They make outliers immediately apparent, and, thus, serve as a tool for auditing and validating both the semantic network and the semantic groups.
Generalized path expressions: a high level debugging mechanism
Authors: Bernd Bruegge, Peter Hibbard
Venue: Proceedings of the symposium on High-level debugging (1983)

This paper introduces a modified version of path expressions called Path Rules which can be used as a debugging mechanism to monitor the dynamic behaviour of a computation. Path rules have been implemented in a remote symbolic debugger running on the Three Rivers Computer Corporation PERQ computer under the Accent operating system.
A General Compiler Framework for Speculative Multithreaded Processors
Authors: Anasua Bhowmik, Manoj Franklin
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Speculative multithreading (SpMT) promises to be an effective mechanism for parallelizing nonnumeric programs, which tend to have irregular and pointer-intensive data structures and complex flows of control. Proper thread formation is crucial for obtaining good speedup in an SpMT system. This paper presents a compiler framework for partitioning a sequential program into multiple threads for parallel execution in an SpMT system. This framework is very general and supports speculative threads, nonspeculative threads, loop-centric threads, and out-of-order thread spawning. It is therefore useful for compiling for a wide variety of SpMT architectures. For effective partitioning of programs, the compiler uses profiling, interprocedural pointer analysis, data dependence information, and control dependence information. The compiler is implemented on the SUIF-MachSUIF platform. A simulation-based evaluation of the generated threads shows that the use of nonspeculative threads and nonloop speculative threads provides a significant increase in speedup for nonnumeric programs.
A Methodology for the Computation of an Upper Bound on Nose Current Spectrum of CMOS Switching Activity
Authors: Alessandra Nardi, Haibo Zeng, Joshua L. Garrett, Luca Daniel, Alberto L. Sangiovanni-Vincentelli
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Currents injected by CMOS digital circuit blocks into the powergrid and into the substrate of a system-on-a-chip may affect reliabilityand performance of other sensitive circuit blocks. To verify thecorrect operation of the system, an upper bound for the spectrum ofthe noise current has to be provided with respect to all possible transitionsof the circuit inputs. The number of input transitions is exponentialin the number of circuit inputs. In this paper, we present anovel approach for the computation of the upper bound that avoidsthe untractable exhaustive exploration of the entire space. Its computationalcomplexity is indeed linear in the number of gates. Ourapproach requires CMOS standard cell libraries to be characterizedfor injected noise current. In this paper, we also present an approachfor this characterization of CMOS standard cells. Experimental resultshave proven the accuracy of both the algorithm and the noisecurrent models used for the library characterization.
Understanding Modifications in State-Based Models
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

System modeling is a widely used technique to modelstate-based systems. System models are frequently largeand complex and are hard to understand. In addition,they are frequently modified because of specificationchanges. Understanding the effect of these changes onthe model and the system may be very difficult for largemodels. In this paper, we present an approach that maysupport understanding the effect of model modifications.The goal is identify these parts of the model that mayexhibit different behavior because of the modification. Inthis approach, the difference between the original modeland the modified model is identified and then affectedparts of the model are computed based on modeldependence analysis. Our initial experience shows thatthe approach may be helpful in understanding the effectof modifications on the system.
Partial Shape Matching of Spine X-Ray Shapes Using Dynamic Programming
Authors: Xiaoqian Xu, D. J. Lee, Sameer Antani, L. Rodney Long
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The osteophyte shows only on some particular locations on the vertebra. This indicatesthat other locations on the vertebra shape contain that are not of interest hinder the spine x-ray image retrieval relevance precision, which motivates our research in partial shapematching (PSM). This paper presents PSM methods for matching shapes with variablenumber of points and with different data point distributions. Dynamic Programming (DP) isproposed for matching partial shapes by allowing merging of the data points in the process ofPSM. DP is implemented based on two shape representation methods: line segments andmultiple open triangles. The performance evaluation, which is based on human relevancejudgements of these two shape representations in PSM is also presented.
Document clustering by concept factorization
Authors: Wei Xu, Yihong Gong
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this paper, we propose a new data clustering method called concept factorization that models each concept as a linear combination of the data points, and each data point as a linear combination of the concepts. With this model, the data clustering task is accomplished by computing the two sets of linear coefficients, and this linear coefficients computation is carried out by finding the non-negative solution that minimizes the reconstruction error of the data points. The cluster label of each data point can be easily derived from the obtained linear coefficients. This method differs from the method of clustering based on non-negative matrix factorization (NMF) \citeXu03 in that it can be applied to data containing negative values and the method can be implemented in the kernel space. Our experimental results show that the proposed data clustering method and its variations performs best among 11 algorithms and their variations that we have evaluated on both TDT2 and Reuters-21578 corpus. In addition to its good performance, the new method also has the merit in its easy and reliable derivation of the clustering results.
Combination of Facial Movements on a 3D Talking Head
Authors: The Duy Bui, Dirk Heylen, Anton Nijholt
Venue: Proceedings of the Computer Graphics International (2004)

Facial movements play an important role in interpretingspoken conversations and emotions. There are several typesof movements, such as conversational signals, emotion displays,etc. We call these channels of facial movement. Realisticanimation of these movements would improve the realism,liveliness of the interaction between human and computersusing embodied conversational agents. To date, noappropriate methods have been proposed for integrating allfacial movements. We propose in this paper a scheme ofcombining facial movements on a 3D talking head. First,we concatenate the movements in the same channel to generatesmooth transitions between adjacent movements. Thiscombination only applies to individual muscles. The movementsfrom all channels are then combined taking into accountthe resolution of possible conflicting muscles.
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
Authors: Jonathan A. Kelner
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: 1. It is a classical result of Gilbert, Hutchinson, and Tarjan [12] that one can find asymptotically optimal separators on these graphs if he is given both the graph and an embedding of it onto a low genus surface. Does there exist a simple, efficient algorithm to find these separators given only the graph and not the embedding? 2. In practice, spectral partitioning heuristics work extremely well on these graphs. Is there a theoretical reason why this should be the case.We resolve these two questions by showing that a simple spectral algorithm finds separators of cut ratio O(√g/n) and vertex bisectors of size O(√gn) in these graphs, both of which are optimal. As our main technical lemma, we prove an O(g/n) bound on the second smallest eigenvalue of the Laplacian of such graphs and show that this is tight, thereby resolving a conjecture of Spielman and Teng. While this lemma is essentially combinatorial in nature, its proof comes from continuous mathematics, drawing on the theory of circle packings and the geometry of compact Riemann surfaces.
Resource Association Discovery in Semantic Web
Authors: Liang Bangyong, Tang Jie, Li Juanzi, Wang Kehong
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Resources on the web have direct and hidden relations. Direct relations mean the visible link between two resources like hyperlinks. Direct relations are easy to discover while hidden relations are not. Current discovery methods are mostly based on the text learning and user feedback methods. The text contents are not fit for inference and they are also lack of semantics. The web pages are annotated with ontolgoies in semantic web. The annotations are useful for inference. This paper proposes a framework for resource association discovery in semantic web. The framework uses the annotation for inference and the annotation hierarchy can be solved by mapping different ontologies. The experiment shows the satisfied results. Finally, the conclusion and future work are discussed.
Randomized routing and wavelength requirements in wavelength-routed WDM multistage, hypercube, and de Bruijn networks
Authors: G. Mohan, G. Venkatesan, C. Siva Ram Murthy
Venue: Journal of Parallel and Distributed Computing (2004)

This paper considers randomized routing in wavelength-routed wavelength division multiplexed (WDM) networks. Randomized routing is advantageous when compared to deterministic routing, as it is simple, oblivious, and suitable for centralized as well as distributed implementation. Recently, there has been a considerable interest in studying regular graphs such as shuffle networks and de Bruijn networks as a possible physical topology for wavelength-routed WDM networks (IEEE/ACM Trans. Network 3(3) (June 1995) 269; IEEE/ACM Trans. Network 2(1) (February 1994) 70; Comput. Networks ISDN Systems 30(24) (December 1998) 2349). In Pankaj and Gallager (1995), permutation routing has been taken as a benchmark problem to accept a network and a deterministic algorithm has been proposed for routing permutation traffic without any blocking in an N-node wrapped-around multi-stage shuffle network using O(log3 N) wavelengths.In this paper, we look at the possible application of probabilistic techniques on a class of wrapped-around multi-stage networks called 2-multinets and study the wavelength requirements for routing permutation traffic, allowing a negligible blocking of sessions. We adopt the routing scheme proposed in (J. ACM 31 (1984) 507) for fast packet routing to find routes in the circuit-switched wavelength-routed WDM networks and analyze the wavelength requirements for different models. The models differ in their routing node architecture and wavelength selection policy. Our analysis shows that the permutation routing problem can be solved on these models with an overwhelming probability using O(log2 N) wavelengths. We also study the routing problem on 2-multinets for a class of 1-expectedly bounded connection requests. For this class also, we propose two models and obtain similar bounds on the number of wavelengths required. We confirm the theoretical results by extensive simulation experiments. The theoretical as well as experimental results show that the number of wavelengths required is reduced significantly when randomized routing techniques are used. Finally, we discuss how the results obtained for 2-multinets can be extended to hypercubes and de Bruijn networks.
High-energy proton irradiation effects on tunnelling MOS capacitors
Authors: C. Fleta, F. Campabadal, J. M. Rafí, M. Lozano, M. Ullán
Venue: Microelectronic Engineering (2004)

The conduction characteristics of MOS capacitors with thin gate oxide irradiated with high-energy protons have been studied. An excess current appears at low electric fields that can be explained with a trap-assisted tunnel model with at single trap level. By using devices with different areas it has been confirmed that this leakage current is uniformly distributed over the oxide area. In addition, a series resistance effect is revealed at high current levels, which increases with proton fluence. It is also shown that the damage induced by irradiation in the SiO2/Si interface is negligible.
A Proposed Architecture to Index Courses on Website and Analyse the Student Follow up
Authors: Michel Sala, Pierre Pompidor, Daniele Herin, Gael Isoird
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The aim of this article is to help a teacher to evaluate his courses by following the students during the learning phase.We assume that the teacher doesn't use an educational platform and have resources at his disposal.We model the course by using a global ontology (an overall view of the system) with limited educational resources.In order to follow the students' improvements, we analyse from the servers' logs and we categorize student in groups.
Revisiting display space management: understanding current practice to inform next-generation design
Authors: Dugald Ralph Hutchings, John Stasko
Venue: Proceedings of Graphics Interface 2004 (2004)

Most modern computer systems allow the user to control the space allocated to interfaces through a window system. While much of the understanding of how people interact with windows may be regarded as well-known, there are very few reports of documented window management practices. Recent work on larger display spaces indicates that multiple monitor use is becoming more commonplace, and that users are experiencing a variety of usability issues with their window systems. The lack of understanding of how people generally interact with windows implies that future design and evaluation of window managers may not address emerging user needs and display systems. Thus we present a study of people using a variety of window managers and display configurations to illustrate manager- and display-independent space management issues. We illustrate several issues with space management, and each issue includes discussion of the implications of both evaluations and design directions for future window managers. We also present a classification of users' space management styles and relationships to window system types.
Cooking Studio: Cooking Simulation from Web Recipes
Authors: Tetsuro Takano, Shinichi Ueshima
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

This paper proposes Cooking Studio, a cookingsupport system for cooking novices. First we describe a methodto generate cooking scenario from Web recipe by morphologicaland semantic analysis, which is a basic document to representcooking processes specifically in the system. We also providecooking scheduling algorithm that maps the graph that representscooking processes into a time chart to satisfy given restrictions.We also show a prototype system of Cooking Studio.
Adaptive Channel Estimation Aided Log-Map Turbo Decoder Implementationfor DS-CDMA Based Mobile Systems
Authors: Fan Mo, Junghwan Kim, Sameep Dave, Subhash C. Kwatra
Venue: Wireless Personal Communications: An International Journal (2004)

Practical implementation of convolutional turbo codec is impeded by the difficulty of real-time execution in high transmission rate communication systems due to high computational complexity, iterative block decoding structure, as well as the requirement of accurate on-line channel reliability estimation for maximum-likelihood decoding. Relying on innovative channel estimation techniques involving DS-CDMA specific noise/interference variance estimation and fading channel variation tracking, this paper provides a low-complexity all-digital design of an iterative SISO log-MAP turbo decoder for DS-CDMA based mobile communication systems. The issues of quantization and data flow in both pre-decoder processing module and iterative trellis decoding module are prudently addressed to ensure highly efficient hardware implementation. The efficient design strategies applied confine the decoding complexity while leading to an excellent performance within 0.2 dB of the software decoder.