ppxscal/embedding_network huggingface dataset:
The Relationship Between Hierarchical Databases and the Internet Using Titi
Authors: Liang Chen, Li-fang Chen, Jing-hong Fu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The implications of stable epistemologies have been far-reaching and pervasive. The synthesis of red-black trees has been validated in the paper. An atomic tool for investigating Smalltalk (Titi) was described, disconfirming that sensor networks can be made peer-to-peer, stable, and adaptive. Firstly, motivated the need for neural networks, validated the emulation of symmetric encryption. Furthermore, we prove that the well-known adaptive algorithm for the exploration of IPv4 by Sasaki et al. runs in O(n!) time.
An Energy-Efficient and Traffic-Aware CSMA/CA Algorithm for LR-WPAN
Authors: Junkeun Song, Sangcheol Kim, Haeyong Kim, Pyeongsoo Mah
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In this paper, we propose an energy-efficient and traffic-aware CSMA/CA algorithm, referred to as ETCA, that aims to reduce redundant transmission of IEEE 802.15.4 Standard for Low-Rate Wireless Personal Area Networks (LR-WPAN). In Wireless Sensor Networks (WSNs), reducing energy consumption is one of the most important issues because it makes the network life-time longer. Sensor nodes consume most of energy for computing and transmitting operations [1]. Unlike IEEE 802.11, IEEE 802.15.4 MAC doesn't use Request To Send (RTS) and Clear To Send (CTS) frames, and it still has hidden terminal problems. Thus, if there are some hidden nodes, there are many collisions and retransmissions [2]. To reduce retransmission, we improve the carrier sensing features in MAC layer of IEEE 802.15.4. When the network is busy, the MAC detects it and adaptively chooses parameters of CSMA/CA mechanism to minimize collisions and the number of retransmission based on ETCA. We evaluated the proposed scheme with original 802.15.4 MAC on the ns-2 simulator. The results showed that our scheme outperforms the original by 15% in average when there is a retransmission activity.
Research on Customer Classification in E-Supermarket by Using Modified Fuzzy Neural Networks
Authors: Yu-An Tan, Zuo Wang, Qi Luo
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

With the development of network technology and E-commerce, more and more enterprises have accepted the management pattern of E-commerce. In order to meet the personalized needs of customers in E-supermarket, customer classification based on their interests is a key technology for developing personalized E-commerce. Therefore, it is highly needed to have a personalized system for extracting customer features effectively, and analyzing customer interests. In this paper, we proposed a new method based on the modified fuzzy neural network to group the customers dynamically according to their Web access patterns. The results suggest that this clustering algorithm is effective and efficacious. Taking one with another, this new proposed approach is a practical solution to make more visitors become to customers, improve the loyalty degree of customer, and strengthen cross sale ability of websites in E-commerce.
An efficient semi-implicit immersed boundary method for the Navier-Stokes equations
Authors: Thomas Y. Hou, Zuoqiang Shi
Venue: Journal of Computational Physics (2008)

The immersed boundary method is one of the most useful computational methods in studying fluid structure interaction. On the other hand, the Immersed Boundary method is also known to require small time steps to maintain stability when solved with an explicit method. Many implicit or approximately implicit methods have been proposed in the literature to remove this severe time step stability constraint, but none of them give satisfactory performance. In this paper, we propose an efficient semi-implicit scheme to remove this stiffness from the immersed boundary method for the Navier-Stokes equations. The construction of our semi-implicit scheme consists of two steps. First, we obtain a semi-implicit discretization which is proved to be unconditionally stable. This unconditionally stable semi-implicit scheme is still quite expensive to implement in practice. Next, we apply the small scale decomposition to the unconditionally stable semi-implicit scheme to construct our efficient semi-implicit scheme. Unlike other implicit or semi-implicit schemes proposed in the literature, our semi-implicit scheme can be solved explicitly in the spectral space. Thus the computational cost of our semi-implicit schemes is comparable to that of an explicit scheme. Our extensive numerical experiments show that our semi-implicit scheme has much better stability property than an explicit scheme. This offers a substantial computational saving in using the immersed boundary method.
DC bus implemented damping control-part II: battery energy storage systems
Authors: W. Du, H. F. Wang
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Damping torque analysis is a technique developed based on classical control theory for the excitation implemented damping control in power generation, which has been widely used in engineering practice since it was proposed. This paper proposes the damping torque analysis for DC bus implemented damping control in power transmission networks and presents two practical examples. The first example is the investigation of damping effect of shunt VSC (Voltage Source Converter) based FACTS voltage control, i.e., STATCOM (Static Synchronous Compensator) voltage control. It is shown in the paper that STATCOM voltage control only contributes synchronous torque and hence imposes no effect on the damping of power system oscillations. The second example is the damping control implemented by battery Energy Storage Systems (ESS). It is established in the paper that both the interaction between battery ESS damping and voltage control and the robustness of battery ESS damping control to the variations of power flow conditions is different when it is implemented via active and reactive power regulation respectively. In the paper, all conclusions obtained are demonstrated by simulation results of example power systems installed with a STATCOM and a battery ESS separately. The paper is presented in two parts. This is the second part of the paper.
Image Artifact in Digital Breast Tomosynthesis and Its Dependence on System and Reconstruction Parameters
Authors: Yue-Houng Hu, Wei Zhao, Thomas Mertelmeier, Jasmina Ludwig
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Digital breast tomosynthesis (DBT) is a three-dimensional (3D) imaging modality that produces cross-sectional image slices parallel to the detector plane using a limited number of views (<50) and a limited angular range (< 50 degrees). Due to the incomplete sampling of DBT, image artifacts are unavoidable. In this paper we investigated the dependence of out-of-plane image artifact on image acquisition and reconstruction parameters. The image artifact of a microcalcification (MC) was correlated with the 3D point spread function (PSF) of the DBT system, which was calculated using a cascaded linear system model. Our results show that the linear system model can be used to quantitatively predict the image artifact in DBT, and can be used as a unified tool for maximizing lesion detectability and minimizing artifact.
Dendro: parallel algorithms for multigrid and AMR methods on 2:1 balanced octrees
Authors: Rahul S. Sampath, Santi S. Adavani, Hari Sundar, Ilya Lashuk, George Biros
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

