ppxscal/embedding_network huggingface dataset:
On the Definition of Fluctuating Temperature
Authors: B. H. Lavenda
Venue: Open Systems Information Dynamics (2004)

The Maxwell distribution is derived from the F-distribution in the limit where one of the degrees of freedom of the &chi;2 variates tends to infinity. The estimator of the temperature is consistent, and, hence coincides with the temperature of the heat reservoir in the asymptotic limit; it is also unbiased and efficient. Consequently, there is a contradiction between indentifying the Lagrange multiplier in the variational formalism that Tsallis and co-workers use to maximize his nonadditive entropy with respect to escort expectation values in order to derive the Student t- and r-distributions and the physical meaning of these variables. Only in the asymptotic limit when these distributions become the &chi;2-distributions of MBG statistics can the Lagrange multiplier be interpreted as the inverse temperature. Hence, there is no generalization of the &chi;2-distributions that can be made which involves interpreting the Lagrange multiplier as the inverse temperature. The frequency interpretation of the fluctuating temperature is contrasted with the Bayesian approach that treats a parameter to be estimated as a random variable which is equipped with a probability distribution.
Tracking Cerebral White Matter Pathways from Diffusion Tensor Imaging Data: Application in Patients with Brain Tumors
Authors: Paulo Roberto Dellani, Paulo Roberto Wille, Goran Vucurevic, Thomas Bauermann, Peter Stoeter, Martin Glaser, Axel Stadie, Peter Grunett, Axel Perneczky, Aldo von Wangenheim
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The possession of information about the structual organization of brain white mattertracts by the neurosurgical staff taking care of patients with brain tumors can potentiallyincrease the quality of the interventions.We have developed a software system to executein vivo white matter fiber tractography using three dimensional tensor fields measured byMagnetic Resonance Diffusion Tensor Imaging (MR-DTI) that can be used in the normalclinical routine workflow, providing neurosurgeons with very important patient data for operation planning and intra-operative navigation in brain tumors.
A second order accurate difference scheme for the heat equation with concentrated capacity
Authors: Zhi-Zhong Sun, You-Lan Zhu
Venue: Numerische Mathematik (2004)

A numerical solution to the one-dimensional heat equation with concentrated capacity is considered. A second-order accurate difference scheme is derived by the method of reduction of order on non-uniform meshes. The solvability, stability and second order L&#x221e; convergence are proved. A numerical example demonstrates the theoretical results.
Au petite mort
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

Attracted by the motion of an iridescently winged dragonfly, a predatory fish, driven by instinct and forces of nature, leaps from his ever-flowing river and in one sudden moment of carnal lust and abject destruction, takes a life. Rain falls, leaves blow in the chill wind, and the sky darkens as the fish reenters his kingdom. Above, a brightly colored float splashes into the water. Attached is a beautiful but barbed iridescently winged lure. Copyright held by creator.
Quantum and classical query complexities of local search are polynomially related
Authors: Miklos Santha, Mario Szegedy
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Let f be an integer valued function on a finite set V. We call an undirected graph G(V,E) a neighborhood structure for f. The problem of finding a local minimum for f can be phrased as: for a fixed neighborhood structure G(V,E) find a vertex x ∈ V such that f(x) is not bigger than any value that f takes on some neighbor of x. The complexity of the algorithm is measured by the number of questions of the form "what is the value of f on x?" We show that the deterministic, randomized and quantum query complexities of the problem are polynomially related. This generalizes earlier results of Aldous[4] Ald and Aaronson [1] Aar and solves the main open problem in Aar.
Web Services, Grid Computing, and Business Process Management: Exploiting Complementarities for Business Agility
Authors: Srinivas Padmanabhuni, Jai Ganesh, Deependra Moitra
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Recent technologies including web services,business process modeling tools, and grid computing,are key to facilitating business agility. Web servicesstandardize application interfaces to ease inter-applicationcommunication, and facilitate standardsbased business process management. Grid computingprovides a way for virtualizing heterogeneousresources to collectively yield a computationallypowerful IT environment with tremendous promise inimproving utilization levels of individual IT resources.By leveraging web services, a standards based grid isbeing envisaged in the OGSA model. In this paper, weexplore the complementarities of web services andbusiness process management (BPM) technologies. Wealso lay the foundation for using web services basedBPM in solving orchestration and workflow issues ingrid computing.
Digital Watermarking of Three-Dimensional Polygonal Models in the Spherical Coordinate System
Authors: Mohsen Ashourian, Reza Enteshari, Jeonghee Jeon
Venue: Proceedings of the Computer Graphics International (2004)

