ppxscal/embedding_network huggingface dataset:
Resampling 4-D Images Using Adaptive Filtering
Authors: Alexander Andreopoulos, John K. Tsotsos
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We present an adaptive filtering based methodology for resampling 3-D time series images using an extension of the method presented by Westin in [Affine Adaptive Filtering of CT Data]. We simultaneously reduce the artifacts due to image noise and resample the data on a finer grid along the time dimension. This provides a methodology for obtaining high quality image resampling without the disadvantages of staircase artifacts created by more common interpolation methods such as linear interpolation. We present qualitative results of the algorithm on a data set of 4-D cardiac MRI. This is a useful approach for any situation where we have a data set of 4-D images needing to be resampled.
The cadherin superfamily in Anopheles gambiae: a comparative study with Drosophila melanogaster: Research Articles
Authors: Catarina Moita, Sérgio Simões, Luís F. Moita, António Jacinto, Pedro Fernandes
Venue: Comparative and Functional Genomics (2005)

The cadherin superfamily is a diverse and multifunctional group of proteins with extensive representation across genomes of phylogenetically distant species that is involved in cell&ndash;cell communication and adhesion. The mosquito Anopheles gambiae is an emerging model organism for the study of innate immunity and host&ndash;pathogen interactions, where the malaria parasite induces a profound rearrangement of the actin cytoskeleton at critical stages of infection. We have used bioinformatics tools to retrieve present sequence knowledge about the complete repertoire of cadherins in A. gambiae and compared it to that of the fruit fly, Drosophila melanogaster. In A. gambiae, we have identified 43 genes coding for cadherin extracellular domains that were re-annotated to 38 genes and represent an expansion of this gene family in comparison to other invertebrate organisms. The majority of Drosophila cadherins show a 1 : 1 Anopheles orthologue, but we have observed a remarkable expansion in some groups in A. gambiae, such as N-cadherins, that were recently shown to have a role in the olfactory system of the fruit fly. In vivo dsRNA silencing of overrepresented genes in A. gambiae and other genes showing expression at critical tissues for parasite infection will likely advance our understanding of the problems of host preference and host&ndash;pathogen interactions in this mosquito species. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Open standard, open source and peer-to-peer tools and methods for collaborative product development
Authors: Hayder Aziz, James Gao, Paul Maropoulos, Wai M. Cheung
Venue: Computers in Industry (2005)

This paper reports on a collaborative product development and knowledge management platform for small to medium enterprises. It has been recognised that current product lifecycle management (PLM) implementations are document oriented, have a non-customisable data model and inter-enterprise integration difficulties. To overcome these, an ontological knowledge management methodology utilising the semantic web initiative data formats was added to a PLM and an open source alternative. Shortcomings of centralised architectures are highlighted and a solution using a de-centralised architecture proposed. This is implementable at low cost; the scalability increases in line with user numbers. Ontologies, rules and workflows are reusable and extendable.
Multi-Objective Mapping for Mesh-Based NoC Architectures
Authors: Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

In this paper we present an approach to multi-objective exploration of the mapping space of a mesh-based network-on-chip architecture. Based on evolutionary computing techniques, the approach is an efficient and accurate way to obtain the Pareto mappings that optimize performance and power consumption. Integration of the approach in an exploration framework with a kernel based on an event-driven trace-based simulator makes it possible to take account of important dynamic effects that have a great impact on mapping. Validation on both synthesized traffic and real applications (an MPEG-2 encoder/decoder system) confirms theefficiency, accuracy and scalability of the approach.
Towards a model of user mobility and registration patterns
Authors: Ravi Jain, Anupama Shivaprasad, Dan Lelescu, Xiaoning He
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2004)

The evaluation of a great deal of research on ad hoc networks, as well as cellular networks, depends on models of user mobility. Many models have been developed and utilized, such as the random walk and random waypoint models. These are simple to implement and analyze but unlikely to be realistic. We develop a model based on extensive experimental data from a campus Wi-Fi LAN installation, representing traces from about 6000 users over a period of about 2 years. This data does not enable us to develop a user mobility model directly. However, as a first step, we develop a model of the time and sequence of locations at which user devices register. Note that this can be very useful, for instance to evaluate protocols that attempt to manage routing or resource allocations at different nodes. This paper reports work in progress on developing a user registration model. It shows the key time domain as well as space domain features we have extracted from the data. In particular, we show that the time features indicate heavy-tailed, although not power-law, distributions. The spatial features strongly indicate registration localization and hierarchy. The model itself can be represented as a set of probability distributions for various parameters. The modeler, for example a protocol designer, can then generate traces that conform to these distributions while varying the scale of the model in terms of the number of users. We close with a brief discussion of further work to refine and extend the model.
A fast algorithm for power grid design
Authors: Jaskirat Singh, Sachin S. Sapatnekar
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

