ppxscal/embedding_network huggingface dataset:
Homogenization of Periodically Varying Coefficients in Electromagnetic Materials
Authors: H. T. Banks, V. A. Bokil, D. Cioranescu, N. L. Gibson, G. Griso, B. Miara
Venue: Journal of Scientific Computing (2006)

In this paper, we employ the periodic unfolding method for simulating the electromagnetic field in a composite material exhibiting heterogeneous microstructures which are described by spatially periodic parameters. We consider cell problems to calculate the effective parameters for a Debye dielectric medium in the case of a circular microstructure in two dimensions. We assume that the composite materials are quasi-static in nature, i.e., the wavelength of the electromagnetic field is much larger than the relevant dimensions of the microstructure.
A Study on Information Recommendation System that Provides Topical Information Related to User's Inquiry for Information Retrieval
Authors: Ichiro Kobayashi, Mai Saito
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Since the Internet has been widely common in our everyday lives, quite a few benefit has been provided to our lives, whereas we also face a big problem to find necessary information from enormous information sources on the Web. Therefore, information recommendation systems have been required and studied hard in these days. Many information recommendation systems have been proposed, and most systems have to possess and manage quite a few amounts of data such as users' profile information, history of operation behaviors, etc. In this sense, it costs much to develop a system, though we can receive useful services from the system. In this paper, we do not aim to develop such an expensive information recommendation system, but to develop a system, working beside normal search engine, that recommends information related to user's interest, i.e., user's inquiry to search engine.
Index Structures for Matching XML Twigs Using Relational Query Processors
Authors: Zhiyuan Chen, Johannes Gehrke, Flip Korn, Nick Koudas, Jayavel Shanmugasundaram, Divesh Srivastava
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Various index structures have been proposed to speed up the evaluation of XML path expressions. However, existing XML path indices suffer from at least one of three limitations: they focus only on indexing the structure (relying on a separate index for node content), they are useful only for simple path expressions such as root-to-leaf paths, or they cannot be tightly integrated with a relational query processor. Moreover, there is no unified framework to compare these index structures. In this paper, we present a framework defining a family of index structures that includes most existing XMLpath indices.We also propose two novel index structures in this family, with different space-time tradeoffs, that are effective for the evaluation of XML branching path expressions (i.e., twigs) with value conditions. We also show how this family of index structures can be implemented using the access methods of the underlying database system. Finally, we present an experimental evaluation that shows the performance tradeoff between index space and matching time. The experimental results show that our novel indices achieve orders ofmagnitude improvement in performance for evaluating twig queries, albeit at a higher space cost, over the use of previously proposed XML path indices that can be tightly integrated with a relational query processor.
DRedSOP: Synthesis of a New Class of Regular Functions
Authors: Anna Bernasconi, Valentina Ciriani
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

In this paper we characterize and study a new class of regular Boolean functions called D-reducible. A Dreducible function, depending on all its n input variables, can be studied and synthesized in a space of dimension strictly smaller than n. A D-reducible function can be efficiently decomposed, giving rise to a new logic form, that we have called DRedSOP. This form is often smaller than the corresponding minimum SOP form. Experimental evidence shows that such functions are rather common and D-reducibility can be tested very quickly.
On Optimal Deadlock Detection Scheduling
Authors: Yibei Ling, Shigang Chen, Cho-Yu Jason Chiang
Venue: IEEE Transactions on Computers (2006)

Deadlock detection scheduling is an important, yet often overlooked problem that can significantly affect the overall performance of deadlock handling. Excessive initiation of deadlock detection increases overall message usage, resulting in degraded system performance in the absence of deadlocks, while insufficient initiation of deadlock detection increases the deadlock persistence time, resulting in an increased deadlock resolution cost in the presence of deadlocks. The investigation of this performance trade-off, however, is missing in the literature. This paper studies the impact of deadlock detection scheduling on the overall performance of deadlock handling. In particular, we show that there exists an optimal deadlock detection frequency that yields the minimum long-run mean average cost, which is determined by the message complexities of the deadlock detection and resolution algorithms being used, as well as the rate of deadlock formation, denoted as \lambda. For the best known deadlock detection and resolution algorithms, we show that the asymptotically optimal frequency of deadlock detection scheduling that minimizes the overall message overhead is {\cal O}((\lambda n)^{1/3}) when the total number n of processes is sufficiently large. Furthermore, we show that, in general, fully distributed (uncoordinated) deadlock detection scheduling cannot be performed as efficiently as centralized (coordinated) deadlock detection scheduling.
Design Issues for Software Analysis and Maintenance Tools
Authors: Dean Jin
Venue: Proceedings of the 13th IEEE International Workshop on Software Technology and Engineering Practice (2005)

