ppxscal/embedding_network huggingface dataset:
Thermomechanical modeling of regressing heterogeneous solid propellants
Authors: K. R. Srinivasan, K. Matouš, P. H. Geubelle, T. L. Jackson
Venue: Journal of Computational Physics (2009)

A numerical framework based on the generalized finite element method (GFEM) is developed to capture the coupled effects of thermomechanical deformations and thermal gradients on the regression rate of a heterogeneous solid propellant. The thermomechanical formulation is based on a multiplicative split of the deformation gradient and regression of the heterogeneous solid propellant is simulated using the level set method. A spatial mesh convergence study is performed on a non-regressing solid heterogeneous propellant system to examine the consistency of the coupled thermomechanical GFEM solver. The overall accuracy (spatial and temporal) of the coupled thermomechanical solver for regressing solid propellants is obtained from a periodic sandwich propellant configuration, where the effects of thermomechanical deformations on its regression rate is investigated. Finally, the effects of thermomechanical deformations in a regressing two-dimensional heterogeneous propellant pack are studied and time-average regression rates are reported.
An Efficient Approach for Service Process Reconfiguration in SOA with End-to-End QoS Constraints
Authors: Kwei-Jay Lin, Jing Zhang, Yanlong Zhai
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Using SOA, service processes can be composed statically or dynamically using services provided by different service providers. Some services may become faulty at runtime and cause the service process to violate the end-to-end quality of service (QoS) constraint. We propose an efficient approach for replacing faulty services to ensure that the reconfigured service process still meets the original end-to-end QoS constraint. We use an iterative algorithm to identify reconfiguration regions that have a small number of services, some faulty and some healthy, in order to have more service selection options. By reconfiguring services in these selected regions rather than the whole service process, the computational complexity is significantly reduced. Simulation study has shown that our approach is efficient as most service processes can be repaired by replacing only a small number of services.
Local Search Heuristics for the Multidimensional Assignment Problem
Authors: G. Gutin, D. Karapetyan
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

The Multidimensional Assignment Problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with three instance families are provided and discussed. As a result, we select dominating local search heuristics. One of the most interesting conclusions is that combination of two heuristics may yield a superior heuristic with respect to both solution quality and the running time.
Topology Control in Wireless Sensor Networks
Authors: Nitin Choubey, Shrisha Rao
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

The main goal of topology control in wireless sensor networks is to reduce interference between competing signals and thus extend the battery life of sensor devices by minimizing retransmission of data. This paper proposes an algorithm, Low Bounded Interference Control, to minimize the lower and upper bounds on interference. The lower bound refers to the degree of any node, while the upper bound consists of both degree as well as the size of the critical node set. The critical node set of a node u consists of those nodes that are not its immediate neighbors but can cause interference at node u because u is within their transmission range. Our algorithm uses a robust model for interference measurement, and works well in situations where there is high interference on a node due to its immediate and critical node set. By analyzing the two-dimensional node distribution we show how our algorithm guarantees the construction of a connectivity-preserving topology with minimal interference in polynomial time.
On Several Proofs of the Recognizability Theorem
Authors: Bruno Courcelle
Venue: Proceedings of the 3rd International Conference on Algebraic Informatics (2009)

The lecture has presented and compared several proofs of the fundamental Recognizability Theorem that relates the Monadic Second-order definability of a set of finite graphs or relational structures and its Recognizability, this notion being defined in terms of finite congruences and not in terms of automata. 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
Research on Using Information Technology to Propel and Accelerate Industrialization of Sichuan Province
Authors: Xu Kaixuan, Long Yuting
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

China is on the important accelerating step to industrialization country, taking a new road of industrialization of integrating IT application with industrialization is a very critical job for our economy. In this paper, the original intention and the purpose of the construction of Ministry of Industry and Information Technology of China is analysised firstly, and then the conceivable Point of penetration of using information technology to propel and accelerate industrialization. Then, the marketing opportunities and challenges of effects of using information technology to propel and accelerate industrialization are listed in detail. In the end, with regards to using IT to propel industrialization, basing on the above analysis, the strategy of using information technology to propel and accelerate industrialization of Sichuan Province is expatiated.
Reasoning about bargaining situations
Authors: Dongmo Zhang
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