This paper presents an efficient heuristic algorithm to design a power distribution network of a chip by employing a successive partitioning and grid refinement scheme. In an iterative procedure, the chip area is recursively bipartitioned, and the wire pitches and the wire widths of the power grid in the partitions are repeatedly adjusted to meet the voltage drop and current density specifications. By using the macromodels of the power grid constructed in the previous levels of partitioning, the scheme ensures that a small global power grid system is simulated in each iteration. A post-processing step at the end of the optimization is employed to maximize the alignment of wires in adjacent partitions. The effectiveness of the scheme is demonstrated by designing various power grids with real circuit parameters and realistic input current values. The proposed algorithm is able to design power grids comprising thousands of wires and more than a million electrical nodes in about 7-16 minutes. The proposed design scheme as compared to a multigrid-based power grid design scheme saves about 7%-12% of wire area.
File synchronization with unison
Authors: Erik Inge Bolso
Venue: Linux Journal (2005)

Is the latest version of that file on my server, my desktop or my laptop? With Unison, the answer is "yes".
Use-case components for interactive information systems
Authors: Eliezer Kantorowitz, Alexander Lyakas
Venue: Science of Computer Programming (2005)

Specification-oriented components (SOC's) are designed to facilitate the implementation of a system directly from its specifications. An earlier study has shown cases in which SOC's enabled information systems to be implemented with considerably less code than when implemented with components designed by a typical object-oriented approach. This study goes a further step by considering the essence of an information system to be the flow and processing of data. The components based on this abstraction attempt to hide code that is not implementing data flow or data processing. Based on this approach, an experimental framework called WebSI has been developed. WebSI components hide the code for the construction of the user interface (UI), the database access code and the Web-related code. WebSI was designed to facilitate the manual translation of English language use-case specifications into Java code. WebSI enabled the construction of information systems with a modest amount of code. The similarity between the WebSI-based Java code and the English language use-case specifications facilitated verifying that the code implements the specifications correctly. The automatically produced UI's were relatively easy to learn and to use. The modification of WebSI-based legacy code was facilitated by the high level of the code and its use-case structure, but remained a labor-intensive task.
SRA: description of the SOLOMON system as used for MUC-5
Authors: Chinatsu Aone, Sharon Flank, Doug McKee, Paul Krause
Venue: Proceedings of the 5th conference on Message understanding (1993)

SRA used a language-independent, domain-independent, multipurpose text understanding system as the core of the MUC-5 system for extraction from English and Japanese joint venture texts. SRA's NLP core system, SOLOMON, has been under development since 1986. It has been used for a variety of domains, and was aimed from the start to be language-independent, domain-independent, and application-independent. More recently, SOLOMON has been extended to be multilingual, beginning with Spanish in 1990 and Japanese in 1991. The Spanish-Japanese text understanding system that uses SOLOMON was developed for a domain very different from the MUC-5 joint venture domain (cf. Aone, et al. [2]).
Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights
Authors: Constantinos Maglaras, Assaf Zeevi
Venue: Operations Research (2005)

We consider a model of a service system that delivers two nonsubstitutable services to a market of heterogenous users. The first service is delivered subject to a "guaranteed" (G) processing rate, and the second is a "best-effort" (BE) type service in which residual capacity not allocated to the guaranteed class isshared among BE users. Users, in turn, are sensitive to both price and congestion-related effects. The service provider's objective is to optimally design the system so as to extract maximum revenues. The design variables in this problem consist of a pair of static prices for the two services, a policy that controls admission of G users into the system, and the mechanism by which users are informed of the state of congestion in the system. Because these objectives are difficult to address using exact analysis, we pursue approximations that are tractable and lead to structural insights. Specifically, we first solve a deterministic relaxation of the original objective to obtain a "fluid-optimal" solution that is subsequently evaluated and refined to account for stochastic fluctuations. Using diffusion limits, we derive approximations that yield the following structural results: (1) pricing rules derived from the deterministic analysis are "almost" optimal, (2) the optimal operational regime for the system is close to heavy traffic, and (3) real-time congestion notification results in increased revenues. Numerical results illustrate the accuracy of the proposed approximations and validate the aforementioned structural insights.
Passive Source Localization using Power Spectral Analysis and Decision Fusion in Wireless Distributed Sensor Networks
Authors: M. Ziaur Rahman, Gour C. Karmakar, Laurence S. Dooley
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Source localization is a challenging issue for multisensor multitarget detection, tracking and estimation problems in wireless distributed sensor networks. In this paper, a novel source localization method, called passive source localization using power spectral analysis and decision fusion in wireless distributed sensor networks is presented. This includes an energy decay model for acoustic signals. The new method is computationally efficient and requires less bandwidth compared with current methods by making localization decisions at individual nodes and performing decision fusion at the manager node. This eliminates the requirement of sophisticated synchronization. A simulation of the proposed method is performed using different numbers of sources and sensor nodes. Simulation results confirmed the improved performance of this method under ideal and noisy conditions.
Research at SUNY: Stony Brook
Authors: Herbert Gelernter, Mark Jones, Sharon Salveter, David Warren
Venue: Issue 79 (January 1982) (1982)

The goal of the SYMCHEM project is the automatic discovery of synthesis routes for organic compounds. Future plans call for a natural language interface that will allow experts (chemists) to directly transfer their expertise to SYMCHEM. However, this is not an active research effort at this time.
A Proxy Automatic Signature Scheme Using a Compiler in Distributed Systems for (Unknown) Virus Detection
Authors: Shin-Jia Hwang, Kuang-Hsi Chen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

To detect any (unknown) virus, automatic signature schemes are proposed to be embedded in honestly-made compilers. But compiling load is centralized on the compiler makers. To distribute compiling load with the help of distributed servers, proxy automatic signature schemes are proposed for the distributed compilers. However, Lin and Janýs proxy automatic signature scheme is insecure and has length restriction of source programs. To remove these flaws, Hwang and Li also proposed their scheme. However, two signatures are used for the agreement of compiler makers and servers, respectively. But only the signature for the proxy agreement of compiler makers can be validated by anyone. To remove this inefficient flaw, a new efficient proxy automatic signature scheme is proposed. Except the efficient advantage, the proxy agreement being researched both by the compiler maker and servers can be validated by anyone at the same time. Only one signature is used to show the agreement. The correctness of compilers and executable programs can be validated without releasing source codes. Moreover the moderator can easily find out infection sources.
Faster gossiping on butterfly networks
Authors: Jop F. Sibeyn
Venue: Theoretical Computer Science (2005)

Gossiping has been considered intensively for butterflies and "simple" butterflies (which have no wrap-around connections). In the "telephone" communication model, for a butterfly of order k, the best previous gossiping algorithms require 2½k and 3k communication rounds, respectively. By new asymptotic methods we break through these bounds. We show that gossiping on a class of "column-based" networks, which also contains the cube-connected cycles, can be reduced to the simpler problem of "row-gossiping". Row-gossiping in turn is reduced to "coherent row-broadcasting". This latter problem is sufficiently simple to be solved by a sophisticated computer program for butterflies with up to 15 × 215 nodes. Out of the produced solutions a pattern is distilled, which can be used to perform gossiping on butterflies and simple butterflies of order k in 21/4k + o(k) and 2½k + o(k) rounds, respectively, for any k, considerably reducing the gap with the lower bounds. The new upper bounds also hold for gossiping in the weaker "telegraph" model.
Image based search engine
Authors: Kevin Corace, Ken Kocon
Venue: Journal of Computing Sciences in Colleges (2005)

We are in the process of improving an image-based search engine, capable of using distributed computing techniques to locate one image in another, regardless of scale or orientation. With the continuing expansion of the Internet, users have access to more media content than ever. It is important to redesign this search engine to take advantage of present and future resources as well as to realize the full capabilities in the searching of images.
On the implementation of a baseline part-of-speech tagger
Authors: James Markham, Vasile Rus
Venue: Journal of Computing Sciences in Colleges (2005)

The task of part-of-speech tagging is very important for various text understanding applications including machine translation, question answering and Internet search. In this paper we present a semester-long project that aimed at efficiently implementing a baseline part-of-speech tagger while keeping costs low. This was a project for an undergraduate class in Advanced Data Structures in which we adopted a design with re-use method. The approach allowed the delivery of the software on time and with the desired functionality. It also allowed us to focus on design and conceptual issues rather than on implementing data structures and related algorithms, such as TreeMaps, already available in free libraries.
Romanian software's for cutting stock problems
Authors: Csaba Bela Fabian
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

After a short presentation of the author's contribution in the Cutting stock problems (CPP) solving, we shell present shortly too the contribution of other Romanian peoples based on published and only presented papers in the field of CCP-software The software elaboration and some industrial application are also presented. Some statistical results, concerning these topics using published software is given too.
Rediscovering the analysis of interconnected decision areas
Authors: Abram Weas, Matthew Campbell
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

The method known as the analysis of interconnected decision areas (AIDA) has been in use for nearly 40 years, but has made little headway into engineering design. This paper describes an implementation of AIDA that is useful to engineering designers wishing to combine the solution principles of various subfunctions within a product in new ways. Traditionally, the method is used to understand how one decision affects the options available to other decisions in a large-scale project. The method is to be used interactively with designers participating in a brainstorming session so that ideas are added to AIDA and immediately combined with other compatible ideas. The existing implementation has been tested in a classroom setting in which upper level undergraduates have successfully used the AIDA method along with numerous of design methods to solve conceptual design problems.
Synthesis of skewed logic circuits
Authors: Aiqun Cao, Naran Sirisantana, Cheng-Kok Koh, Kaushik Roy
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2005)

