ppxscal/embedding_network huggingface dataset:
Modeling semiconductor testing job scheduling and dynamic testing machine configuration
Authors: Jei-Zheng Wu, Chen-Fu Chien
Venue: Expert Systems with Applications: An International Journal (2008)

The overall flow of the final test of integrated circuits can be represented by the job shop model with limited simultaneous multiple resources in which various product mixes, jobs recirculation, uncertain arrival of jobs, and unstable processing times complicate the problem. Rather than relying on domain experts, this study aims to develop a hybrid approach including a mathematical programming model to optimize the testing job scheduling and an algorithm to specify the machine configuration of each job and allocate specific resources. Furthermore, a genetic algorithm is also developed to solve the problem in a short time for implementation. The results of detailed scheduling can be graphically represented as timetables of testing resources in Gantt charts. The empirical results demonstrated viability of the proposed approach.
Mathematical Analysis of Models for Tumour Angiogenesis
Authors: Akisato Kubo
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

We deal with well known two mathematical models of tumour angiogenesis. We first review the solvability and the asymptotic profile of the solution to a parabolic ODE system proposed by Othmer and Stevens. Next we consider the model of tumour induced angiogenesis by Anderson and Chaplain in the same line. We modify Anderson and Chaplain model to the same type system of Othmer and Stevens model. This implies a similarity between these models and we can show the existence of global solutions and numerical simulations of Anderson and Chaplain model by using such similarity.
An Efficient Feature Selection Using Hidden Topic in Text Categorization
Authors: Zhiwei Zhang, Xuan-Hieu Phan, Susumu Horiguchi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Text categorization is an important research area in information retrieval. In order to save the storage space and get better accuracy, efficient and effective feature selection methods for reducing the data before analysis are highly desired. Usually, researches on feature selection use only a proper measurement such as information gain. In this paper, we propose a new feature selection method by adopting an attractive hidden topic analysis and entropy-based feature ranking. Experiments dealing with the well-known Reuters-21578 and Ohsumed datasets show that our method can achieve a better classification accuracy while reducing the feature dimension dramatically.
Intuitionistic fuzzy numbers and it's applications in fuzzy optimization problem
Authors: Hassan Mishmast Nehi, Hamid Reza Maleki
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper we introduce the trapezoidal intuitionistic fuzzy numbers and prove some operation for them. Also we introduce the intuitionistic fuzzy optimization problem by application of the membership and non-membership functions.
On Spherical Averages of Radial Basis Functions
Authors: B. J. C. Baxter
Venue: Foundations of Computational Mathematics (2008)

A radial basis function (RBF) has the general form $$s(x)=\sum_{k=1}^{n}a_{k}\phi(x-b_{k}),\quad x\in\mathbb{R}^{d},$$ where the coefficients a 1,&#x2026;,a n are real numbers, the points, or centres, b 1,&#x2026;,b n lie in &#x211d; d , and &#x03c6;:&#x211d; d &#x2192;&#x211d; is a radially symmetric function. Such approximants are highly useful and enjoy rich theoretical properties; see, for instance (Buhmann, Radial Basis Functions: Theory and Implementations, [2003]; Fasshauer, Meshfree Approximation Methods with Matlab, [2007]; Light and Cheney, A&#x00a0;Course in Approximation Theory, [2000]; or Wendland, Scattered Data Approximation, [2004]). The important special case of polyharmonic splines results when &#x03c6; is the fundamental solution of the iterated Laplacian operator, and this class includes the Euclidean norm &#x03c6;(x)=&#x2016;x&#x2016; when d is an odd positive integer, the thin plate spline &#x03c6;(x)=&#x2016;x&#x2016;2log&#x2009;&#x2016;x&#x2016; when d is an even positive integer, and univariate splines. Now B-splines generate a compactly supported basis for univariate spline spaces, but an analyticity argument implies that a nontrivial polyharmonic spline generated by (1.1) cannot be compactly supported when d>1. However, a pioneering paper of Jackson (Constr. Approx. 4:243&#x2013;264, [1988]) established that the spherical average of a radial basis function generated by the Euclidean norm can be compactly supported when the centres and coefficients satisfy certain moment conditions; Jackson then used this compactly supported spherical average to construct approximate identities, with which he was then able to derive some of the earliest uniform convergence results for a class of radial basis functions. Our work extends this earlier analysis, but our technique is entirely novel, and applies to all polyharmonic splines. Furthermore, we observe that the technique provides yet another way to generate compactly supported, radially symmetric, positive definite functions. Specifically, we find that the spherical averaging operator commutes with the Fourier transform operator, and we are then able to identify Fourier transforms of compactly supported functions using the Paley&#x2013;Wiener theorem. Furthermore, the use of Haar measure on compact Lie groups would not have occurred without frequent exposure to Iserles&#x2019;s study of geometric integration.
Using wavelets based on B-splines for calculation of the Hankel transform
Authors: E. B. Postnikov
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