In this article, we present Dendro, a suite of parallel algorithms for the discretization and solution of partial differential equations (PDEs) involving second-order elliptic operators. Dendro uses trilinear finite element discretizations constructed using octrees. Dendro, comprises four main modules: a bottom-up octree generation and 2:1 balancing module, a meshing module, a geometric multiplicative multigrid module, and a module for adaptive mesh refinement (AMR). Here, we focus on the multigrid and AMR modules. The key features of Dendro are coarsening/refinement, inter-octree transfers of scalar and vector fields, and parallel partition of multilevel octree forests. We describe a bottom-up algorithm for constructing the coarser multigrid levels. The input is an arbitrary 2:1 balanced octree-based mesh, representing the fine level mesh. The output is a set of octrees and meshes that are used in the multigrid sweeps. Also, we describe matrix-free implementations for the discretized PDE operators and the intergrid transfer operations. We present results on up to 4096 CPUs on the Cray XT3 ("BigBen"), the Intel 64 system ("Abe"), and the Sun Constellation Linux cluster ("Ranger").
Teaching functional programming with soccer-fun
Authors: Peter Achten
Venue: Proceedings of the 2008 international workshop on Functional and declarative programming in education (2008)

In this paper we report on our experience with the functional framework Soccer-Fun, which is a domain specific language for simulating football. It has been developed for an introductory course in functional programming at the Radboud University Nijmegen, The Netherlands. We have used Soccer-Fun in teaching during the past four years. We have also experience in using Soccer-Fun for pupils in secondary education. Soccer-Fun is stimulating because it is about a well known problem domain. It engages students to problem solving with functional programming because it allows them to compete at several disciplines: the best performing football team can become champion of a tournament; the best written code can be awarded with a prize; students can be judged on the algorithms used. This enables every student to participate and perform at her favorite skill. Soccer-Fun is implemented in Clean and uses its GUI toolkit Object I/O for rendering. It can be implemented in any functional programming language that supports some kind of windowing toolkit.
A Data Sanitization Method for Privacy Preserving Data Re-publication
Authors: Joochang Lee, Hyuk-Jin Ko, Eunju Lee, Wongil Choi, Ung-Mo Kim
Venue: Proceedings of the 2008 Fourth International Conference on Networked Computing and Advanced Information Management - Volume 02 (2008)

When a table containing personal information is published, sensitive information should not be revealed. Although k-anonymity and l-diversity models are popular approaches to protect privacy, they are limited to one time data publishing. After a dataset is updated with insertions and deletions, a data holder cannot safely release up-to-date information. Recently, m-invariance model has been proposed to support re-publication of dynamic datasets. However, m-invariance model has two drawbacks. First, the m-invariant generalization can cause high information loss. Second, if the adversary already obtained sensitive values of some individuals before accessing released information, m-invariance leads to severe privacy breaches. In this paper, we propose a new data sanitization technique for safely releasing dynamic datasets. The proposed technique prevents two drawbacks of m-invariance and provides a simple and effective method for handling inserted and deleted records.
Discriminatory Data Mapping by Matrix-Based Supervised Learning Metrics
Authors: M. Strickert, P. Schneider, J. Keilwagen, T. Villmann, M. Biehl, B. Hammer
Venue: Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition (2008)