Software maintainers have long been acutely aware of the challenges involved in managing software change processes. Activities such as software migration, restructuring and reengineering all involve source code modification. They rely heavily on analysis and comprehension of the complex system structures and interactions that characterize both legacy and modern software systems. It is widely accepted that tools that support software analysis and maintenance tasks would go a long way towards addressing the constraints that software developers and maintainers work with on a day-to-day basis. Nevertheless, despite an abundance of tools, not many are used by practitioners and very few are considered essential for a particular development or maintenance task. This workshop examined design issues related to the development and application of tools to support software analysis and maintenance.
Simple sequence repeats in organellar genomes of rice: frequency and distribution in genic and intergenic regions
Authors: Passoupathy Rajendrakumar, Akshaya Kumar Biswal, Sena M. Balachandran, Kommoju Srinivasarao, Raman M. Sundaram
Venue: Bioinformatics (2007)

Motivation: Simple sequence repeats (SSRs) are abundant across genomes. However, the significance of SSRs in organellar genomes of rice has not been completely understood. The availability of organellar genome sequences allows us to understand the organization of SSRs in their genic and intergenic regions. Results: We have analyzed SSRs in mitochondrial and chloroplast genomes of rice. We identified 2528 SSRs in the mitochondrial genome and average 870 SSRs in the chloroplast genomes. About 8.7% of the mitochondrial and 27.5% of the chloroplast SSRs were observed in the genic region. Dinucleotides were the most abundant repeats in genic and intergenic regions of the mitochondrial genome while mononucleotides were predominant in the chloroplast genomes. The rps and nad gene clusters of mitochondria had the maximum repeats, while the rpo and ndh gene clusters of chloroplast had the maximum repeats. We identified SSRs in both organellar genomes and validated in different cultivars and species. Contact:rms_28@rediffmail.com. Supplementary information: Supplementary Data are available at Bioinformatics online.
Cooperative Design and Development of Logistics Information System Based on Simple Factory Pattern
Authors: Bo Yan, Biqing Huang, Hongbo Sun, Chin E. Lin
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

The logistics information system usually includes many subsystems with close interaction. The cooperative design is an inevitable in the development issue. This paper adopts the simple factory pattern to solve the programming problem at the beginning of system design that every subsystem is defined with interfaces to its referencing subsystems in order to invoke during programming and reduce the coupling with other subsystems. When adopting this simple factory pattern, it is convenient to design and develop the overall system cooperatively, and saving time and improving efficiency simultaneously.
Distributed detection of weak dependent narrowband signals
Authors: R. S. Blum
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Distributed signal detection schemes have received significant attention but most research has focused on cases with independent observations at the different sensors. Cases with dependent narrowband signals, which are of practical interest in communication, radar, and sonar problems, are studied here. The focus is on cases with two sensors where the observations consist of a weak random signal in possibly non-Gaussian additive noise which is independent from sensor to sensor. The author finds that the best (locally optimum) sensor test statistics for such cases are often different from the best test statistics for cases with isolated sensors and that these sensor test statistics may be nonsymmetric even for highly symmetric problems. The possible difference between the best weak-signal distributed sensor test statistic and the best weak-signal test statistic for an isolated sensor is due to the distributed scheme attempting to approximate the correlation terms found in the corresponding two-sensor centralized test.
Development of a parametric estimating model for technology-driven deployment projects
Authors: Rudy J. Watson, Young Hoon Kwak
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The purpose of this paper is to define the process used to develop a parametric estimating model and to explain the use of the model as it allows a non subject matter expert to predict the cost of deployment of a technology-driven project with improved accuracy.The overall objective is to define criteria for organizations to use as a rule of thumb estimating model for determining potential resource requirements during the pre-concept and concept phase of a technology-driven project.The use of the model will determine the complexity level of a project and then using a matrix simulating the task complexity knowledge of a deployment subject matter expert, the organization deployment resource required will be estimated based upon responses to certain inquiries. The user of the model will then have the capability to modify the output to derive their specific deployment estimates.
A 3-Query Non-Adaptive PCP with Perfect Completeness
Authors: Subhash Khot, Rishi Saket
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