The purpose of this paper is to represent the integral Hankel transform as a series. If one uses B-spline wavelet this series is a linear combination of the hypergeometrical functions. Numerical evaluation of the test function with known analytical Hankel transform of the null kind illustrates the proposed results.
A strategy of automatic hexahedral mesh generation by using an improved whisker-weaving method with a surface mesh modification procedure
Authors: Yasumi Kawamura, Md. Shahidul Islam, Yoichi Sumi
Venue: Engineering with Computers (2008)

One of the demands for three dimensional (3D) finite element analyses is the development of an automatic hexahedral mesh generator. For this problem, several methods have been proposed by many researchers. However, reliable automatic hexahedral mesh generation has not been developed at present. In this paper, a new strategy of fully automatic hexahedral mesh generation is proposed. In this strategy, the prerequisite for generating a hexahedral mesh is a quadrilateral surface mesh. From the given surface mesh, combinatorial dual cycles (sheet loops for the whisker-weaving algorithm) are generated to produce a hexahedral mesh. Since generating a good quality hexahedral mesh does not depend only on the quality of quadrilaterals of the surface mesh but also on the quality of the sheet loops generated from it, a surface mesh modification method to remove self-intersections from sheet loops is developed. Next, an automatic hexahedral mesh generator by the improved whisker-weaving algorithm is developed in this paper. By creating elements and nodes on 3D real space during the weaving process, it becomes possible to generate a hexahedral mesh with fewer bad-quality elements. Several examples will be presented to show the validity of the proposed mesh generation strategy.
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
Authors: H.J. Sander Bruggink
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite 'creation chains', that is chains of edges in different graphs of the reduction sequence, such that each edge is involved in creating the next edge. In our approach, the length of such creation chains is recorded by associating with each edge label a creation depth, which denotes the minimal length of a creation chain from an edge in the initial graph to that edge. We develop an algorithm which can prove the absence of such infinite chains (and therefore termination), analyse problems of the approach and propose possible solutions.
Parallelization, performance analysis, and algorithm consideration of Hough transform on chip multiprocessors
Authors: Wenlong Li, Yen-Kuang Chen
Venue: ACM SIGARCH Computer Architecture News (2008)

This paper presents a parallelization framework for emerging applications on the future chip multiprocessors (CMPs). With the continuing prevalence of CMP and the number of on-die cores increasing steadily for the foreseeable future, one key issue in harnessing the computation power of such a CMP is how to effectively manage and execute many threads at the same time. Hence, we study a parallelization framework, which includes (1) coarse-grain and fine-grain multi-threading, (2) performance analysis, and (3) algorithms changes. In particular, this paper shows how the Hough Transform can be parallelized, as an example. Starting with a sports soccer analysis workload that heavily uses Hough Transform to detect lines in sports soccer field, we extract the coarse-grain data-level parallelism and examine its scaling performance on an 8-core symmetric multiprocessor machine. After realizing the parallel performance limiting factors, we target to exploit the fine-grain data-level parallelism and evaluate its speedup on the 8-core machine and a simulated 64-core CMP. Due to parallel overhead and demanding memory requirements, this fine-grain parallelization doesn't contribute significant performance improvement. After that, we propose a new Hough Transform, and parallelize it in a fine-grain way. Experimental data shows that the new Hough Transform exposes a significant amount of concurrency and pretty good data locality. On the simulated 64-core CMP, we achieve parallel scaling of 61.7x, enabling real-time Hough Transform.
MPOE Based Prefiltering and MRT Beamforming with Matched Filter Receiver for DS-CDMA Systems
Authors: G. Kannan, Mohit Garg, S. N. Merchant, U. B. Desai
Venue: Wireless Personal Communications: An International Journal (2008)

In order to reduce the complexity of the mobile receiver, we develop two prefilter models using a linear FIR prefilter for minimizing the probability of error in multi-user transmission scenario. We consider downlink transmission. In the first system model, we have a single common prefilter for all users at the base station transmitter and in the second system model, we consider an individual prefilter for each and every user. We assume complete knowledge of the channel at the base station. In order to fully utilize the knowledge available at the transmitter, the filter weights are computed, conditioned on the transmitted bit vector sequence. This also makes the computation of the prefilter coefficients linear in the number of users as opposed to the exponential complexity otherwise. Coefficients of FIR prefilter are computed by minimizing the conditional probability of error and the mean square error. To further improve the performance of the proposed models, we consider Maximum Ratio Transmission (MRT) beamforming at the base station for both the models. Simulation results illustrate the performance of the proposed system models.
Some existence and construction results of polygonal designs
Authors: Gargi Bhattacharyya, John Hegeman, Joohyung Kim, Jeff Langford, Sung Y. Song
Venue: European Journal of Combinatorics (2008)

