ppxscal/embedding_network huggingface dataset:
3D Reconstruction Approach Based on Neural Network
Authors: Haifeng Hu, Zhi Yang
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this paper, a new 3D reconstruction approach in neuro-vision system is presented. Firstly, RBF network (RBFN) is used to provide effective methodologies for solving camera calibration and stereo rectification problems. RBFN works mainly in two aspects: (1) a RBFN is adopted to learn and memorize the nonlinear relationship in stereovision system; (2) another RBFN is trained to search the correspondent lines in two images such that stereo matching could be performed in one dimension. Secondly, a new matching method based on Hopfield neural network (HNN) is presented. The energy function is built on the basis of uniqueness, compatibility and similarity constraints. It is then mapped onto a 2-D neural network for minimization, whose final stable state indicates the possible correspondence of the matching units. The depth map can be acquired through performing the above operation on the all epipolar lines. Experiments have been performed on common stereo pairs and the results are accurate and convincing.
A Receiver-Based Opportunistic Forwarding Protocol for Mobile Sensor Networks
Authors: Lian Li, Limin Sun, Jian Ma, Canfeng Chen
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In mobile sensor networks, the mobility of nodes leads to frequent changes of network topology, therefore the communication links between source nodes and Sink vary dynamically. The Receiver based Routing protocols do not need to establish global routing between source nodes and Sink, but allow the neighbor nodes of the sender to contend for the forwarding right under certain rules, and only the contention winner has the right to forward data. Existing Receiver-based Routing protocols can be applied to the mobile sensor networks, but they suffer from some disadvantages in the fields of forwarding priority calculation, data collisions, multicast suppression and routing void. A Receiver based Opportunistic Forwarding protocol (ROF) was proposed in this paper. The ROF protocol optimized the forwarding priority calculation, and designed a dual-channel based forwarding right contention mechanism, which dealt with the data collision and multicast suppression problem better, and put forward an efficient mechanism for routing void bypass. The simulation results show that ROF is excellent in the aspects of communication consumption, forwarding delay and reliability.
Stability of a star-shaped coupled network of strings and beams
Authors: Xu Gen Qi, Nikos E. Mastorakis
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

In this paper we study the solvability and stability of a star-shaped coupled network of strings and Euler-Bernoulli beams with damping. Suppose that the exterior vertices of the coupled network are clamped and at common node there is a damping. Under certain condition we show that the system is asymptotically stable.
Plenary lecture III: an integrating view on DNA computing and membrane computing
Authors: Rudolf Freund
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

In the area of molecular computing, the two fields of DNA computing and membrane computing are dealing with different operations and objects, yet both based on biological processes. In this paper, the similaritiesbetween these two approaches are considered from a theoretical point of view, and the possibilities to transfertheoretical results from one area to the other one are exhibited.
On reverse engineering an object-oriented code into UML class diagrams incorporating extensible mechanisms
Authors: Vinita, Amita Jain, Devendra K. Tayal
Venue: ACM SIGSOFT Software Engineering Notes (2008)

Reverse engineering is the key idea for reconstruction of any existing system. In this paper, we propose an algorithm to reverse engineer an object-oriented code into Unified Modeling Language (UML) class diagram. Our algorithm is very general in nature and can be applied to any object-oriented code irrespective of the object-oriented programming language. In our paper we consider an object-oriented pseudocode similar to C++ to implement our algorithm. Some of the researchers have dealt in the past the problem of reverse engineering an object-oriented code to UML class diagrams. However, none of these researchers have treated all the constructs available in UML class diagrams. Unlike the previously done work on reverse engineering into UML, our algorithm generates rules for a complete set of constructs available in UML class diagrams. It includes classes, relationships, objects, attributes, operations, inheritance, associations, interfaces & other extensible mechanisms also. This algorithm can be viewed as a solution to reverse engineer any available object-oriented software. An application for the implementation of above said rules using C++ code is also included in the paper. We thoroughly compare our work with the similar type of earlier work in this area and uncover the deficiencies in these previous available works. Moreover our motive in this paper is to prepare rules to reverse engineer C++ code into UML class diagrams and not to generate any tools.
Gateway Zone Multi-path Routing in Wireless Mesh Networks
Authors: Eric Hsiao-Kuang Wu, Wei-Li Chang, Chun-Wei Chen, Kevin Chihcheng Hsu
Venue: Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing (2007)

