ppxscal/embedding_network huggingface dataset:
A Real-Time Ubiquitous System for Assisted Living: Combined Scheduling of Sensing and Communication for Real-Time Tracking
Authors: MinYoung Nam, Mhd Al-Sabbagh, Jung-Eun Kim, Man-Ki Yoon, Chang-Gun Lee, Eun Yong Ha
Venue: IEEE Transactions on Computers (2008)

As the elderly population increases, the elderly care using inexpensive technological means becomes critical. This paper presents our prototype system that provides real-time indoor tracking of elderly residents and their belongings, which is essential to assist and secure their independent living. For high-fidelity real-time tracking, we propose novel scheduling algorithms. Our scheduling algorithms are designed by harmonizing both sensing and communication signals and leveraging location-awareness and mobility-consciousness, in order to improve the tracking accuracy while reducing the energy consumption. We performed extensive experiments through both simulation and actual implementation. Our experimental result says that our scheduling algorithms can provide real-time tracking of residents within 20 cm error bound in the typical range of human mobility.
Visual Enhancement for Sentinel Lymph Node Mapping in Breast Cancer by Multiple Display Formats of SPECT/CT Images
Authors: Jia-Yann Huang, Pan-Fu Kao, Yung-Sheng Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Lymph node status is a main factor in determining the stage, suitable therapy and outcome in patients with breast cancer. It is therefore of clinical importance to accurately identify all sentinel lymph nodes (SLNs) for each individual tumor before surgery. Composite Single-Photon Emission Computed Tomography and Computed Tomography (SPECT/CT) scanner has the great potential to enhance topographic orientation and diagnostic sensitivity of SLN imaging. In this paper, a visual enhancement of sentinel lymph node mapping in breast cancer of SPECT/CT images was proposed. Our approach is based on the isodata histogram thresholding, image fusion, and 3-dimensional (3D) volume rendering. By improving the visual impression of SPECT/CT images, it is useful to help surgeons to precisely locate all SLNs in patients with breast cancer.
Probabilistic deformable models for weld defact contour estimation in radiography
Authors: N. Nacereddine, L. Hamami, D. Ziou, M. Tridi
Venue: Machine Graphics Vision International Journal (2006)

This paper describes a novel method for segmentation of weld defect in radiographic images. Contour estimation is formulated as a statistical estimation problem, where both the contour and the observation model parameters are unknown. Our approach can be described as a region-based maximum likelihood formulation of parametric deformable contours. This formulation provides robustness against the poor image quality, and allows simultaneous estimation of the contour parameters together with other parameters of the model. Implementation is performed by a deterministic iterative algorithm with minimal user intervention. Results testify very good performance of such contour estimation approach.
Modeling of Light Propagation through Biological Tissues: A Novel Approach
Authors: Chintha C. Handapangoda, Malin Premaratne, Leslie Yeo, James Friend
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

An efficient numerical technique for modeling biological tissues using the radiative transfer equation is presented. Time dependence of the transient radiative transfer equation is approximated using Laguerre expansion. Azimuthal angle is discretized using the discrete ordinates method and the resulting set of ordinary differential equations is solved using the Runge-Kutta-Felhberg method.
XML Based 3G/LTE Network and Service Management Concept
Authors: Eero Wallenius, Timo Hämäläinen, Kari Halttunen
Venue: Proceedings of the Seventh International Conference on Networking (2008)

This paper describes a new way of implementing converged wireless network and service management system using XML as the management message language and SOAP/HTTP as the protocols for configuration, performance, fault and alarm communication between network Operation and Maitenance (O&M) system and Network Elements (NE) and service provider's service production systems. Principles described in this article are fully tested and applicable and can be exploited in any current network and service management system.
Radical of weakly ordered semigroup algebras
Authors: M. Schocker
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

We define the notion of weakly ordered semigroups. For this class of semigroups, we compute the radical of the semigroup algebras. This generalizes some results on left regular bands and on 0- Hecke algebras.
Dynamic Voltage and Frequency Scaling Architecture for Units Integration within a GALS NoC
Authors: E. Beigné, F. Clermidy, S. Miermont, P. Vivet
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