This paper presents a logical axiomatization of bargaining solutions. A bargaining situation is described in propositional logic and the bargainers' preferences are quantified in terms of the logical structure of the bargaining situation. A solution to the n-person bargaining problems is proposed based on the maxmin rule over the degrees of bargainers' satisfaction. We show that the solution is uniquely characterized by four natural and intuitive axioms as well as three other fundamental assumptions. All the axioms and assumptions are represented in logical statements and most of them have a game-theoretic counterpart. The framework would help us to identify the logical and numerical reasoning behind bargaining processes.
A fully unsupervised word sense disambiguation method using dependency knowledge
Authors: Ping Chen, Wei Ding, Chris Bowes, David Brown
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

Word sense disambiguation is the process of determining which sense of a word is used in a given context. Due to its importance in understanding semantics of natural languages, word sense disambiguation has been extensively studied in Computational Linguistics. However, existing methods either are brittle and narrowly focus on specific topics or words, or provide only mediocre performance in real-world settings. Broad coverage and disambiguation quality are critical for a word sense disambiguation system. In this paper we present a fully unsupervised word sense disambiguation method that requires only a dictionary and unannotated text as input. Such an automatic approach overcomes the problem of brittleness suffered in many existing methods and makes broad-coverage word sense disambiguation feasible in practice. We evaluated our approach using SemEval 2007 Task 7 (Coarse-grained English All-words Task), and our system significantly outperformed the best unsupervised system participating in SemEval 2007 and achieved the performance approaching top-performing supervised systems. Although our method was only tested with coarse-grained sense disambiguation, it can be directly applied to fine-grained sense disambiguation.
A Wearable Fabric Computer by Planar-Fashionable Circuit Board Technique
Authors: Hyejung Kim, Yongsang Kim, Binhee Kim, Hoi-Jun Yoo
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

A method to fabricate circuits on the cloth, planar fashionable circuit board (P-FCB), is proposed. And its applications such as fabric passive elements, user I/O interface, and the fabric package are introduced. The electrical and the mechanical characteristic analysis of P-FCB and the system integration methodology establishment improve the system performance and productivity. A complete wearable system is implemented by P-FCB technology for the continuous sweat monitoring and the RFID tag antenna applications.
Test Data Generation for Derived Types in C Program
Authors: Zheng Wang, Xiao Yu, Tao Sun, Geguang Pu, Zuohua Ding, JueLiang Hu
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Test data generation is one of the important tasks during software testing. This paper proposes an approach to generating test cases automatically for the unit test of C programs with derived types including pointers, structures and arrays. Our approach combines symbolic execution and concrete execution. The approach captures operations on variables precisely by concrete execution, and thus it is capable of handling derived types. Benefited from symbolic execution, accessing variables as array index can be solved by a substitution strategy. The substitution strategy also translates a path constraint involving variables of derived type to the one containing only primitive variables. An implementation of this approach is integrated into our test case generation tool called CAUT 1. Experimental results show that our approach is effective to generate test data for derived types.
Personalized e-Learning System Based on Multi-layer Architecture
Authors: Lan Lina
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Lack of personalized learning is the key shortcoming of traditional e-Learning system. This paper analyzes the personal characters in e-Learning activity and presents an innovative design of e-Learning system to fully support these personal characters. This new system is user-centric and provides interactive actions with user based on user's learning archive information. This design solution employs multi-layer architecture based on Web including presentation layer, service layer and resource layer. The service layer is divided into business service layer and common service layer that improve the software reusability. It provides the individuation information filtration function which makes the system more intelligent and personalized. The software architecture is implemented in a real system using Struts + Spring + Hibernate framework which is cross-operating system, cross-database, and cross-application server.
Inter-and intra-subjective planes of e-argumentation: motivation, self-perception, expectations, and actual interlocutory behavior
Authors: Baruch B. Schwarz, Christa S. C. Asterhan, Armin Weinberger, Karsten Stegmann, Frank Fischer, Astrid Wichmann, Andreas Harrer, H. Ulrich Hoppe
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

