ppxscal/embedding_network huggingface dataset:
A New Method Multi-Factor Trend Regression and its Application to Economy Forecast in Jiangxi
Authors: Yuechao Ding
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The principle of a new method called Trend Regression is introduced and applied to the economy forecast of Jiangxi Province. The method improved previous time series forecasting method in which only self-extension is done and multiple factors (variables) are not taken into consideration. Also, it got over the weakness of forecasting by general regression analysis that relies on simultaneous independent variables. A time series is the function of multiple factors. The values (independent variables) in a period may affect the value (dependent variable) to be predicated in the next period. The nearer the sample time to the predicted time, the more important the sample to the predict value. By shifting the dependent variable to establish models, sequential regression and prediction can be realized. In this way the trend of information can be mined. Key Words: Economy Forecast; Time Series; Trend Regression
Proceedings of the 13th international symposium on 3D web technology
Venue: 3D technologies for the World Wide Web (2008)

We are delighted to welcome you to Web3D 2008, the thirteenth Symposium on 3D Web Technologies this year taking place in Los Angeles. Continuing the tradition of bringing together academia and industry to collaborate and to share their research and production knowledge for innovative Web 3D systems the papers cover a wide range of Web3D related topics, from foundation (such as modeling, rendering and interface) to applications in cultural heritage and medicine, as well as emerging technologies such as 3D Web technologies for mobile devices. We received 37 paper submissions, which were reviewed by an International Program Committee with 40 members and by the 2 editors. Very strict selection rules have been applied in this blind reviewing process, and only 16 papers (9 full papers and 7 short papers) have been accepted (i.e., a 57% rejection rate or a 24% acceptance rate for full papers), leading to a very high quality program. As has been the case in previous years, this is a truly international event. This year's program brings together authors and committee members from all over the world. As such, it is a prime opportunity for the community to meet, develop ideas, and chart roadmaps for future standardization efforts. In addition to the contributed papers, we are proud to present David Luebke, Nvidia Research as our keynote speaker. The abstract of his presentation, entitled 'The Present & Future of Web3D' appears hereafter.
Making Statistics Part of Decision Making in an Engineering Organization
Authors: David N. Card, Kevin Domzalski, Glyn Davies
Venue: IEEE Software (2008)

This article describes the experience of deploying statistical analysis techniques at BAE Systems Network Systems, a software and systems development organization. It outlines the techniques implemented, deployment methods, and results obtained. It discusses the challenges encountered and strategies for overcoming them.
Robust discrimination under a hierarchy on the scatter matrices
Authors: Ana Bianco, Graciela Boente, Ana M. Pires, Isabel M. Rodrigues
Venue: Journal of Multivariate Analysis (2008)

Under normality, Flury and Schmid [Quadratic discriminant functions with constraints on the covariances matrices: some asymptotic results, J. Multivariate Anal. 40 (1992) 244-261] investigated the asymptotic properties of the quadratic discrimination procedure under hierarchical models for the scatter matrices, that is: (i) arbitrary scatter matrices, (ii) common principal components, (iii) proportional scatter matrices and (iv) identical matrices. In this paper, we study the properties of robust quadratic discrimination rules based on robust estimates of the involved parameters. Our analysis is based on the partial influence functions of the functionals related to these parameters and allows to derive the asymptotic variances of the estimated coefficients under models (i)-(iv). From them, we conclude that the asymptotic variances verify the same order relations as those obtained by Flury and Schmid [Quadratic discriminant functions with constraints on the covariances matrices: some asymptotic results, J. Multivariate Anal. 40 (1992) 244-261] for the classical estimators. We also perform a Monte Carlo study for different sample sizes and different hierarchies which shows the advantage of using robust procedures over classical ones, when anomalous data are present. It also confirms that better rates of misclassification can be achieved if a more parsimonious model among all the correct ones is used instead of the standard quadratic discrimination.
The complexity of the Hajos calculus
Authors: T. Pitassi
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The Hajos construction is a simple, nondeterministic procedure for generating the class of graphs that are not 3-colorable. A.J. Mansfield and D.J.A. Welsh have posed the problem of proving whether or not there exists a polynomial-size Hajos construction for every non-3-colorable graph. The main result of this paper is a proof that the Hajos calculus is polynomially-bounded if and only if extended Frege proof systems are polynomially bounded. This result links an open problem in graph theory to an important open problem in the complexity of propositional proof systems. In addition, the authors establish an exponential lower bound for a strong subsystem of the Hajos calculus. Lastly, they discuss an interesting graph-theoretical consequence of this result.
Automatic Segmentation of Micro-calcification Based on SIFT in Mammograms
Authors: Qiu Guan, Jianhua Zhang, Shengyong Chen, Andrew Todd-Pokropek
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Manual segmentation of micro-calcifications in mammogram can provide clinicians with useful information, such as an estimation of the quantification and the size of abnormalities. However, it is a time and labour consuming process. Automatic segmentation has the potential to assist both in the diagnosis of the disease and in treatment planning. This paper presents a novel mammogram image segmentation algorithm that makes use of Scale Invariant Feature Transform (SIFT) to compute the key point in the suspicious area of the mammograms. A database from MIAS is used in this approach. Initial results are presented to show that SIFT can be used to by computing the key-points to segment micro-calcifications of the mammograms. Further work will focus on finding the ways to set the threshold of the segmentation automatically.
Evaluation of some integrals of sums involving the Möbius function
Authors: Tadej Kotnik
Venue: International Journal of Computer Mathematics (2007)