In complex embedded applications, optimization and adaptation at run time of both dynamic and leakage power have become an issue at SoC coarse grain. For power reduction, voltage and frequency scaling techniques have been applied successfully to CPUs but never with a generic approach for all IPs within a SoC. Network-on-Chip architecture combined with a Globally Asynchronous Locally Synchronous paradigm is a natural enabler for easy IP unit integration. GALS NoC provides scalable communications and a clear split between timing domains. We propose in this paper a complete Dynamic Voltage and Frequency Scaling architecture for IP units integration within a GALS NOC. The proposed DVFS architecture is based on the association of Local clock generator and VDD-Hopping between two given voltages. No fine control software is required during any voltage and frequency re-programming. As a result, minimal latency cost is observed. The power efficiency of the proposed system has been evaluated close to 95%.
Gap functions for a system of generalized vector quasi-equilibrium problems with set-valued mappings
Authors: Nan-Jing Huang, Jun Li, Soon-Yi Wu
Venue: Journal of Global Optimization (2008)

In this paper, some gap functions for three classes of a system of generalized vector quasi-equilibrium problems with set-valued mappings (for short, SGVQEP) are investigated by virtue of the nonlinear scalarization function of Chen, Yang and Yu. Three examples are then provided to demonstrate these gap functions. Also, some gap functions for three classes of generalized finite dimensional vector equilibrium problems (GFVEP) are derived without using the nonlinear scalarization function method. Furthermore, a set-valued function is obtained as a gap function for one of (GFVEP) under certain assumptions.
Efficient computation of dendritic growth with r-adaptive finite element methods
Authors: Heyu Wang, Ruo Li, Tao Tang
Venue: Journal of Computational Physics (2008)

This paper deals with the application of a moving grid method to the solution of a phase-field model for dendritic growth in two- and three-dimensions. A mesh is found as the solution of an optimization problem that automatically includes the boundary conditions and is solved using a multi-grid approach. The governing equations are discretized in space by linear finite elements and a split time-level scheme is used to numerically integrate in time. One novel aspect of the method is the choice of a regularized monitor function. The moving grid method enables us to obtain accurate numerical solutions with much less degree of freedoms. It is demonstrated numerically that the tip velocity obtained by our method is in good agreement with the previously published results.
Predictive formulae for OPC with applications to lithography-friendly routing
Authors: Tai-Chen Chen, Guang-Wan Liao, Yao-Wen Chang
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Due to the sub-wavelength lithography, manufacturing sub-90 nm feature sizes require intensive use of resolution-enhancement techniques, among which optical proximity correction (OPC) is the most popular technique in industry. Considering the OPC effects during routing can significantly alleviate the cost of post-layout OPC operations. In this paper, we present an efficient, accurate, and economical analytical formula for intensity computation and develop the first modeling of post-layout OPC based on a quasi-inverse lithography technique. Extensive simulations with SPLAT, the golden lithography simulator in academia and industry, show that our intensity formula has high fidelity. Incorporating the OPC costs computed by the quasi-inverse lithography technique for our post-layout OPC modeling into a router, the router can be guided to maximize the effects of the correction. Compared with a rule-based OPC method, the experimental results show that our approach can achieve 14% and 16% reductions in the maximum and average layout distortions, respectively.
An R&D Investment Game under Uncertainty in Real Option Analysis
Authors: Giovanni Villani
Venue: Computational Economics (2008)