Supervised attribute relevance detection using cross-comparisons (SARDUX), a recently proposed method for data-driven metric learning, is extended from dimension-weighted Minkowski distances to metrics induced by a data transformation matrix ¿ for modeling mutual attribute dependence. Given class labels, parameters of ¿ are adapted in such a manner that the inter-class distances are maximized, while the intra-class distances get minimized. This results in an approach similar to Fisher's linear discriminant analysis (LDA), however, the involved distance matrix gets optimized, and it can be finally utilized for generating discriminatory data mappings that outperform projection pursuit methods with LDA index. The power of matrix-based metric optimization is demonstrated for spectrum data and for cancer gene expression data.
Data Collection in Wireless Sensor Networks for Noise Pollution Monitoring
Authors: Luca Filipponi, Silvia Santini, Andrea Vitaletti
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

Focusing on the assessment of environmental noise pollution in urban areas, we provide qualitative considerations and experimental results to show the feasibility of wireless sensor networks to be used in this context. To select the most suitable data collection protocol for the specific noise monitoring application scenario, we evaluated the energy consumption performances of the CTP (Collection Tree Protocol) and DMAC protocols. Our results show that CTP, if used enabling the LPL (Low Power Listening) option, provides the better performances trade-off for noise monitoring applications.
A Reasoning Framework for Rule-Based WSML
Authors: Stephan Grimm, Uwe Keller, Holger Lausen, Gábor Nagypál
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

WSML is an ontology language specifically tailored to annotate Web Services, and part of its semantics adheres to the rule-based knowledge representation paradigm of logic programming. We present a framework to support reasoning with rule-based WSML language variants based on existing Datalog inference engines. Therein, the WSML reasoning tasks of knowledge base satisfiability and instance retrieval are implemented through a language mapping to Datalog rules and Datalog querying. Part of the WSML semantics is realized by a fixed set of rules that form meta-level axioms. Furthermore, the framework exhibits some debugging functionality that allows for identifying violated constraints and for pointing out involved instances and problem types. Its highly modular architecture facilitates easy extensibility towards other language variants and additional features. The available implementation of the framework provides the first reasoners for the WSML language.
Obtaining the Inverse Distance Map from a Non-SVP Hyperbolic Catadioptric Robotic Vision System
Authors: Bernardo Cunha, José Azevedo, Nuno Lau, Luis Almeida
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

The use of single viewpoint catadioptric vision systems is a common approach in mobile robotics, despite the constraints imposed by those systems. A general solution to calculate the robot centered distances map on non-SVP catadioptric setups, exploring a back-propagation ray-tracing approach and the mathematical properties of the mirror surface is discussed in this paper. Results from this technique applied in the robots of the CAMBADA team (Cooperative Autonomous Mobile Robots with Advanced Distributed Architecture) are presented, showing the effectiveness of the solution.
Half-band FIR fractional delay filters with closed-form coefficient formulas and modular implementation based on Lagrange interpolators
Authors: Mohammad Mahdi Jahani Yekta
Venue: Signal Processing (2008)

The Taylor series-based representation of the maximally flat (MF) FIR fractional delay (FD) filter is manipulated to obtain a FD filter with a wider band-width. The band-width of the proposed filter can approach @p/2rads/s, which is 1.5 times that of the prototype one. The design has closed-form coefficient formulas as well as a modular implementation. These two properties make it a practically favourable one.
Flexible service provisioning with advance agreements
Authors: Sebastian Stein, Nicholas R. Jennings, Terry R. Payne
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

In this paper, we develop a novel algorithm that allows service consumer agents to automatically select and provision service provider agents for their workflows in highly dynamic and uncertain computational service economies. In contrast to existing work, our algorithm reasons explicitly about the impact of failures on the overall feasibility of a workflow, and it mitigates them by proactively provisioning multiple providers in parallel for particularly critical tasks and by explicitly planning for contingencies. Furthermore, our algorithm provisions only part of its workflow at any given time, in order to retain flexibility and to decrease the potential for missing negotiated service time slots. We show empirically that current approaches are unable to achieve a high utility in such uncertain and dynamic environments; whereas our algorithm consistently outperforms them over a range of environments. Specifically, our approach can achieve up to a 27-fold increase in utility and successfully completes most workflows within a strict deadline, even when the majority of providers do not honour their contracts.
Accessibility of Educational Software: From Evaluation to Design Guidelines
Authors: Serenella Besio, Elena Laudanna, Francesca Potenza, Lucia Ferlino, Federico Occhionero
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Although researches, guidelines and laws have been elaborated during the last years about the accessibility of software, many educational products on the Italian market are still difficult or impossible to be used by students with disabilities. An evaluation grid, designed from the end-user's point of view, has been used with 70 educational software to test the real usability of these products with AT devices. Results show how the problem of accessibility is not yet understood by developers and producers. The purpose of this study was also to rise awareness in teachers about the accessibility topic it should be deleted, so that they increase the request of accessible software that can be used by students with different types of disability. This information is also related to disability issues, to AT devices and to the actual Italian Law.
Navidgator - Similarity Based Browsing for Image and Video Databases
Authors: Damian Borth, Christian Schulze, Adrian Ulges, Thomas M. Breuel
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