We study a very basic open problem regarding the PCP characterization of NP, namely, the power of PCPs with non-adaptive queries and perfect completeness. The lowest soundness known till now for such a PCP is \frac{6}{8} + \in given by a construction of H°astad [11]. However, Zwick [15] shows that a -query non-adaptive PCP with perfect completeness cannot achieve soundness below \frac{5}{8}.
Multi-Agent Systems Performance by Adaptive/Non-Adaptive Agent Selection
Authors: Toshiharu Sugawara, Kensuke Fukuda, Toshio Hirotsu, Shin-ya Sato, Satoshi Kurihara
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Our research interest lies in studing how local strategies about partner agent selection using reinforcement learning with variable exploitation-versus-exploration parameters influence the overall efficiency of multi-agent systems (MAS). An agent often has to select appropriate agents to assign tasks that are not locally executable. Unfortunately no agent in an open environment can understand the all states of all agents, so this selection must be done according to local information. In this paper we investigate how the overall performance of MAS is affected by their individual learning parameters for adaptive partner selections for collaboration. We show experimental results using simulation and discuss why the overall performance of MAS varies.
Organisational factors affecting teachers' use and perception of information & communications technology
Authors: Ryan Grainger, Denise Tolhurst
Venue: Proceedings of the 2005 South East Asia Regional Computer Science Confederation (SEARCC) Conference - Volume 46 (2005)

While the learning benefits of information & communication technologies (ICTs) are widely recognised by academics and practitioners alike, the context in which teachers operate often affects the extent to which ICTs are used to achieve beneficial teaching & learning outcomes. The purpose of the study reported in this paper was to explore what organisational factors affected teachers' use and perception of ICTs, and the use of a new learning management system. Teaching staff across all learning areas at a secondary school responded to a survey. A subset of teachers and school system personnel also participated in interviews. Document analysis was used to place the results in the context of school-system planning. The study focused on three factors affecting the use and perception of ICTs: the characteristics and perceptions of leadership; the nature, relevance and usefulness of training; and, management approaches to IS/IT system implementation. Outcomes from the study are in the form of recommendations to assist the ongoing implementation of a learning management system and the integration of technology in learning environments. The findings of this study have implications for many learning environment that involve the implementation of technological systems.
Tactile&ndash;Visual Links in Exogenous Spatial Attention under Different Postures: Convergent Evidence from Psychophysics and ERPs
Authors: Steffan Kennett, Martin Eimer, Charles Spence, Jon Driver
Venue: Journal of Cognitive Neuroscience (2001)

Tactile&ndash;visual links in spatial attention were examined by presenting spatially nonpredictive tactile cues to the left or right hand, shortly prior to visual targets in the left or right hemifield. To examine the spatial coordinates of any crossmodal links, different postures were examined. The hands were either uncrossed, or crossed so that the left hand lay in the right visual field and vice versa. Visual judgments were better on the side where the stimulated hand lay, though this effect was somewhat smaller with longer intervals between cue and target, and with crossed hands. Event-related brain potentials (ERPs) showed a similar pattern. Larger amplitude occipital N1 components were obtained for visual events on the same side as the preceding tactile cue, at ipsilateral electrode sites. Negativities in the Nd2 interval at midline and lateral central sites, and in the Nd1 interval at electrode Pz, were also enhanced for the cued side. As in the psychophysical results, ERP cueing effects during the crossed posture were determined by the side of space in which the stimulated hand lay, not by the anatomical side of the initial hemispheric projection for the tactile cue. These results demonstrate that crossmodal links in spatial attention can influence sensory brain responses as early as the N1, and that these links operate in a spatial frame-of-reference that can remap between the modalities across changes in posture.
The number of transversals in a Latin square
Authors: Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless
Venue: Designs, Codes and Cryptography (2006)

A Latin Square of order n is an n × n array of n symbols, in which each symbol occurs exactly once in each row and column. A transversal is a set of n entries, one selected from each row and each column of a Latin Square of order n such that no two entries contain the same symbol. Define T(n) to be the maximum number of transversals over all Latin squares of order n. We show that $$b^n \leq T(n) \leq c^n\sqrt{n}\,n!$$ for n ¿ 5, where b ¿ 1.719 and c ¿ 0.614. A corollary of this result is an upper bound on the number of placements of n non-attacking queens on an n × n toroidal chess board. Some divisibility properties of the number of transversals in Latin squares based on finite groups are established. We also provide data from a computer enumeration of transversals in all Latin Squares of order at most 9, all groups of order at most 23 and all possible turn-squares of order 14.
NETDB - Networking Meets Databases: Do we meet or merge?
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