One of the problems of using the financial options methodology to analyse investment decisions is that strategic considerations become extremely important. So, the theory of real option games combines two successful theories, namely real options and game theory. The investment opportunity and the value of flexibility can be valued as a real option while the competition can be analyzed with game theory. In our model we develop an interaction between two firms that invest in R D. The firm that invests first, defined as the Leader, acquires a first mover advantage that we assume as a higher share of market. But, several R D investments present positive externalities and so, the option exercise by the Leader generates an "Information-Revelation", that benefits the Follower.
Position location using a minimum square error method: an indoor environment implementation
Authors: Stelios A. Mitilineos, Stelios C. A. Thomopoulos, Dimitrios K. Bougoulias, Christos N. Capsalis
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Wireless position location has received significant attention during the past few years, since it is a key factor to military as well as to commercial applications. Radio frequency (RF) techniques are an attractive alternative to satellite location systems. In this paper, a RF location algorithm is proposed. The algorithm is based on one-to-one mapping of the possible positions of the mobile station to vectors of the signal strength space. Simulation results are extracted and the performance of the algorithm is discussed. A position location system has been implemented for indoor environments and statistical measurements results are presented.
Practical Clock Tree Robustness Signoff Metrics
Authors: Anand Rajaram, Raguram Damodaran, Arjun Rajagopal
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Clock tree analysis and signoff is a key step in the design of any high performance chip. Though simple and intutive metrics like skew have been used to track clock tree quality, they are not sufficient for most practical purposes. Ideally, skew distribution obtained using a SSTA (Statististical Static Timing Analysis) on the clock trees can be used. But in most practical cases, the process information assumed by SSTA is not available. As a result, the signoff of clock skew robustness to variation effects is an often difficult problem to solve. In this work, we propose two metrics that can address this issue. These metrics can be used in three important ways. First, they can be used to determine during CTS whether the clock tree is good enough to go through rest of the backend flow or whether more tuning needs to be done to the clock tree. Second, they can be used to isolate any parts of the clock tree that behaves like a hot spot for clock skew across corners. Third, it can be used as a final signoff metric for clock tree to ensure that the tracking of the delays and skews can be expected to be good across all process points. We provide several experimental results fromindustry testcases demonstrating the utility of our metrics.
Compact Variation-Aware Standard Cell Models for Timing Analysis - Complexity and Accuracy Analysis
Authors: Seyed-Abdollah Aftabjahani, Linda S. Milor
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A compact variation-aware timing model for a standard cellin a cell library is developed using Principal ComponentAnalysis (PCA) and experimental design. The model incorporates variations in the input waveform and loading,process parameters, and the environment into the cell timingmodel. PCA is used to form a compact model of a set ofwaveforms impacted by these sources of variation. Cellcharacterization involves describing how waveforms aretransformed by a cell as a function of the input waveforms,process parameters, and the environment. The models havebeen evaluated by calculating the delay of paths. The results demonstrate improved accuracy in comparison with tablebased static timing analysis at comparable computational cost. Complexity of the models as a function of the number of parameters modeling variation is also discussed.
Clock construction in fully asynchronous parallel systems and PRAM simulation
Authors: Y. Aumann
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors discuss the question of simulating synchronous computations on asynchronous systems. They consider an asynchronous system with very weak, or altogether lacking any, atomicity assumptions. The first contribution of this paper is a novel clock for asynchronous systems. The clock is a basic tool for synchronization in the asynchronous environment. It is a very robust construction and can operate in a system with no atomicity assumptions, and in the presence of a dynamic scheduler. The behavior of the clock is obtained with overwhelming probability (1-2/sup - alpha n/, alpha >0). The authors show how to harness this clock to drive a PRAM simulation on an asynchronous system. The resulting simulation scheme is more efficient than existing ones, while actually relaxing the assumptions on the underlying asynchronous system.
Online auctions and generalized secretary problems
Authors: Moshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg
Venue: ACM SIGecom Exchanges (2008)

We present generalized secretary problems as a framework for online auctions. Elements, such as potential employees or customers, arrive one by one online. After observing the value derived from an element, but without knowing the values of future elements, the algorithm has to make an irrevocable decision whether to retain the element as part of a solution, or reject it. The way in which the secretary framework differs from traditional online algorithms is that the elements arrive in uniformly random order. Many natural online auction scenarios can be cast as generalized secretary problems, by imposing natural restrictions on the feasible sets. For many such settings, we present surprisingly strong constant factor guarantees on the expected value of solutions obtained by online algorithms. The framework is also easily augmented to take into account time-discounted revenue and incentive compatibility. We give an overview of recent results and future research directions.
Error distribution for iterated integrals
Authors: Elise de Doncker, Shujun Li, Karlis Kaugars
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

In earlier work we demonstrated that iterated numerical integration outperforms "standard" multivariate integration techniques for various function classes with singularities inside the domain of integration. We focus on the accuracy requirements to be applied in different directions or combinations of directions of iterated integrals. The integrals are approximated numerically in an "automatic" (black-box) manner, where the user poses an accuracy requirement for the multivariate integral and expects a result within that tolerance. For an iterated integration it is generally accepted that an inner integral should be evaluated more accurately than its outer integrals in order to avoid the impression of roundoff error. We propose techniques for setting the error tolerances in different directionsi and give numerical results.
Model Checking with Graphical Validation Rules
Authors: Sven Feja, Daniel Fötsch
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

The assurance of quality and reliability of process models and workflows is essential for model driven software development. There are numerous ways to achieve these objectives. One is model checking, through which it can be verified that a model satisfies specific logical rules. The model to be checked is usually given as a finite state machine. Rules have to be specified at the level required by the model checker. In this paper, we develop a visual notation for logical rules at the level of processes and workflows. This enables the business process engineer to use model checking techniques and to produce higher quality business models for subsequent software development. The approach is demonstrated by validating event-driven process chains (EPCs).
Performance Modeling and Engineering, 1 edition
Authors: Zhen Liu, Cathy H. Xia, Zhen Liu, Cathy H. Xia
Venue:  (2008)