Internet and multimedia services are widely-provided in All-IP based networks. There has been growing demand for mobile users to get those services. The Wireless Mesh Network (WMN) extends communication range and provides Internet connectivity to mobile users with low upfront investment. In WMN, the traffic usually passes through the gateway and makes it become the common destination of the traffic. Conventional multipath routing protocols in the ad hoc networks do not allow intermediate nodes to reply the route request messages, so the flooding messages make the area near the gateway become congested and degrade the performance. In this paper, we proposed Gateway Zone Multi-path Routing (GZMR) protocol. GZMR uses node around the gateway to form a Gateway Cooperative Zone and ceases the routing control messages flooding from outside the zone. Border nodes in the zone can help replying gateway information to reduce route discovery delay. Our simulation results show that by lowering routing overheads and utilizing multiple paths from source to gateway, GZMR can shorten average end-to-end delay and improve the packet delivery in WMNs.
Coalition formation and teamwork in embodied agents
Authors: Ladislau Boloni
Venue:  (2007)

Embodied agents are agents acting in the physical world, such as persons, robots, unmanned air or ground vehicles and so on. These types of agents are subject to spatio-temporal constraints, which do not exist for agents acting in a virtual environment. The movement of embodied agents is limited by obstacles and maximum velocity, while their communication is limited by the transmission range of their wireless devices. This dissertation presents contributions to the techniques of coalition formation and teamwork coordination for embodied agents. We considered embodied agents in three different settings, each of them representative of a class of practical applications. First, we study coalition formation in the one dimensional world of vehicles driving on a highway. We assume that vehicles can communicate over short distances and carry agents which can advise the driver on convoy formation decisions. We introduce techniques which allow vehicles to influence the speed of the convoys, and show that this yields convoys which have a higher utility for the participating vehicles. Second, we address the problem of coalition formation in the two dimensional world. The application we consider is a disaster response scenario. The agents are forming coalitions through a multi-issue negotiation with spatio-temporal components where the coalitions maintain a set of commitments towards participating agents. Finally, we discuss a scenario where embodied agents form coalitions to optimally address dynamic, non-deterministic, spatio-temporal tasks. The application we consider is firefighters acting in a disaster struck city.
Electrical properties of room temperature sputtered Y2O3and MOSFET characteristics
Authors: Young-Je Cho, Ji-Hoon Shin, Jae-Kyu Lee, Young-Bae Kim, Duck-Kyun Choi
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

We closely evaluated the properties of Y2O3 deposited by RF sputter system at room temperature for the application to a transparent thin film transistor. Although the leakage current density hardly depends on the deposition conditions, the dielectric strength turned out to be sensitive. The optimized film showed leakage current density of 7.5 × 10-9 A/cm2 at 2MV/cm, dielectric constant of 16, and the breakdown field over 3 MV/cm. It also showed more than 90% of transparency in the visible light range. Furthermore, we fabricated transistors by using room temperature Y2O3 and InGaZnO and evaluated the transistor performance. The transistor revealed on/off ratio of 7.5×105, Vth of 0∼0.5 V, subthreshold swing (SS) of 2.6 V/decade, and the apparent effective field mobility of ∼3 cm2/Vs.
Enhancing State-Space Tree Diagrams for Collaborative Problem Solving
Authors: Steven L. Tanimoto
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

State-space search methods in problem solving have often been illustrated using tree diagrams. We explore a set of issues related to coordination in collaborative problem solving and design, and we present a variety of interactive features for state-space search trees intended to facilitate such activity. Issues include how to show provenance of decisions, how to combine work and views produced separately, and how to represent work performed by computer agents. Some of the features have been implemented in a kit "TStar" and a design tool "PRIME Designer."
Guess-and-Determine Algebraic Attack on the Self-Shrinking Generator
Authors: Blandine Debraize, Louis Goubin
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

The self-shrinking Generator (SSG) was proposed by Meier and Staffelbach at Eurocrypt'94. Two similar guess-and-determine attacks were independently proposed by Hell-Johansson and Zhang-Feng in 2006, and give the best time/data tradeoff on this cipher so far. These attacks do not depend on the Hamming weight of the feedback polynomial (defining the LFSR in SSG).In this paper we propose a new attack strategy against SSG, when the Hamming weight is at most 5. For this case we obtain a better tradeoff than all previously known attacks (including Hell-Johansson and Zhang-Feng). Our main idea consists in guessing some information about the internal bitstream of the SSG, and expressing this information by a system of polynomial equations in the still unknown key bits. From a practical point of view, we show that using a SAT solver, such as MiniSAT, is the best way of solving this polynomial system.Since Meier and Staffelbach original paper, avoiding low Hamming weight feedback polynomials has been a widely believed principle. However this rule did not materialize in previous recent attacks. With the new attacks described in this paper, we show explicitly that this principle remains true.
The Unbalance of Set Systems
Authors: Nathan Lemons, Cory Palmer
Venue: Graphs and Combinatorics (2008)