Skewed logic circuits belong to a noise-tolerant high-performance static circuit family. Skewed logic circuits can achieve performance comparable to that of Domino logic circuits but with much lower power consumption. Two factors contribute to the reduction in power. First, by exploiting the static nature of skewed logic circuits, we can alleviate the cost of logic duplication which is typically required to overcome the logic reconvergence problem in both Domino logic and skewed logic circuits. Second, a selective clocking scheme can be applied to a skewed logic circuit to reduce the clock load and hence, clock power. In this article, we propose a two-step synthesis scheme of skewed logic circuits. In the first step, an integer linear programming-based approach is presented to overcome the logic reconvergence problem in skewed logic circuits with minimal logic duplication cost. In the second step, a dynamic programming-based heuristic is applied to achieve an optimal selective clocking scheme. Experimental results show that the average power saving of skewed logic circuits over Domino logic circuits is 41.1&percent;.
Database-Guided Segmentation of Anatomical Structures with Complex Appearance
Authors: B. Georgescu, X. S. Zhou, D. Comaniciu, A. Gupta
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

The segmentation of anatomical structures has been traditionally formulated as a perceptual grouping task, and solved through clustering and variational approaches. However, such strategies require the a priori knowledge to be explicitly defined in the optimization criterion, e.g., "high-gradient border", "smoothness", or "similar intensity or texture". This approach is limited by the validity of underlying assumptions and cannot capture complex structure appearance. This paper introduces database-guided segmentation as a new data-driven paradigm that directly exploits expert annotation of interest structures in large medical databases. Segmentation is formulated as a two-step learning problem. The first step is structure detection where we learn how to discriminate between the object of interest and background. The resulting classifier based on a boosted cascade of simple features also provides a global rigid transformation of the structure. The second step is shape inference where we use a sample-based representation of the joint distribution of appearance and shape annotations. To learn the association between the complex appearance and shape we propose a feature selection mechanism and the corresponding metric. We show that the selected features are better than using directly the appearance and illustrate the performance of the proposed method on a large set of ultrasound heart images.
Reliable solution of an unilateral contact problem with friction and uncertain data in thermo-elasticity
Authors: I. Hlaváček, J. Nedoma
Venue: Mathematics and Computers in Simulation (2005)