This book presents the latest advances in methodology and techniques of performance modeling and engineering, ranging from theoretical advances to system and architecture developments, from technology to economics, from academic innovations to engineering processes, from statistical analysis to system control, and from enterprise systems to computer networks. The collection promotes innovative research in these emerging topics, bridging the gap between theory and practice, and stimulating the use of these new developments. Part I focuses on performance design and engineering, introducing new methodologies and considerations including machine learning, network economics, online advertising and performance engineering. Part II concentrates on scheduling and control, covering new developments in Internet traffic routing, network scheduling, and modeling and control of computer systems. Each chapter is self-contained, including both a broad survey of the topic and the technical challenges and solutions.
Manifold alignment using Procrustes analysis
Authors: Chang Wang, Sridhar Mahadevan
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In this paper we introduce a novel approach to manifold alignment, based on Procrustes analysis. Our approach differs from "semi-supervised alignment" in that it results in a mapping that is defined everywhere - when used with a suitable dimensionality reduction method - rather than just on the training data points. We describe and evaluate our approach both theoretically and experimentally, providing results showing useful knowledge transfer from one domain to another. Novel applications of our method including cross-lingual information retrieval and transfer learning in Markov decision processes are presented.
Efficient bandit algorithms for online multiclass prediction
Authors: Sham M. Kakade, Shai Shalev-Shwartz, Ambuj Tewari
Venue: Proceedings of the 25th international conference on Machine learning (2008)

This paper introduces the Banditron, a variant of the Perceptron [Rosenblatt, 1958], for the multiclass bandit setting. The multiclass bandit setting models a wide range of practical supervised learning applications where the learner only receives partial feedback (referred to as "bandit" feedback, in the spirit of multi-armed bandit models) with respect to the true label (e.g. in many web applications users often only provide positive "click" feedback which does not necessarily fully disclose a true label). The Banditron has the ability to learn in a multiclass classification setting with the "bandit" feedback which only reveals whether or not the prediction made by the algorithm was correct or not (but does not necessarily reveal the true label). We provide (relative) mistake bounds which show how the Banditron enjoys favorable performance, and our experiments demonstrate the practicality of the algorithm. Furthermore, this paper pays close attention to the important special case when the data is linearly separable --- a problem which has been exhaustively studied in the full information setting yet is novel in the bandit setting.
Comparative study of SQP and metaheuristics for robotic manipulator design
Authors: Paulo Roberto Bergamaschi, Sezimária de Fátima Pereira Saramago, Leandro dos Santos Coelho
Venue: Applied Numerical Mathematics (2008)

The main goal of this paper is the design of manipulators with three-revolute joints (3R) using an optimization problem that takes into account the characteristics of the workspace. The optimization problem is formulated considering the workspace volume as the objective function. Constraints are added to guarantee the regularity of the envelope and force the workspace to occupy a pre-established area. A comparison among different optimization techniques is developed. The techniques employed are sequential quadratic programming (SQP), genetic algorithms (GAs), differential evolution (DE) and particle swarm optimization (PSO). Numerical examples are presented to validate the proposal methodology.
Comparative study on e-learning for mathematics subjects in two Malaysian smart schools
Authors: S. Palanisamy, A. I. S. Ashour, F. A. M. Elfaki
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

Electronic learning (e-learning) is capable of transforming a marginalized school into a top performing school, it can provide leverage for Malaysian students to have life long learning. The purpose of this experimental research is to find the difference between e-learning and conventional learning in two Malaysian secondary smart schools. E-learning involves electronic media, self-paced and student centered compared with conventional learning method where the students are taught by the teachers and they depend more on teachers for their learning. Mean, T-test, was used as a measurement to find the difference between individuals, groups for both the e-learning and conventional groups and also to find the difference of mean between Form One and Form Two student. The e-learning students have achieved the standard mean level above 0.80 which was set as an excellent score by Malaysian Education Ministry.
Annotated program examples as first class objects in an educational digital library
Authors: Peter Brusilovsky, I-Han Hsiao, Michael V. Yudelson
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper analyzes problems encountered by our team while creating an educational digital library of program examples. We present approaches to resolving these problems, and evaluations of the suggested approaches.
Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
Authors: Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann
Venue: Journal of Combinatorial Theory Series A (2008)

We compute the sharp thresholds on g at which g-large and g-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian. We also identify the threshold below which g-regressive colorings have usual Ramsey numbers, that is, admit homogeneous, rather than just min-homogeneous sets.