The unbalance of an intersecting family $${\mathcal{F}}F$$is defined as $$|{\mathcal{F}}| - d({\mathcal{F}})$$, where $$d({\mathcal{F}})$$is the maximum degree of $${\mathcal{F}}$$i.e. the maximum of $$|\{F \in {\mathcal{F}} : x \in F\}|$$over all vertices x. We show that the unbalance of a k-uniform intersecting family is at most $$\binom{n-3}{k-2}$$when n &#x2265;&#x00a0;6k 3 and we determine all families achieving this bound.
Modeling Students' Natural Language Explanations
Authors: Albert Corbett, Angela Wagner, Sharon Lesgold, Harry Ulrich, Scott Stevens
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Intelligent tutoring systems have achieved demonstrable success in supporting formal problem solving. More recently such systems have begun incorporating student explanations of problem solutions. Typically, these natural language explanations are entered with menus, but some ITSs accept open-ended typed inputs. Typed inputs require more work by both developers and students and evaluations of the added value for learning outcomes has been mixed. This paper examines whether typed input can yield more accurate student modeling than menu-based input. This paper examines the application of Knowledge Tracing student modeling to natural language inputs and examines the standard Knowledge Tracing definition of errors. The analyses indicate that typed explanations can yield more predictive models of student test performance than menu-based explanations and that focusing on semantic errors can further improve predictive accuracy.
Multivariate statistical monitoring of continuous wastewater treatment plants
Authors: Daniel Aguado, Christian Rosen
Venue: Engineering Applications of Artificial Intelligence (2008)

In this paper, different multivariate statistical approaches for analysing wastewater treatment process data are presented and compared. For this purpose, all the methods have been tested using one-year operational data in a simulation model benchmark. The general monitoring strategy adopted includes a screening stage to improve data quality, an adaptive model to detect and diagnose abnormal events, and two complementary tools for helping in the diagnosis of the faults. The first one is based on the development of a local model that captures the most recent process behaviour and the second one on the application of fuzzy c-means clustering to the scores of the monitoring model. The results have shown that simple scaling parameters adaptation is sufficient to obtain a model useful for monitoring the process during the whole period. Monitoring the deviations from the average daily behaviour showed clear detections of the disturbances in the Hotelling's T^2-statistic and this feature was useful to determine different operational states (disturbances) in the process by clustering the PCA scores. On the other hand, the proposed procedure for isolation based on a local model improved the diagnosis results in terms of the responsible variables identified and the indication of the beginning of the fault.
The Power of Counting Logics on Restricted Classes of Finite Structures
Authors: Anuj Dawar, David Richerby
Venue: Proceedings of the 21st international workshop and the 16th Annual Conference of the EACSL on Computer Science Logic (2007)

Although Cai, Fürer and Immerman have shown that fixed-point logic with counting (IFP+C) does not express all polynomial-time properties of finite structures, there have been a number of results demonstrating that the logic does capture P on specific classes of structures. Grohe and Mariño showed that IFP+C captures P on classes of structures of bounded treewidth, and Grohe showed that IFP+C captures P on planar graphs. We show that the first of these results is optimal in two senses. We show that on the class of graphs defined by a non-constant bound on the tree-width of the graph, IFP+C fails to capture P. We also show that on the class of graphs whose local tree-width is bounded by a non-constant function, IFP+C fails to capture P. Both these results are obtained by an analysis of the Cai---Fürer---Immerman (CFI) construction in terms of the treewidth of graphs, and cops and robber games; we present some other implications of this analysis. We then demonstrate the limits of this method by showing that the CFI construction cannot be used to show that IFP+C fails to capture P on proper minor-closed classes.
Modeling VaR in Crude Oil Market: A Multi Scale Nonlinear Ensemble Approach Incorporating Wavelet Analysis and ANN
Authors: Kin Keung Lai, Kaijian He, Jerome Yen
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Price fluctuations in the crude oil markets worldwide have attracted significant attentions from both, industries and academics, due to their profound impact on businesses and governments. Proper measurement and management of risks due to unexpected price movements in the markets has been crucial from both, operational and strategic perspectives. However, risk measurements from current approaches offer insufficient explanatory power and performance due to the complicated non-linear nature of risk evolutions. This paper adopts a VaR approach to measure risks and proposes multi-scale non-linear ensemble approaches to model the risk evolutions in WTI crude oil market. The proposed WDNEVaR follows a semi-parametric paradigm, incorporating both, wavelet analysis and artificial neural network techniques. Experiment results from empirical studies suggest that the proposed WDNEVaR is superior to traditional approaches. It provides VaR estimates of higher reliability and accuracy. It also brings significantly more flexibility during the modeling attempts.
A Topology Control Algorithm with Respect to Dynamic Spectrum Management in Wireless Video Sensor Network
Authors: Dong Liu, Shengsen Lin, Qihui Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Dynamic spectrum management (DSM) is a key feature for enhancing cooperation in wireless video sensor network (WVSN) towards supporting communication of high data-rate video information. Unlike traditional spectrum allocation, DSM in WVSN should have topology control and distributed control center. In this paper, we propose an ILST algorithm for constructing distributed DSM topology control with the use of information locally collected. Theoretical analysis and simulation results show that the proposed algorithm has low complexity and fast convergent speed, and is valuable on constructing distributed DSM topology in WVSN.
Maximum entropy approach for batch-arrival queue under N policy with an un-reliable server and single vacation
Authors: Jau-Chuan Ke, Chuen-Horng Lin
Venue: Journal of Computational and Applied Mathematics (2008)