In this paper, we propose a new digital watermarkingscheme for the three-dimensional (3-D) mesh model inthe spatial domain. In order to insert and extractwatermark signals, we generate triangle strips bytraversing the 3-D mesh model. We embed thewatermark signal into vertex positions of the 3-Dmodel in the spherical coordinate representation. Wedefine a new masking operation for the watermarksignal according to the variation of vertex positionsalong the traversed strips so that we can change theembedding strength adaptively and reduce thevisibility distortion of the data embedding. We test theproposed watermarking scheme by embedding arandom binary sequence and applying differentattacks, such as additive random noise, compressionby MPEG-4 SNHC, and mesh simplification, whichshows the robustness of the watermarking scheme.
An SLA-Oriented Capacity Planning Tool for Streaming Media Services
Authors: Ludmila Cherkasova, Wenting Tang, Sharad Singhal
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

This paper addresses the problem of mapping the requirementsof a known media service workload into the correspondingsystem resource requirements and accurately sizing a mediaserver cluster to handle the workload. In this paper, we proposea new capacity planning framework for evaluating the resourcesneeded for processing a given streaming media workload with specifiedperformance requirements. The performance requirements arespecified in a Service Level Agreement (SLA) containing: i) basiccapacity requirements that define the percentage of time the configurationis capable of processing the workload without performancedegradation while satisfying bounds on system utilization; and ii)performability requirements that define the acceptable degradationof service performance during the remaining, non-compliant timeand in case of node failures. Using a set of specially benchmarkedmedia server configurations, the capacity planning tool matches theoverall capacity requirements of the media service workload profilewith the specified SLAs to identify the number of nodes necessaryto support the required service performance.
Derandomizing homomorphism testing in general groups
Authors: Amir Shpilka, Avi Wigderson
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld [11]. We show that for any groups G and Γ, and any expanding generating set S of G, the natural deramdomized version of the BLR test in which we pick an element x randomly from G and y randomly from S and test whether f(x) · f(y)=f(x · y), performs nearly as well (depending of course on the expansion) as the original test. Moreover we show that the underlying homomorphism can be found by the natural local "belief propagation decoding". We note that the original BLR test uses 2 log2 |G| random bits, whereas the derandomized test uses only (1+o(1)) log2 |G| random bits. This factor of 2 savings in the randomness complexity translates to a near quadratic savings in the length of the tables in the related locally testable codes (and possibly probabilistically checkable proofs which may use them). Our result is a significant generalization of the recent result of [12], who proved such a result only for the groups G=Zpm and Γ=Zp. It is also an explicit version of the nonconstructive result of [18]. We use a simple combinatorial arguments and the transitivity of Cayley graphs (and this analysis gives optimal results up to constant factors). Previous techniques used the Fourier transform, a method which seems unextendable to general groups (and furthermore gives suboptimal bounds). Finally, we provide a polynomial time (in |G|) construction of a (somewhat) small (|G|ε) set of expanding generators for every group G, which yield efficient testers of randomness (1+ε) log |G| for G. This follows a simple derandomization of the probabilistic construction of [5], who showed that almost all logarithmic-size sets are expanding. Our work motivates further study of similar derandomizations of other natural property testing procedures, especially those more relevant to the local testing of better codes and to PCPs.
Knowledge Discovery from Databases on the Semantic Web
Authors: Bryan Scotney, Sally McClean
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

We provide a flexible method for Knowledge Discoveryfrom semantically heterogeneous data, based on thespecification of ontology mappings from the local datasources to pre-existing (superior) ontologies in an ontologyserver. We also provide an innovative method for theconstruction of a Dynamic Shared Ontology; dataintegration is then carried out by minimisation of theKullback-Leibler information divergence using the EMalgorithm. The new knowledge learned by this process ispotentially richer than any of the contributing data sources.We also show how the approach may be extended toKnowledge Discovery from a number of databaseattributes; association rules or Bayesian Belief Networksmay then be induced. An architecture for a KDD system insuch an environment is described; this is an extension of aprevious architecture for distributed data processing thatwe have already implemented.
Design of surgical meshes: an engineering perspective
Authors: Abhay S. Pandit, Jerome A. Henry
Venue: Technology and Health Care (2004)