Research on learning and argumentation traditionally focuses on the (socio-) cognitive dimensions and benefits of argumentative dialogue. The papers which are part of this symposium, however, present recent research on intra-personal, non-cognitive variables and how they affect or are affected by electronic collective argumentation. The data are obtained from both e-discussants as well as e-moderators and pertain to factors such as motivation, self-perception, role definitions and expectations. The three contributions provide information on these factors before, during and after e-discussions and help delving in the dynamics of (moderated) e-argumentation.
Domain Ontology Learning from Websites
Authors: Yu Zhao, Jianqiang Li
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

This paper proposes a novel method to learn light-weight domain ontology from the Web. To create ontology (semi-) automatically has been a challenging and critical problem to make Semantic Web come true. Many methods have been reported on ontology learning from the Web by analyzing the page contents. However, they are not applicable for learning ontology from organization websites, where the description of a concept or an individual is distributed across multiple web pages, and the ontological information can only be discovered by considering website structure. We propose a website structure based method to extract organizational ontology from organization websites. Multiple organizational ontology of the same domain can be merged into domain ontology. This method employs both the intra-page and inter-page hierarchical relations hidden in website structure for ontology learning. The empirical experiments show the effectiveness of this approach.
A Lightweight Buffer Overflow Protection Mechanism with Failure-Oblivious Capability
Authors: Tz-Rung Lee, Kwo-Cheng Chiu, Da-Wei Chang
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Buffer overflow has become a major source of network security vulnerability. Traditional schemes for detecting buffer overflow attacks usually terminate the attacked service, degrading the service availability. In this paper, we propose a lightweight buffer overflow protection mechanism that allows continued network service. The proposed mechanism allows a service program to reconfigure itself to identify and protect the vulnerable functions upon buffer overflow attacks. Protecting only the vulnerable functions, instead of the whole program, keeps the runtime overhead small. Moreover, the mechanism adopts the idea of failure-oblivious computing to allow service programs to execute through memory errors caused by the attacks once the vulnerable functions have been identified, eliminating the need of restarting the service program upon further attacks to the vulnerable functions. We have applied the mechanism on five Internet servers. The experiment results show that the mechanism has little impact on the runtime performance.
A Generic Framework of Integrating Segmentation and Registration
Authors: Jonghyun Park, Wanhyun Cho, Soonyoung Park, Junsik Lim, Soohyung Kim, Gueesang Lee
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

We propose an integrated framework that can simultaneously segment and register a set of medical images using a geometric active model and a pseudo-likelihood method. First, we segment given medical volume data using a fast matching and geometric deformable model and extract a surface of an object from the segmented volume data. Second, we use the hidden Markov random field model and the pseudo-likelihood method to statistically model the intensity distribution of each voxel at the surface region. We adopt the Bernoulli probability model to formulate a prior distribution of the labeling variable for the transformed voxels. The Gaussian mixture model is taken as a probability distribution function for the intensity of the transformed voxel. We use the deterministic annealing EM (DAEM) algorithm to get the proper estimators for the parameters of the complete-data log likelihood function. Then, we define a new registration measure with the maximization function, called Q-function, obtained by the DAEM algorithm. We evaluate the precision of the proposed approach by comparing the registration traces of our measure with other measures such as Mutual Information or Cross Correlation for the original image and its transformed image with respect to translation and rotation. The experimental results show that our method has great potential power to segment and register various medical images given by different modalities.
Improved Parameter Estimation for Completely Observed Ordinary Differential Equations with Application to Biological Systems
Authors: Peter Gennemark, Dag Wedelin
Venue: Proceedings of the 7th International Conference on Computational Methods in Systems Biology (2009)