Integrals of sums involving the Möbius function appear in a variety of problems. In this paper, a divergent integral related to several important properties of the Riemann zeta function is evaluated computationally. The order of magnitude of this integral appears to be compatible with the Riemann hypothesis, and furthermore the value of the multiplicative constant involved seems to be the smallest possible. In addition, eleven convergent integrals representing Tauberian constants that characterize the relations between certain summation methods are evaluated computationally to five or more digits of precision.
Ruggedness analysis of 3.3kV high voltage diodes considering various buffer structures and edge terminations
Authors: B. Heinze, J. Lutz, H. P. Felsl, H. -J. Schulze
Venue: Microelectronics Journal (2008)

Buffer structures and edge termination have a decisive influence on the static and dynamic characteristics of free-wheeling diodes. In this paper the influence of buffer structures at the cathode side, the influence of the design of the edge termination and of a resistive zone at the anode side are analysed with respect to the ruggedness of free-wheeling diodes. Therefore, we investigated the device behaviour by means of numerical device simulation concerning the formation of current filamentation and the correlated shape of the electrical field distribution. The considered edge termination of the diodes was planar junction termination extensions and a beveled edge. Various buffer structures, a Gaussian buffer and a buried n-doped layer of increased doping called epitaxy level buffer are compared with a reference diode without any buffer structure.
Learning Techniques to Train Neural Networks as a State Selector in Direct Power Control of DSTATCOM for Voltage Flicker Mitigation
Authors: Mehdi Karami, Heidar Ali Shayanfar, Ali Ghobadi Tapeh, Siamak Bandari
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Neural networks are receiving attention as controllers for many industrial applications. Although these networks eliminate the need for mathematical models, they require a lot of training to understand the model of a plant or a process. Issues such as learning speed, stability, and weight convergence remain as areas of research and comparison of many training algorithms. This paper discusses the application of neural networks to control DSTATCOM using direct power control (DPC). A neural network is used to emulate the state selector of the DPC. The training algorithms used in this paper are the adaptive neuron model and the extended Kalman filter. Computer simulations of the DPC with neural network system using the abovementioned algorithms are presented and compared. Discussions about the adaptive neuron model and the extended Kalman filter algorithms as the most promising training techniques are presented, giving their advantages and disadvantages.
Enhanced 1-NN time series classification using badness of records
Authors: Khandoker Tarik-Ul Islam, Kamrul Hasan, Young-Koo Lee, Sungyoung Lee
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Time series classification has recently been addressed by a wide range of researchers, for its application in variety of fields. Many algorithms have been proposed. Until now, 1-NN (one-nearest-neighbor) using Dynamic Time Warping (DTW) for distance measurement has been proven to be the best technique to produce the maximum accurate result. In this paper we present the idea of bad records that have the tendency to misclassify other records. To evade the misclassification by these bad records, we propose an enhanced 1-NN algorithm for time series classification that properly handles the badness of records without escalating the time complexity of the technique. As a result the accuracy of 1-NN using DTW is further improved. Experimental results show that the error rate can be minimized up to 100% in some cases.
A numerical study of the influence of slip boundary condition on rotating flow
Authors: T. Hayat, S. Abelman
Venue: International Journal of Computational Fluid Dynamics (2007)