There is an increasing use of meshes to surgically repair or reconstruct anatomical defects. The surgical mesh firmly augments the debilitated area, provides a tension-free repair and facilitates the incorporation of fibrocollagenous tissue into the surgical mesh. However, the variant of mesh that facilitates best surgical practice is controversial. Surgical meshes have been predominantly designed with greater emphasis being placed on enhancing the biocompatibility of surgical meshes rather than on the engineering parameters. There is abundant evidence indicating a relationship between post-operative complications and the mesh design. Yet, the design of surgical meshes from an engineering perspective has to come to fruition. This article endeavours to present a synopsis of the current state of the science of surgical meshes, their clinical applications and the current trends in research.
Collaborative filing in a document repository
Authors: Harris Wu, Michael D. Gordon
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We introduce an emergent, collaborative filing system. In such a system, an individual is allowed to organize a subset of documents in a repository into a personal hierarchy and share the hierarchy with others. The system generates a "consensus" hierarchy from all users' personal hierarchies, which provides a full, common, and emergent view of all documents. We believe that collaborative filing helps translate personal, tacit knowledge into sharable structures, which help the user as well a community of which he or she is a part. Our filing system is suitable for any documents from text to multimedia files. Initial results on an experimental website show promise. For a knowledge task involving extensive document retrieval, hierarchies are not only used frequently but are also effective in identifying high quality documents. One surprising finding is how often subjects use others' personal hierarchies, and upon close examination, social networks play a key role as well.
Robust Object Recognition in Images and the Related Database Problems
Authors: Laurent Amsaleg, Patrick Gros, Sid-Ahmed Berrani
Venue: Multimedia Tools and Applications (2004)

Traditional content-based image retrieval systems typically compute a single descriptor per image based for example on color histograms. The result of a query is in general the images from the database whose descriptors are the closest to the descriptor of the query image. Systems built this way are able to return images that are globally similar to the query image, but can not return images that contain some of the objects that are in the query. As opposed to this traditional coarse-grain recognition scheme, recent advances in image processing make fine-grain image recognition possible, notably by computing local descriptors that can detect similar objects in different images. Obviously powerful, fine-grain recognition in images also changes the retrieval process: instead of submitting a single query to retrieve similar images, multiple queries must be submitted and their partial results must be post-processed before delivering the answer. This paper first presents a family of local descriptors supporting fine-grain image recognition. These descriptors enforce robust recognition, despite image rotations and translations, illumination variations, and partial occlusions. Many multi-dimensional indexes have been proposed to speed-up the retrieval process. These indexes, however, have been mostly designed for and evaluated against databases where each image is described by a single descriptor. While this paper does not present any new indexing scheme, it shows that the three most efficient indexing techniques known today are still too slow to be used in practice with local descriptors because of the changes in the retrieval process.
Program Comprehension in Generative Programming: A History of Grand Challenges
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