The recent years brought a massive change in the way data management is viewed. Data is being increasingly processed within networks. P2P computing and sensor networks are the most prominent examples. The classical separation of information systems from communication systems is disolving. We can observe that very similar problems are addressed by what before seemed fairly disparate research communities. For example, the problem of aggregating and filtering data within networks is being studied simultanously in information theory and networking, both classical EE fields, as well as in distributed systems and databases, both classical CS fields. Even researchers from so seemingly unrelated disciplines such as physics start to investigate these problems. This raises a number of issues of how research in this field is organized now and ought to be organized in the future. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem
Authors: Silvio Priem Mendes, Juan A. Gomez Pulido, Miguel A. Vega Rodriguez, Maria D. Jaraiz Simon, Juan M. Sanchez Perez
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

In this paper we present a Differential Evolution based algorithm used to solve the Radio Network Design (RND) problem. This problem consists in determining the optimal locations for base station transmitters in order to get a maximum coverage area with a minimum number of transmitters. Because of the very high amount of possible solutions, this problem is suitable to be tackled with evolutionary techniques, so in our work it has been developed an algorithm inspired on the well-known Differential Evolution algorithm, obtaining good results.
Using the Clinical Document Architecture as Open Data Exchange Format for Interfacing EMRs with Clinical Decision Support Systems
Authors: Iryna Bilykh, Jens H. Jahnke, Glen McCallum, Morgan Price
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Clinical decision support systems (CDSS) can significantly increase the quality of care while decreasing cost and effort. They are difficult to develop and most existing systems are proprietary, tightly integrated with specific electronic medical record (EMR) systems, and expensive to own. EGADSS is an open-source CDSS that has been developed as a standalone, standards-based, re-usable component to make decision-support available for any EMR. In order to realize this vision, the EGADSS team has had to develop an open interface for medical data exchange, which maximizes interoperability, simplicity and standardconformance. This paper reports on a solution to this challenge based on the HL7 Clinical Document Architecture (CDA) and the electronic medical summary standard. CDA-based medical summaries are used to encapsulate virtual medical records about patients that serve the DSS component as temporary databases. We show how these temporary databases can be queried from within Arden syntax-based guidelines in a standard query language. Moreover, we show how the CDA can be used to communicate CDSS alerts and recommendations back to the EMR. We report on our evaluation with a prototype implementation and compare it with alternative approaches.
Semantic Labeling of Data by Using the Web
Authors: Leonardo Rigutini, Ernesto Di Iorio, Marco Ernandes, Marco Maggini
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

This paper proposes a system for automatically categorizing terms or lexical entities into a predefined set of semantic domains. We present an approach that exploits the knowledge available in the Web to create a model of each term or entity (Entity Context Lexicons - ECLs). Each profile is simply a list of terms (similar to the Bag-Of-Words representation in text categorization) and it is composed primarily by the words often appearing in the same contexts of the entity. These profiles model the contexts in which the entity usually appears and they can be subsequently processed by an automatic classifier. Moreover, we propose and validate a profile-based categorization model developed for this particular task which uses the ECLs of the training entities to build a profile for each class (Class- Context lexicon - CCL). Finally, we propose a technique for dealing with multi-label classification based on a decision module that exploits a neural network. We show the effectiveness of the proposed approach on a term categorization task using a standard benchmark composed of a set of domain-specific lexicons (WordNetDomains).
On the Applicability of Remote Rendering of Networked Virtual Environments on Mobile Devices
Authors: Peter Quax, Bjorn Geuns, Tom Jehaes, Wim Lamotte, Gert Vansichem
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

The technologies behind Networked Virtual Environments have seen increased interest in recent years, mainly due to the proliferation of the Massively Multiplayer On Line games. It is of increasing importance to developers and service providers to be able to target the mass market of mobile device users. With increased availability of wireless connectivity, one of the hurdles has been stepped over. However, displaying a graphically attractive environment on a device with limited capabilities and battery power still presents a major obstacle. On the other hand, mobile television viewing is currently actively being promoted as one of the key drivers behind the market uptake of 3G services. By using a technique that is known as remote rendering, we are able to use existing client-side hardware (suited for 3G applications) for display of NVE-based applications on mobile devices. In this paper, we present an overview of a system architecture that supports remote rendering of these applications and measurement results that show the feasibility of the approach.