ppxscal/embedding_network huggingface dataset:
Background estimation from non-time sequence images
Authors: Miguel Granados, Hans-Peter Seidel, Hendrik P. A. Lensch
Venue: Proceedings of graphics interface 2008 (2008)

We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from the same viewpoint and under similar illumination conditions. Our approach is to define the background as a composite of the input photographs. Each possible composite is assigned a cost, and the resulting cost function is minimized. We penalize deviations from the following two model assumptions: background objects are stationary, and background objects are more likely to appear across the photographs. We approximate object stationariness using a motion boundary consistency term, and object likelihood using probability density estimates. The penalties are combined using an entropy-based weighting function. Furthermore, we constraint the solution space in order to avoid composites that cut through objects. The cost function is minimized using graph cuts, and the final result is composed using gradient domain fusion. We demonstrate the application of our method to the recovering of clean, unoccluded shots of crowded public places, as well as to the removal of ghosting artifacts in the reconstruction of high dynamic range images from multi-exposure sequences. Our contribution is the definition of an automatic method for consistent background estimation from multiple exposures featuring occluders, and its application to the problem of ghost removal in high dynamic range image reconstruction.
Modelling and Simulation of Images by Reciprocal Processes
Authors: Giorgio Picci, Francesca Carli
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

In this paper we propose an approach to image modelling and simulation, by a simple class of linear constant parameter stochastic models known as stationary rciprocal processes. These processes can be seen as a special class of Gibbs-Markov random fields. Stationary reciprocal processes admit constant parameter descriptor type representations of a certain kind which can be seen as a natural non-causal extension of the linear state space models used in time series analysis. Estimation and identification of these models starting from observed data is solvable by fast and efficient numerical techniques. In particular it turns out that the statistical estimation and simulation of stationary reciprocal models leads to an extension problem for symmetric positive-definite block-circulant matrices which can be solved by Fourier methods.
DeFer: deferred decision making enabled fixed-outline floorplanner
Authors: Jackey Z. Yan, Chris Chu
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this paper, we present DeFer --- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing floorplan. To find a good slicing floorplan, instead of searching through numerous slicing trees by simulated annealing as in traditional approaches, DeFer considers only one single slicing tree. However, we generalize the notion of slicing tree based on the principle of Deferred Decision Making (DDM). When two subfloorplans are combined at each node of the generalized slicing tree, DeFer does not specify their orientations, the left-right/top-bottom order between them, and the slice line direction. DeFer even does not specify the slicing tree structures for small subfloorplans. In other words, we are deferring the decisions on these factors, which are specified arbitrarily at an early step in traditional approaches. Because of DDM, one slicing tree actually corresponds to a huge number of slicing floorplan solutions, all of which are efficiently kept in one single shape curve. With the final shape curve, it is straightforward to choose a good floorplan fitting into the fixed outline. Several techniques are also proposed to further optimize the wirelength. Experimental results on benchmarks with only hard blocks and with both hard and soft blocks show that DeFer achieves the best success rate, the best wirelength and the best runtime on average compared with other state-of-the-art floorplanners.
Novel route maintenance protocols for the Bluetooth ad hoc network with mobility
Authors: Prasan Kumar Sahoo, Chih-Yung Chang, Sheng-Wen Chang
Venue: Journal of Network and Computer Applications (2008)

Bluetooth technology is specially designed for the wireless personal area networks to replace cable. Several challenges exist in Bluetooth scatternet formation and routing, since nodes can arrive and depart at arbitrary times. In this paper, novel route maintenance algorithms are proposed for the Bluetooth ad hoc networks, where nodes can enter or exit from the piconets time to time. Our protocols guarantee the connectivity among nodes and reconstruct the routes dynamically by considering location information of the nodes. Besides, it is proposed how to reduce the number of hops and to form the shortest route between the source and the destination due to addition of new nodes to a piconet. Performance analysis of our protocols show that they outperform in terms of end to end transmission delay, bandwidth consumption and average hop counts as compared to similar Bluetooth routing protocols that we have considered.
A new approach for evaluating agility in supply chains using Fuzzy Association Rules Mining
Authors: Vipul Jain, Lyes Benyoucef, S. G. Deshmukh
Venue: Engineering Applications of Artificial Intelligence (2008)