The communities of Generative Programming (GP) andProgram Comprehension (PC) look at similar problems: GPderives a program from a specification, PC derives a specificationfrom a program. A basic difference between the two isGP's use of specific knowledge representations and mentalmodels that are essential for program synthesis. In this paper,I present a historical review of the Grand Challenges, results,and outlook for GP as they pertain to PC.
The Logarithmic Checking Method for On-Line Testing of Computing Circuits for Processing of the Approximated Data
Authors: A. Drozd, R. Al-Azzeh, J. Drozd, M. Lobachev
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In this paper we present logarithmic checking method for on-line testing of the fixed-point adder, multiplier and divider for processing of the approximated data. The check code as logarithmic estimation of fixed-point number is defined. Check equations, connected check codes of operands and result for operation of addition multiplication and division are proved. The method distinguishes errors, which are essential and non-essential for reliability of calculated results. It allows to lower rejection of authentic results and to raise results check reliability in processing of the approximated data in comparison with the residue checking.
Detection of Heap Management Flaws in Component-Based Software
Authors: Heikki Verta, Titos Saridakis
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Heap management is responsible for the allocation of heap segments to a running application. When the logic of the heap management is left to the application programmer, as it is the case with programming languages like C and C++, a number of problems may arise. One kind of problems related to imperfect heap management is that of memory leaks, which happen when heap segments become inaccessible before they are deallocated. Closely related to that problem, from the standpoint of programmer's operations, is the problem of corrupted heap due to redundant attempts to deallocate the same heap segment that has been previously allocated. This paper present a method for detecting such flaws in heap management. Our method is based on traces collected during the execution of an application and their off-line analysis in order to determine the presence of memory leaks and redundant deallocations of the same heap segment. When our method is applied to component-based embedded software, it allows to locate the component that had allocated heap memory and did not deallocate it before exiting, as well as the components that are responsible for the redundant deallocation of heap segments.
On the Expected Synergies between Component-Based Software Engineering and Best Practices in Product Integration
Authors: Stig Larsson, Ivica Crnkovic, Fredrik Ekdahl
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The expectations for a well working integration process are described in the Capability Maturity Model Integration (CMMI). Often during the integration process, weaknesses of the entire development process become visible. This is usually too late and too costly. Particular development processes and use of particular technologies may help to improve the performance of the integration process by providing proper input to it. For example, by the use of a component-based approach, the development process changes. Some of these changes may help in performing according to the process expectations. In this paper, examples of problems that have been observed in the integration process are described. Through a case study we describe a number of practical problems in current development projects. Based on this case study, we analyze how a component-based approach could help and lead to a more effective integration process.
Branch Merge Reduction of RLCM Networks
Authors: Bernard N. Sheehan
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper we consider the problem of finding asmaller RLCM circuit that approximately replicates thebehavior (up to a certain frequency) of a given RLCM circuit.Targeted at parasitic extractors for verification of VLSIdesigns, the proposed algorithm uses a branch merge, nodeelimination methodology, with the choice of nodes forelimination being guided by time-constant criteria.Reliable,accurate, easy to code, the algorithm works well for coupledbuses and clocks, strongly inductive networks, and low-losstransmission lines, as well as for lossy RLC networks.
Kansei Retrieval Method Based on Design Pattern of Traditional Japanese Crafting Object
Authors: Kaoru Sugita, Tomoyuki Ishida, Akihiro Miyakawa, Yoshitaka Shibata
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper, we propose a Kansei Retrieval method based on the design pattern of traditional Japanese crafting object to provide a user with the desired presentation space in digital traditional Japanese crafting system. The visual quantitative feature values are extracted by using Visual Pattern Image Coding (VPIC). These values include the total number, the frequency, the dispersion rate and the deviation rate for different edges. The quantitative feature values for traditional Japanese crafting objects are registered in the multimedia database and the relation between Kansei words and the visual feature of traditional Japanese Crafting objects are analyzed by using the questionnaire. Then, the visual features are compared with the quantitative feature values. Through the above process, we want to find the relation between the design pattern components and edge types using VPIC. By finding this relation, the Kansei retrieval method can be realized.
Online Medical Teaching Case Database
Authors: Susan Kansagra, Chris Chang, Saleem Hussain, Gregory Hulka, Linda Gray Leithe
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Case-based teaching allows for the study of medicine through records of patient encounters.These cases, used for teaching purposes, are variably collected by clinicians as hard copies of patient files and radiology films. Currently, a single repository of thorough, multi-disciplinary,medical teaching cases that can be uniformly accessed, shared, and searched comprehensively by all medical professionals does not exist. An internet accessible database (iCORD) that focuses on graphical, audio-visual information along with text has been created. Users may create their own teaching case records to organize their files and share them with others. Case submissions are executed through a non-platform-specific application securely connected to the iCORD database. This submission tool and connector module, was developed using Java and XML-related technologies. The data storage medium, which is an extensible SQL database primarily used for storing patient case information, is exposed using IIS 5.0 and XML-based transformation tools to allow dynamic content delivery to PCýs and handheld devices. Usage statistics, distributable teaching files, and user-centric information, which are compiled in the iCORD database, allow development of useful case search algorithms. The prototype database of 400 otolaryngology clinical cases is fully searchable using Boolean logic by parameters including age, gender, diagnosis, medical history, clinical keywords, pathology keywords, and more. The database can be used as a teaching tool during conferences and as a case authoring tool for physicians.
An approach to teaching design patterns using musical composition
Authors: John Hamer
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

We present an approach to teaching design patterns using a music composition project. The project is distinctive in that students are encouraged to discover and express their innate musical talents, and are exposed to some deep connections between programming and art. In addition to design patterns, the material provides opportunities for incorporating a surprisingly diverse range of topics---from data structures, grammars, parsing, to formal proofs.The approach has been used successfully in both introductory and advanced courses over a number of years.
A High-Capacity Block Based Video Watermark
Authors: Stefan Thiemert, Thomas Vogel, Jana Dittmann, Martin Steinebach
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Robust watermarks can be used for different applications. Main aspects are robustness, transparency and capacity. In this paper we present a block based video watermark, which is robust against several image processing operations. It provides a high capacity and good transparency. The watermarking scheme enforces a relationship between block averages in groups of blocks to represent the embedded binary message. Furthermore it creates a relationship between chosen coefficients into each block to represent the message redundantly. We present several evaluation results to demonstrate the robustness and transparency of the scheme.