A numerical solution is obtained for the steady flow of an electrically conducting non-Newtonian incompressible fluid past a plate. The flow is analysed under condition where the no-slip assumption between the plate and the fluid is no longer valid. The fluid under consideration obeys the rheological equations of state due to a third-grade fluid. The fluid is conducting in the presence of a uniform magnetic field under a small magnetic Reynolds number. The solution of the nonlinear equations of motion is obtained using MATLAB®. The effects of the slip, third-grade parameter and magnetic field on the velocity distribution are presented graphically and discussed.
Design migration from peripheral ASIC design to area-I/O flip-chip design by chip I/O planning and legalization
Authors: Chia-Yi Chang, Hung-Ming Chen
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Due to higher input/output (I/O) count and power delivery problem in deep submicrometer (DSM) regime, flip-chip technology, especially for area-array architecture, has provided more opportunities for adoption than traditional peripheral bonding design style in high-performance application-specific integrated circuit and microprocessor designs. However, it is hard to tell which technique can provide better design cost edge in usually concerned perspectives. In this paper, we present a methodology to convert a previous peripheral bonding design to an area-I/O flip-chip design. It is based on an I/O buffer modeling and an I/O planning algorithm to legalize I/O buffer blocks with core placement without sacrificing much of the previous optimization in the original core placement. The experimental results have shown that we have achieved better area and I/O wirelength in area-IO flip-chip configuration (especially for pad-limit designs), compared with peripheral bonding configuration in packaging consideration.
An inexpensive, off-the-shelf platform for networked embedded robotics
Authors: M. Bordignon, E. Pagello, A. Saffiotti
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Recent years have witnessed the proliferation of a new class of devices, commonly referred to as Networked Embedded Devices. Their increasingly low cost and small size make them suited for large scale sensing applications. Likewise, they could be appealing as a means to embed intelligent actuation capabilities into the environment, turning simple artifacts into networked robotic appliances. The currently existing devices, however, are not suited for this development. In this paper, we present the PEIS-Mote: an open, general, small-size and inexpensive sensor-actuator node especially suited for networked robotics, and built from commonly available off-the-shelf components. This platform can run a popular operating system for sensor networks, TinyOS, which makes it interoperable with most commercially available sensor nodes.
Discrete approximation to the global spectrum of the tangent operator for flow past a circular cylinder
Authors: J. I. H. Lopez, J. R. Meneghini, F. Saltara
Venue: Applied Numerical Mathematics (2008)

This paper deals with the calculation of the discrete approximation to the full spectrum for the tangent operator for the stability problem of the symmetric flow past a circular cylinder. It is also concerned with the localization of the Hopf bifurcation in laminar flow past a cylinder, when the stationary solution loses stability and often becomes periodic in time. The main problem is to determine the critical Reynolds number for which a pair of eigenvalues crosses the imaginary axis. We thus present a divergence-free method, based on a decoupling of the vector of velocities in the saddle-point system from the vector of pressures, allowing the computation of eigenvalues, from which we can deduce the fundamental frequency of the time-periodic solution. The calculation showed that stability is lost through a symmetry-breaking Hopf bifurcation and that the critical Reynolds number is in agreement with the value presented in reported computations.
Eudaemon: involuntary and on-demand emulation against zero-day exploits
Authors: Georgios Portokalidis, Herbert Bos
Venue: ACM SIGOPS Operating Systems Review (2008)

Eudaemon is a technique that aims to blur the borders between protected and unprotected applications, and brings together honeypot technology and end-user intrusion detection and prevention. Eudaemon is able to attach to any running process, and redirect execution to a user-space emulator that will dynamically instrument the binary by means of taint analysis. Any attempts to subvert control flow, or to inject malicious code will be detected and averted. When desired Eudaemon can reattach itself to the emulated process, and return execution to the native binary. Selective emulation has been investigated before as a mean to heal an attacked program or to generate a vaccine after an attack is detected, by applying intensive instrumentation to the vulnerable region of the program. Eudaemon can move an application between protected and native mode at will, e.g., when spare cycles are available, when a system policy ordains it, or when it is explicitly requested. The transition is performed transparently and in very little time, thus incurring minimal disturbance to an actively used system Systems offering constant protection against similar attacks have also been proposed, but require access to source code or explicit operating system support, and often induce significant performance penalties We believe that Eudaemon offers a flexible mechanism to detect a series of attacks in end-user systems with acceptable overhead. Moreover, we require no modification to the running system and/or installation of a hypervisor, with an eye on putting taint analysis within reach of the average user.
Osteoinductive Observation for BMP-2 Gene Modification of Mesenchymal Stem Cells Combined with Plasma-sprayed Hydroxyapatite Coating
Authors: Jiang Wu, Ying-qiang Guo, Guang-fu Yin, Huai-qing Chen, Yunqing Kang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Success in bone implant depends greatly on the composition and surface features of the implant.The surface-modification measures not only favor implant’s osteoconductivity, but promote both bone anchoring and biomechanical stability.This paper reports an approach to combine a hydroxyapatite (HA) coated substrate with a cellular vehicle for delivery of bone morphogenetic protein-2 (BMP-2) so that synergistically enhancing the osteoconductivity of implant surfaces. First, we examined the in vitro attachment growth and osteoinductive activity of transfected BMP-producing bone marrow mesenchymal stem cells (BMSCs) on a plasma sparyed HA coated substrate. Second, the osteointegrate efficacy of the combined method of BMP-2 gene delivery and HA coated scaffold in vivo was evaluated using a rat model. It was found that the HA coated substrate could allow the attachment and growth of BMP-2 transfected BMSCs, and this combined application synergistically augmented osteoinductive ability of the substrate suface . In vivo, the HA coated substrates successfully functioned as a suface enhancement plate for bioactive BMP-2 release, as they both elevated bone anchoring and biomechanical stability in a rat model.
Minimizing a monotone concave function with laminar covering constraints
Authors: Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
Venue: Discrete Applied Mathematics (2008)