Besides its effectiveness, supply chain management (SCM) is a complex process because of the stochastic and dynamic nature, multi-criterion and ever-increasing complexity of supply chains. Furthermore, companies have realized that agility is essential for their survival and competitiveness. Consequently, there is no generally accepted method by researchers and practitioners for designing, operating and evaluating agile supply chains. Moreover, the ability to build agile supply chain has developed more slowly than anticipated, because technology for managing agile supply chain is still being developed. Therefore, in this paper, we develop a new approach based on Fuzzy Association Rule Mining to support the decision makers by enhancing the flexibility in making decisions for evaluating agility with both tangibles and intangibles attributes/criteria such as Flexibility, Profitability, Quality, Innovativeness, Pro-activity, Speed of response, Cost and Robustness. Also, by checking the fuzzy classification rules, the goal of knowledge acquisition can be achieved in a framework in which evaluation of agility could be established without constraints, and consequently checked and compared in several details. Efficacy and intricacy of the proposed approach for finding fuzzy association rules from the database for evaluating agility is demonstrated with the help of a numerical example.
Solution of direct and inverse problems for Laplace type equations by Gr-method
Authors: Alexandre Grebennikov
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

Laplace type equation with variable coefficient, written in divergent form, is considered. The General Ray (GR) method is applied for solution of direct boundary value problems and coefficient inverse problems for such equations. GR-method uses the explicit formulas with the fast inversion of the Radon transformation. That leads to fast algorithms realised in MATLAB software, whose quality is justified by numerical experiments.
Automating test automation
Authors: Andrej Pietschker
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2008)

When trying to introduce TTCN-3 and thus improving test automation we are regularly faced with the issue of legacy test automation. These existing approaches to test automation range from small code developed for a very specific task to large applications with substantial development effort or even purchased solution from third party vendors that might include hardware components. Often these solutions cater for a specific need and their combined application is controlled by humans. A higher degree of test automation can be achieved if these solutions are combined in a test system to enable batch runs for example. TTCN-3 can be a good choice for implementing a future-oriented solution. However, recreating all of the existing parts in TTCN-3 might not be a feasible solution from a business perspective. Instead of refraining from creating an advanced solution, the idea is to use those existing parts to substantially reduce the effort necessary to introduce an improved test automation solution. In this paper, we will report on the successful integration of legacy test solutions using TTCN-3 and creating a new, advanced test system that enables overnight test runs. The paper will illustrate our challenges and experiences from this project.
Dispersers, deterministic amplification, and weak random sources
Authors: A. Cohen, A. Wigderson
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain the following results: (1) The error probability of any RP (BPP) algorithm can be made exponentially small at the cost of only a constant factor increase in the number of random bits. (2) RP (BPP) algorithms with some weak bit fixing sources are simulated.
BIW concept design in virtual testing lab applying computation grid network
Authors: Yi Dai, Nan Li
Venue: Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing (2007)

Vehicle body-in-white (BIW) crash models are important for crashworthiness analysis. Conventional finite element methods usually deal with a large sized computational model and thus hinder efficient design evaluation. The proposed computation grid based virtual testing lab, with a significant improvement of computation efficiency, is capable of extracting essential safety dynamic characteristics into an artificial neural network (NN). Our analysis shows that the virtual testing lab is capable to provide all the necessary computation resource through computation grid network, and derive the frontal crash characteristics into the NN based knowledge database. The above testing case successfully demonstrates computation grid network is the essential driven technique to accomplish the challenging engineering computation tasks.
Combining Logic and Algebraic Techniques for Program Verification in Theorema
Authors: Laura Kovács, Nikolaj Popov, Tudor Jebelean
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

We study and implement concrete methods for the verification of both imperative as well as functional programs in the frame of the Theorema system. The distinctive features of our approach consist in the automatic generation of loop invariants (by using combinatorial and algebraic techniques), and the generation of verification conditions as first-order logical formulae which do not refer to a specific model of computation.
Memory-Efficient Fuzzy Fingerprint Vault based on the Geometric Hashing
Authors: Sungju Lee, Daesung Moon, Hanna Choi, Yongwha Chung
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

One of the solutions to the auto-alignment problem in the fuzzy fingerprint vault exploited the idea of the geometric hashing technique. Although this solution can provide higher verification accuracy, it requires more memory space due to the large size of the hash table. In this paper, we propose an approach to reduce the size of the hash table by using the time-memory tradeoff without sacrificing the verification accuracy. That is, instead of generating the full hash table at the enrollment phase, our approach generates the enrollment hash table “on-the-fly” at the verification phase. The size of the hash table can be reduced further by selecting the basis set carefully. Based on the experimental results, we confirm that the proposed approach can reduce both the static and the dynamic memory requirements without sacrificing both the verification accuracy and the security level.
Tracking Control of Join-Free Timed Continuous Petri Net Systems under Infinite Servers Semantics
Authors: Jing Xu, Laura Recalde, Manuel Silva
Venue: Discrete Event Dynamic Systems (2008)