We consider the M^[^x^]/G/1 queueing system, in which the server operates N policy and a single vacation. As soon as the system becomes empty the server leaves for a vacation of random length V. When he returns from the vacation and the system size is greater than or equal to a threshold value N, he starts to serve the waiting customers. If he finds fewer customers than N. he waits in the system until the system size reaches or exceeds N. The server is subject to breakdowns according to a Poisson process and his repair time obeys an arbitrary distribution. We use maximum entropy principle to derive the approximate formulas for the steady-state probability distributions of the queue length. We perform a comparative analysis between the approximate results with established exact results for various batch size, vacation time, service time and repair time distributions. We demonstrate that the maximum entropy approach is efficient enough for practical purpose and is a feasible method for approximating the solution of complex queueing systems.
User Modelling for Interactive User-Adaptive Collection Structuring
Authors: Andreas Nürnberger, Sebastian Stober
Venue: Adaptive Multimedial Retrieval: Retrieval, User, and Semantics: 5th International Workshop, AMR 2007, Paris, France, July 5-6, 2007 Revised Selected Papers (2007)

Automatic structuring is one means to ease access to document collections, be it for organization or for exploration. Of even greater help would be a presentation that adapts to the user's way of structuring and thus is intuitively understandable. We extend an existing user-adaptive prototype system that is based on a growing self-organizing map and that learns a feature weighting scheme from a user's interaction with the system resulting in a personalized similarity measure. The proposed approach for adapting the feature weights targets certain problems of previously used heuristics. The revised adaptation method is based on quadratic optimization and thus we are able to pose certain contraints on the derived weighting scheme. Moreover, thus it is guaranteed that an optimal weighting scheme is found if one exists. The proposed approach is evaluated by simulating user interaction with the system on two text datasets: one artificial data set that is used to analyze the performance for different user types and a real world data set --- a subset of the banksearch dataset --- containing additional class information.
Do Base Functional Component Types Affect the Relationship between Software Functional Size and Effort?
Authors: Cigdem Gencel, Luigi Buglione
Venue: Software Process and Product Measurement: International Conference, IWSM-Mensura 2007, Palma de Mallorca, Spain, November 5-8, 2007. Revised Papers (2007)

One of the most debated issues in Software Engineering is effort estimation and one of the main points is about which could be (and how many) the right data from an historical database to use in order to obtain reliable estimates. In many of these studies, software size (measured in either lines of code or functional size units) is the primary input. However, the relationship between effort and the components of functional size (BFC --- Base Functional Components) has not yet been fully analyzed. This study explores whether effort estimation models based on BFCs types, rather than those based on a single total value, would improve estimation models. For this empirical study, the project data in the International Software Benchmarking Standards Group (ISBSG) Release 10 dataset, which were functionally sized by the COSMIC FFP method, are used.
Robust Population Coding in Free-Energy-Based Reinforcement Learning
Authors: Makoto Otsuka, Junichiro Yoshimoto, Kenji Doya
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

We investigate the properties of free-energy-based reinforcement learning using a new experimental platform called the digit floor task. The simulation results showed the robustness of the reinforcement learning method against noise applied in both the training and testing phases. In addition, reward-dependent and reward-invariant representations were found in the distributed activation patterns of hidden units. The representations coded in a distributed fashion persisted even when the number of hidden nodes were varied.