We consider parameter estimation in ordinary differential equations (ODEs) from completely observed systems, and describe an improved version of our previously reported heuristic algorithm (IET Syst. Biol., 2007). Basically, in that method, estimation based on decomposing the problem to simulation of one ODE, is followed by estimation based on simulation of all ODEs of the system.The main algorithmic improvement compared to the original version, is that we decompose not only to single ODEs, but also to arbitrary subsets of ODEs, as a complementary intermediate step. The subsets are selected based on an analysis of the interaction between the variables and possible common parameters.We evaluate our algorithm on a number of well-known hard test problems from the biological literature. The results show that our approach is more accurate and considerably faster compared to other reported methods on these problems. Additionally, we find that the algorithm scales favourably with problem size.
The Design of People Management System in the Residential Area Base on RFID
Authors: Luo Hui
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Radio frequency identification (RFID) system is a high efficient information collection system. It consists of two major components, one is reader and the other is tag. If it can be used in the management of the people in the Residential Area, the effect is great. In this paper, the hardware and software design of the RFID system used in people management in the Residential Area are given, the reader, the tag and wireless network connection scheme are designed in details.
On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
Authors: Naomi Benger, Manuel Charlemagne, David Mandell Freeman
Venue: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009)

Let A be an abelian variety defined over a non-prime finite field ${\mathbb F}_{q}$ that has embedding degree k with respect to a subgroup of prime order r. In this paper we give explicit conditions on q, k, and r that imply that the minimal embedding field of A with respect to r is ${\mathbb F}_{q^k}$. When these conditions hold, the embedding degree k is a good measure of the security level of a pairing-based cryptosystem that uses A.We apply our theorem to supersingular elliptic curves and to supersingular genus 2 curves, in each case computing a maximum ρ-value for which the minimal embedding field must be ${\mathbb F}_{q^k}$. Our results are in most cases stronger (i.e., give larger allowable ρ-values) than previously known results for supersingular varieties, and our theorem holds for general abelian varieties, not only supersingular ones.
Listega: list-based steganography methodology
Authors: Abdelrahman Desoky
Venue: International Journal of Information Security (2009)

The use of textual list of items, e.g., products, subjects, books, etc., is widely popular and linguistically legible. This motivates the development of List-Based Steganography Methodology (Listega). Listega takes advantage of such use of textual list to camouflage data by exploiting itemized data to conceal messages. Simply, it encodes a message then assigns it to legitimate items in order to generate a text-cover in a form of list. The generated list of items, the text-cover, can be embedded among other legitimate noncoded items for more protection based on a predetermined protocol among communicating parties such as read every other item, every fifth item, or any other way than the use of particular sequence. Listega neither hides data in a noise (errors) nor produces noise. Instead, it camouflages data by manipulating noiseless list of legitimate items. Listega establishes a covert channel among communicating parties by employing justifiably reasons based on the common practice of using textual list of items in order to achieve unsuspicious transmission of generated covers. The presented implementation, validation, and steganalysis of Listega demonstrate: the robustness capabilities of achieving the steganographic goal, the adequate room for concealing data, and the superior bitrate of roughly 1.32 up to 3.87% than contemporary linguistic steganography approaches.
2D Partial Similarity Estimation Based on Energy Segmentation - I: Segmentation
Authors: Ye Xiaoping, Zhang Mabiao, Liu Yusheng
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

How to perform partial similarity between models is still an open issue and attracts many attentions. Segmentation is regarded as one of the most critical and prospective steps for overcoming the task. An energy based segmentation approach for 2D curve is proposed in this paper. A curve is regarded as an elastic stripline(like spring) which has the balanced state and unbalanced state. Once it lies on the unbalanced state such as a spring elongated or compressed, it will possess the potential energy. Then the segmentation can be performed smoothly based on the energy and its attribute. Important is that no thresholds are required to initially determine the segmentation compared with the other methods. Also the proposed algorithm has several important and interesting properties such as robustness, independence,invariance and efficiency.
Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus
Authors: Luís Dominguez
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We characterise type structurally the termination observational congruence of Abadi and Cardelli’s S8 calculus. Pitts’ operational reasoning approach for polymorphic lambda calculi is enhanced with subtyping and primitive covariant object types. Labelling each object with a bound ordinal of terminating method invocations and regarding !-bounded as unlabelled reduction we achieve a crucial object unwinding lemma. Value and term bisimilarities are suitably defined with novel type structural operators and (type-, relation- and value- environment) bindings. We prove term bisimilarity complete and sound with respect to observational congruence, postulated as the largest, substitutive, compatible, (termination) adequate and (type) subsumptive, well typed term relation.