Let V be a finite set with |V|=n. A family F@?2^V is called laminar if for all two sets X,Y@?F, X@?YR"+, and a monotone concave cost function F:R"+^V->R"+, we consider the problem of finding a minimum-cost x@?R"+^V such that x(X)>=d(X) for all X@?F. Here we do not assume that the cost function F is differentiable or even continuous. We show that the problem can be solved in O(n^2q) time if F can be decomposed into monotone concave functions by the partition of V that is induced by the laminar family F, where q is the time required for the computation of F(x) for any x@?R"+^V. We also prove that if F is given by an oracle, then it takes @W(n^2q) time to solve the problem, which implies that our O(n^2q) time algorithm is optimal in this case. Furthermore, we propose an O(nlog^2n) algorithm if F is the sum of linear cost functions with fixed setup costs. These also make improvements in complexity results for source location and edge-connectivity augmentation problems in undirected networks. Finally, we show that in general our problem requires @W(2^n^/^2q) time when F is given implicitly by an oracle, and that it is NP-hard if F is given explicitly in a functional form.
Precise failure localization using automated layout analysis of diagnosis candidates
Authors: Wing Chiu Tam, Osei Poku, R. D. Shawn Blanton
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Traditional software-based diagnosis of failing chips typically identifies several lines where the failure is believed to reside. However, these lines can span across multiple layers and can be very long in length. This makes physical failure analysis difficult. In contrast, there are emerging diagnosis techniques that identify both the faulty lines as well as the neighboring conditions for which an affected line becomes faulty. In this paper, an approach is presented to improve failure localization by automatically analyzing the information associated with the outcome of diagnosis. Experimental results show a significant improvement in failure localization when this method is applied to 106 real IC failures.
Generalized penetration depth for penalty-based six-degree-of-freedom haptic rendering
Authors: Maxim Kolesnikov, Miloš Žefran
Venue: Robotica (2008)

Existing penalty-based haptic rendering approaches are based on the penetration depth estimation in strictly translational sense and cannot properly take object rotation into account. We propose a new six-degree-of-freedom (6-DOF) haptic rendering algorithm which is based on determining the closest-point projection of the inadmissible configuration onto the set of admissible configurations. Energy is used to define a metric on the configuration space. Once the projection is found the 6-DOF wrench can be computed from the generalized penetration depth. The space is locally represented with exponential coordinates to make the algorithm more efficient. Examples compare the proposed algorithm with the existing approaches and show its advantages.
A combinatorial approach to multi-domain sketch recognition
Authors: A. Hall, C. Pomm, P. Widmayer
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

In this paper we propose a combinatorial model for sketch recognition. Two fundamental problems, the evaluation of individual symbols and the interpretation of a complete sketch scene possibly containing several symbols, are expressed as combinatorial optimization problems. We settle the computational complexity of the combinatorial problems and present a branch and bound algorithm for computing optimal symbol confidences. To handle sketch scenes in practice we propose a modest restriction of drawing freedom and present an algorithm which only needs to compute a polynomial number of symbol confidences.
Programming Languages For Interactive Computing
Authors: Roly Perera
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination. By contrast most applications are interactive: they maintain ongoing interactions with their environments. Modern systems address this incompatibility by manually extending the execution model of the host language to support interaction, usually by embedding an event-driven state management scheme which executes fragments of imperative code in response to interactions, the job of each executed fragment being to restore the internal consistency of the computation. The downside of this approach to interaction is that it relies heavily on mutable stores and side-effects and mixes application logic in with behaviour which is more properly the responsibility of an execution model. I describe a programming model called declarative interaction which supports interaction directly. The distinguishing feature of the model is its modal construal of state and interaction.
Node-to-Set Disjoint Paths Routing in Dual-Cube
Authors: Keiichi Kaneko, Shietung Peng
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

In this paper, we propose an efficient algorithm that finds disjoint paths for node-to-set routing in dual-cube. Dual-cube is a hypercube-like interconnection network with about half of links per node compared with the hypercube containing equal number of nodes. For a dual-cube Dn with n links per node, the algorithm finds n disjoint paths, s -> ti, 1