This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons). We present new polygonal designs with various parameter sets by explicit construction. In doing so we employ several construction methods - some conventional and some new. We also establish a link between a class of polygonal designs of block size 3 and the cyclically generated '@l-fold triple systems'. Finally, we show that the existence question for a certain class of polygonal designs is equivalent to the existence question for 'perfect grouping systems' which we introduce.
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
Authors: Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan
Venue: Journal of Graph Theory (2000)

A graph is Y&Delta;Y-reducible if it can be reduced to a vertex by a sequence of series-parallel reductions and Y&Delta;Y-transformations. Terminals are distinguished vertices, that cannot be deleted by reductions and transformations. In this article, we show that four-terminal planar graphs are Y&Delta;Y-reducible when at least three of the vertices lie on the same face. Using this result, we characterize Y&Delta;Y-reducible projective-planar graphs. We also consider terminals in projective-planar graphs, and establish that graphs of crossing-number one are Y&Delta;Y-reducible. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 8393, 2000
A robust face detection method using probability maps
Authors: Miki Matsumoto, Osamu Uchida, Shohachiro Nakanishi
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

Face detection plays an important role in various applications, such as face recognition, video surveillance, and human-computer interface. In the present paper, we propose a new face detection method using the probability maps. The basic concept of the proposed method involves the use of the property of the deviation of the position of the complex region and flat region of the face. Experimental results indicate that the proposed method is more robust with respect to variation of scale and rotation compared to conventional method.
A Decision Tree Approach to Conducting Dynamic Assessment in a Context-Aware Ubiquitous Learning Environment
Authors: Shu-Hsien Huang, Ting-Ting Wu, Hui-Chun Chu, Gwo-Jen Hwang
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

The advance of communication and sensor technologies have lead to a new research issue in education, that is, the development of an authentic learning environment with personalized supports from the learning system. In the meantime, it also becomes a challenging and interesting issue to assess the learning achievement of the students in such an authentic learning environment. In this paper, a decision tree-based dynamic assessment strategy for authentic learning is proposed, which is able to guide to learn to identify the plant features during the assessment process. To evaluate the effectiveness of the innovative approach, an assessment activity has been conducted on the “Host Plants of Butterflies” unit of the K 4-th Natural Science course in Taiwan. From the results of interviewing five students, it can be seen that the innovative approach had a positive effect on the motivation of these students.
Privacy-preserving Protocols for Finding the Convex Hulls
Authors: Qi Wang, Yonglong Luo, Liusheng Huang
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Secure Multi-party Computation (SMC) has been a research forcus in international cryptography community in recent years. SMC deals with the following situation: Two (or many) parties want to jointly perform a computation without disclosing their private inputs. Privacy-preserving convex hulls problem is a special case of SMC and it can be applied in many fields such as military and commercial fields. In this paper, we first present two privacy-preserving protocols to solve the convex hulls problem by using Yao's millionaire protocol. We also discuss the security. correctness and performance of the two protocols. Based on the Euclid-distance Measure Protocol, an approximate solution to the convex hulls problem is proposed for fairness, which conceals more private information.
Hindering Reverse Engineering: Thinking Outside the Box
Authors: Thomas E. Dube, Bobby D. Birrer, Richard A. Raines, Rusty O. Baldwin, Barry E. Mullins, Robert W. Bennington, Christopher E. Reuter
Venue: IEEE Security and Privacy (2008)

Protecting application software from reverse engineering and piracy is key to ensuring the integrity of intellectual property and critical infrastructures. Unorthodox protection strategies can help mitigate these types of attacks. Such strategies must include random, dynamic protections to complicate the ease with which attackers can overcome standard approaches.
SEU Vulnerability of Multiprocessor Systems and Task Scheduling for Heterogeneous Multiprocessor Systems
Authors: Makoto Sugihara
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Utilizing a heterogeneous multiprocessor system has become a popular design paradigm to build an embedded system at a cheap cost within short development time. A reliability issue for embedded systems, which is vulnerability to single event upsets (SEUs), has become a matter of concern as technology proceeds. This paper presents robustness of heterogeneous multiprocessor systems to SEUs and proposes task scheduling for minimizing SEU vulnerability of them. This paper experimentally shows that increasing performance of a CPU core deteriorates its reliability. Based on the experimental observation, we propose task scheduling for reducing SEU vulnerability of a heterogeneous multiprocessor system. The experimental results demonstrate that our task scheduling technique can reduce much of SEU vulnerability under real-time constraints.
Distributed Computing Economics
Authors: Jim Gray
Venue: Queue (2008)