A new low-and-high gain algorithm is presented for tracking control of a subclass of timed continuous Petri Net (contPN) systems working under infinite servers semantics. The inherent properties of timed contPN determine that the control signals must be non-negative and upper bounded by functions of system states. In the proposed control approach, LQ theory is first used to design a low-gain controller such that the control signals satisfy the input constraints. Based on the low-gain controller, a high-gain term is further added to fully employ available control energy, and control performance can be improved consequently. In order to guarantee global tracking convergence and smoothness on the tracking target, a mixed trajectory (state step and ramp) is used instead of a pure step reference signal. The new tracking target is designed to ensure the existence of the low-gain controller and possible fast system response concurrently. Rigorous proof based on Lyapunov function is provided to guarantee that for a conservative and strongly connected Join-Free (JF) timed contPN system, the proposed algorithm can ensure the global asymptotical convergence of both system states and control signals.
Using Discrete Event Simulation (DES) to Manage Theatre Operations in Healthcare: An Audit-Based Case Study
Authors: Alexander Komashie, Ali Mousavi, Justin Gore
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper discusses the application of Discrete Event Simulation (DES) in modelling the complex relationship between patient types, case-mix and operating theatre allocation in a large National Health Service (NHS) Trust in London. The simulation model that was constructed described the main features of nine theatres, focusing on operational processes and patient throughput times. The model was used to test three scenarios of case-mix and to demonstrate the potential of using simulation modelling as a cost effective method for understanding the issues of healthcare operations management and the role of simulation techniques in problem solving. The results indicated that removing all day cases will reduce patient throughput by 23.3% and the utilization of the orthopaedic theatre in particular by 6.5%. This represents a case example of how DES can be used by healthcare managers to inform decision making.
An Algorithmic Solution of a Birkhoff Type Problem
Authors: Daniel Simson, Mariusz Wojewódzki
Venue: Fundamenta Informaticae (2008)

We give an algorithmic solution in a simple combinatorial data of Birkhoff0s type problem studied in [22] and [25], for the category rep$_{ft}$(I,K[t]/(t$^m$)) of filtered I-chains of modules over the K-algebra K[t]/(t$^m$) of K-dimension m <&infin;, where m &ges; 2, I is a finite poset with a unique maximal element, and K is an algebraically closed field. The problem is to decide when the indecomposable objects of the category rep$_{ft}$(I,K[t]/(t$^m$)) admit a classification by means of a suitable parametrisation. A complete solution of this important problem of the modern representation theory is contained in Theorems 2.4 and 2.5. We show that rep$_{ft}$(I,K[t]/(t$^m$)) admits such a classification if and only if (I,m) is one of the pairs of the finite list presented in Theorem 2.4, and such a classification does not exist for rep$_{ft}$(I,K[t]/(t$^m$)) if and only if the pair (I,m) is bigger than or equal to one of the minimal pairs of the finite list presented in Theorem 2.5. The finite lists are constructed by producing computer accessible algorithms and computational programs written in MAPLE and involving essentially the package CREP (see Section 4). On this way the lists are obtained as an effect of computer computations. In particular, the solution we get shows an importance of the computer algebra technique and computer computations in solving difficult and important problems of modern algebra.
The Nightsat mission concept
Authors: C. D. Elvidge, P. Cinzano, D. R. Pettit, J. Arvesen, P. Sutton, C. Small, R. Nemani, T. Longcore, C. Rich, J. Safran, J. Weeks, S. Ebener
Venue: International Journal of Remote Sensing (2007)

Nightsat is a concept for a satellite system capable of global observation of the location, extent and brightness of night-time lights at a spatial resolution suitable for the delineation of primary features within human settlements. Based on requirements from several fields of scientific inquiry, Nightsat should be capable of producing a complete cloud-free global map of lights on an annual basis. We have used a combination of high-resolution field spectra of outdoor lighting, moderate resolution colour photography of cities at night from the International Space Station, and high-resolution airborne camera imagery acquired at night to define a range of spatial, spectral, and detection limit options for a future Nightsat mission. The primary findings of our study are that Nightsat should collect data from a near-synchronous orbit in the early evening with 50 to 100 m spatial resolution and have detection limits of 2.5E-8 Watts cm-2sr-1µm-1 or better. Although panchromatic low-light imaging data would be useful, multispectral low-light imaging data would provide valuable information on the type or character of lighting; potentially stronger predictors of variables such as ambient population density and economic activity; and valuable information to predict response of other species to artificial night lighting. The Nightsat mission concept is unique in its focus on observing a human activity, in contrast to traditional Earth observing systems that focus on natural systems.
Integrating actuator fault and wheel slippage detections within FDI framework
Authors: Naim Sidek, Nilanjan Sarkar
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