An unilateral contact problem with friction and with uncertain input data in quasi-coupled thermo-elasticity is analysed. As uncertain data coefficients of stress-strain law, coefficients of thermal conductivity, body and surface forces, thermal sources and friction coefficients are assumed, being prescribed in a given set of admissible functions. Method of worst scenario is applied to find the most ''dangerous'' admissible input data. Stability of the solution with respect to the data is proved and employed for the proof of existence of a solution to the worst scenario problems. Some models in geomechanics, geodynamics and mechanics as well as in technology are stated and the safety of the high level radioactive waste repositories is considered.
Computing the spectral function for singular Sturm-Liouville problems
Authors: Charles Fulton, David Pearson, Steven Pruess
Venue: Journal of Computational and Applied Mathematics (2005)

Algorithms for computing Sturm-Liouville spectral density functions are developed based on several mathematical characterizations. Convergence and error bounds are derived and methods are tested on several examples. The results are compared with those from the existing software package SLEDGE.
USC: description of the SNAP system used for MUC-4
Authors: D. Moldovan, S. Cha, M. Chung, K. Hendrickson, J. Kim, S. Kowalski
Venue: Proceedings of the 4th conference on Message understanding (1992)

The main goal of the SNAP project is to build a massively parallel computer capable of fast and accurate natural language processing [3]. Under NSF funding, a parallel computer was built in the Parallel Knowledge Processing Laboratory at USC and software was developed to operate the machine [2]. The approach in designing SNAP was to find a knowledge representation and a reasoning paradigm useful for natural language processing which exibits massive parallelism. We have selected marker-passing on semantic networks as a way to represent and process linguistic knowledge.