Computing economics are changing. Today there is rough price parity between: (1) one database access; (2) 10 bytes of network traffic; (3) 100,000 instructions; (4) 10 bytes of disk storage; and (5) a megabyte of disk bandwidth. This has implications for how one structures Internet-scale distributed computing: one puts computing as close to the data as possible in order to avoid expensive network traffic.
Cross-layer design to improve elastic traffic performance in WLANs
Authors: Stephane Lohier, Yacine Ghamri Doudane, Guy Pujolle
Venue: International Journal of Network Management (2008)

In this paper, we are interested in improving TCP flow performance when a short loss of 802.11 signal leads to losing segments and triggers inappropriately TCP congestion control mechanisms. A set of measurements in a common wireless environment with signal losses due to mobility or interference is made to highlight the distinct MAC and TCP loss recovery levels and the lack of interactions between them. Initially, we demonstrate the interest of adapting the 802.11 MAC layer Retry Limit parameter in the case of signal losses due to distance or obstacles (mobility). Thus, a first-level loss differentiation algorithm (LDA) acting at the MAC layer is proposed to improve TCP flow performance in the case of segment losses due to mobility. Hence, for a signal failure, the MAC layer reacts consequently by dynamically adapting the Retry Limit parameter. This adaptation allows avoiding a costly end-to-end TCP loss recovery. Segment losses due to interference are differentiated from those due to congestion through the use of a second-level LDA. The latter is a cross-layer LDA acting at the TCP layer but using a specific 802.11 parameter, the AckFailureCount, to realize the targeted loss differentiation. The TCP NewReno version is then adapted in order to integrate the cross-layer LDA results and to avoid reducing the TCP congestion window unsuitably. The efficiency and completeness of a solution integrating both LDA schemes is then discussed.
Testing the integrity of some cavity -- the Cauchy problem and the range test
Authors: Peter Jakubik, Roland Potthast
Venue: Applied Numerical Mathematics (2008)

For a number of applications testing the structural integrity of some cavity is of importance. A particular application we have in mind is the monitoring of the structural integrity of the fusion reactor ITER by electromagnetic waves, but the methods developed in this work can be applied to a collection of rather general settings. We use the solution of the Cauchy problem by potential methods and the range test to test the integrity of the boundary of some cavity using acoustic waves. The main idea of this approach is to test whether the scattered field can be analytically extended into the interior of some test domains and to calculate this extension. If the extension is possible, then we might reconstruct the field either by the inversion of Green's formula, a Green's approach incorporating the Dirichlet-to-Neumann map or a single-layer approach. If it is not the case, then the integral equations which arise from these approaches do not have solutions and we prove that in principle we can test this by observing the norm of the reconstruction density. As an alternative new approach to the range test we show that also the approximation error can be used as a discriminating criterion. We will show numerical results for the above cases, which provide a prove of concept to show the practicability of the method. For our application, the approximation error has turned out to be a more precise indicator for some singularity than the norm of the approximation density.
The first terrestrial laser scanner application over Vesuvius: High resolution model of a volcano crater
Authors: A. Pesci, F. Loddo, D. Conforti
Venue: International Journal of Remote Sensing (2007)

This paper deals with terrestrial long-range laser scanner applications, gives an overview of topics related to this methodology, provides real and tested information about laser scanners, and analyses the reflectance of different materials. After positive results obtained during an experimental test executed in Bologna (Italy) on March 2005, the INGV (Bologna, Italy) and CODEVINTEC srl (Milan, Italy) planned a mission over the Mount Vesuvius volcano (Naples, Italy). For the first time, a wide crater area composed of low reflectivity materials was completely surveyed, creating a very accurate digital surface model. In this work, a long-range laser scanner was used to create high-precision surveys that demonstrated very low residual values in scan comparisons. The results lead to the conclusion that this methodology is suitable for surface monitoring proposals.
Towards consistency in interactive storytelling: Tension arcs and dead-ends
Authors: Leandro Motta Barros, Soraia Raupp Musse
Venue: Computers in Entertainment (CIE) (2008)

Interactive storytelling (IS) systems are an emerging class of interactive entertainment applications with an emphasis on narrative aspects. One of the approaches used to develop IS applications is based on planning algorithms. This article describes two mechanisms that can be introduced to planning-based IS in order to solve two problems that are inherent in this approach. The first is a technique to control the pace at which a story evolves, so that the story that is generated follows a specific tension arc. The second is a method that makes it possible to avoid dead-ends in a story by intervening to justify previous events. These mechanisms help to produce a more enjoyable user experience, since their use tends to result in stories with higher narrative consistency. Results from experiments with users suggest that the proposed mechanisms improve both of the aspects addressed by this article.