We have witnessed a significant advancement in the field of mobile robot applications in the past two decades. From performing mission critical tasks such as in planetary exploration to simply doing household chores, this type of robots requires availability, reliability and safety of its operations. Consequently, there is a growing demand for fault tolerant control system (FTCS) for mobile robots where one of it major component is the fault detection and isolation (FDI) module. In our FDI study, one of the challenges in designing the robot model is to create an accurate and robust dynamics model. In this paper, the environment structure, which is the dynamic change in the surface characteristics, will be included. We will utilize Local Neural Model (LNM) in our robot modeling process. Wheel slippage is an event happened when the robot wheels lose their full grasp of the surface. This may cause the robot to deviate from its desired trajectory. On the other hand, the fault on the robot actuator may also lead to similar behavior but need different solution. In this paper we will expand the functionality of FDI module to infer a real actuator fault and wheel slippage in which, the solutions for both events can be combined in a single, common controller.
Survival of Rats with N29 Brain Tumours after Irradiation with 5 or 15 Gy and Immunization with IFN-gamma Secreting Tumour Cells
Authors: Bertil R. R. Persson, Catrin Bauréus Koch, Gustav Grafström, Crister Ceberg, Per Munck af Rosenschöld, Bengt Widegren, Leif G. Salford
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Intra cerebral tumours were inoculated into thebrain of Fischer-344 syngeneic rats. After one weekthey were treated with either 5 or 15 Gy of 60Cogammaradiation. The first immunization was given 1hour before the radiation treatment and then two moretimes with 14-day intervals. Immunization wasperformed with 3 x 106 radiation sterilized IFN-γsecreting tumour cells (N29) injected intraperitoneally.Neither radiation therapy with 5 or 15 Gy norimmunization with N29 cells alone had any significanteffect on the length of survival of N29 tumour bearingrats. But radiation therapy with 5 Gy combined withimmunization with IFN-γ secreting syngeneic N29 cellsresulted in 63 % complete remissions and significantly (p
Enabling new pedagogies in operating systems and networking courses with state of the art open source kernel and virtualization technologies
Authors: Alessio Gaspar, Sarah Langevin, William Armitage, Matt Rideout
Venue: Journal of Computing Sciences in Colleges (2008)

This paper discusses the design and implementation of a set of laboratories for undergraduate courses in Operating Systems Concepts (OSC) and Networking (NET). More specifically, we focus on exploring how state of the art Linux kernel and virtualization technologies can be leveraged to implement new pedagogical strategies focused on problem-based, active and authentic learning. The Linux Loadable Kernel Modules (LKM) technology is leveraged to scaffold the learning of a production-level kernel's internals in OSC labs which draw their inspiration from root-kit development techniques. The User Mode Linux (UML) and Manage Large Networks (MLN) virtualization and provisioning technologies are deployed in networking labs to allow students to experiment hands-on with virtual networks created on-demand to illustrate widely used networking protocols. We focus on establishing the benefits of the proposed approaches by stressing the topics and pedagogies they enable instructors to engage their students in, compared to existing educational practices
COMMON-SENSE SPATIAL REASONING FOR INFORMATION CORRELATION IN PERVASIVE COMPUTING
Authors: Stefania Bandini, Alessandro Mosca, Matteo Palmonari
Venue: Applied Artificial Intelligence (2007)

The current technological trend depicts a scenario in which space, and more generally the environment in which the computation takes place, represents a key aspect that must be considered in order to improve systems' context awareness, even if the kind of information processed is not only of spatial nature. This article focuses on the notions of "place" and "conceptual spatial relation" to present a formal model of space supporting common-sense spatial reasoning. The model can be viewed as the semantic specification for a hybrid logic, whose formulas represent spatially qualified information. Interesting classes of common-sense spatial models are identified according to the properties of their characteristic relations and an axiomatization of the associated hybrid language is given; a sound and complete tableau-based calculus for these classes of models is provided.