A main problem with the handling of multimedia databases is the navigation through and the search within the content of a database. The problem arises from the difference between the possible textual description (annotation) of the database content and its visual appearance. Overcoming the so called - semantic gap - has been in the focus of research for some time. This paper presents a new system for similarity-based browsing of multimedia databases. The system aims at decreasing the semantic gap by using a tree structure, built up on balanced hierarchical clustering. Using this approach, operators are provided with an intuitive and easy-to-use browsing tool. An important objective of this paper is not only on the description of the database organization and retrieval structure, but also how the illustrated techniques might be integrated into a single system.Our main contribution is the direct use of a balanced tree structure for navigating through the database of keyframes, paired with an easy-to-use interface, offering a coarse to fine similarity-based view of the grouped database content.
Using Dynamic Symbolic Execution to Improve Deductive Verification
Authors: Dries Vanoverberghe, Nikolaj Bjørner, Jonathan Halleux, Wolfram Schulte, Nikolai Tillmann
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

One of the most challenging problems in deductive program verification is to find inductive program invariants typically expressed using quantifiers. With strong-enough invariants, existing provers can often prove that a program satisfies its specification. However, provers by themselves do not find such invariants. We propose to automatically generate executable test cases from failed proof attempts using dynamic symbolic execution by exploring program code as well as contracts with quantifiers. A developer can analyze the test cases with a traditional debugger to determine the cause of the error; the developer may then correct the program or the contracts and repeat the process.
Finding Similar Texts Using U-WIN
Authors: Kang-seop Shim, Cheol-Young Ock, Dong-Meong Kim, Ho-Seop Choe, Chang-Hwan Kim
Venue: Proceedings of the 2008 International Conference on Advanced Language Processing and Web Information Technology (2008)

Many researches in foreign country for finding similar texts are in progress using the semantic language resources like WordNet. However, in the domestic situation, the language resources like WordNet are still insufficient and so, researches for finding similar texts methods based on it or the methods for utilizing it are insufficient, too. Most of the previous domestic researches for finding similar texts used only the words that occur in texts. In this paper, we propose the semantic based method of finding similar texts by determining the meaning of the words, using semantic similarity measurement with U-WIN.
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
Authors: André Platzer
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

We combine first-order dynamic logic for reasoning about possible behaviour of hybrid systems with temporal logic for reasoning about the temporal behaviour during their operation. Our logic supports verification of hybrid programs with first-order definable flows and provides a uniform treatment of discrete and continuous evolution. For our combined logic, we generalise the semantics of dynamic modalities to refer to hybrid traces instead of final states. Further, we prove that this gives a conservative extension of dynamic logic. On this basis, we provide a modular verification calculus that reduces correctness of temporal behaviour of hybrid systems to non-temporal reasoning. Using this calculus, we analyse safety invariants in a train control system and symbolically synthesise parametric safety constraints.
Using a Mathematical Programming Modeling Language for Optimal CTA
Authors: Jordi Castro, Daniel Baena
Venue: Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases (2008)

Minimum-distance controlled tabular adjustment methods (CTA) have been formulated as an alternative to the cell suppression problem (CSP) for tabular data. CTA formulates an optimization problem with fewer variables and constraints than CSP. However, the inclusion of binary decisions about protection sense of sensitive cells (optimal CTA) in the formulation, still results in a mixed integer-linear problem. This work shows how mathematical programming modeling languages can be used to develop a prototype for optimal CTA based on Benders method. Preliminary results are reported for some medium size two-dimensional tables. For this type of tables, the approach is competitive with other general-purpose algorithms implemented in commercial solvers.
Ab Initio Quantum Chemical Studies of Six-Center Bond Exchange Reactions Among Halogen and Halogen Halide Molecules
Authors: I. Noorbatcha, B. Arifin, S. M. Zain
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The possibility of six-center bond exchange reaction among halogen and halogen halide molecules is confirmed using ab initio quantum chemical methods. The following reactions: (Cl2)2 + Br2 ¿ 2 BrCl + Cl2; (Cl2)2 + HI ¿ HCl + ICl + Cl2 and (HI)2 + F2 ¿ HF + HI + IF were studied. The energy barrier for these reaction were found to be very low (<7 kcal mol). These results are consistent with the molecular beam results.