ppxscal/embedding_network huggingface dataset:
A novel O(1) time algorithm for 3D block-based medial axis transform by peeling corner shells
Authors: Yuh-Rau Wang
Venue: Parallel Computing (2009)

The block-based medial axis transform (BB_MAT, for short) of a 3D (2D) binary image, denoted 3D_BB_MAT (2D_BB_MAT), is defined as the problem to find a minimal set of upright 1-cubes (1-squares) whose union corresponds exactly to the 1-voxels (1-pixels) in the binary image. Many parallel algorithms have been proposed for computing the 2D_BB_MAT, almost all proposed approaches are unable to extend to a solution of the 3D_BB_MAT problem. In this paper, we first propose a novel O(1) time algorithm for solving the 3D_BB_MAT (2D_BB_MAT) problem of a binary image of size NxNxN (NxN) on a linear array with a reconfigurable pipelined bus system (LARPBS, for short) by peeling the 3D (2D) corner shell of each 1-voxel (1-pixel) of the image and revealing some properties of the 3D_BB_MAT (2D_BB_MAT). The 3D (2D) chessboard distance transform problem, denoted 3D_CDT (2D_CDT), is the problem for each 0-voxel (0-pixel) of a 3D (2D) binary image to find its nearest 1-voxel (1-pixel) in the binary image based on chessboard distance metric. In this paper, we also solve the 3D_CDT (2D_CDT) based on the computed 3D_BB_MAT (2D_BB_MAT). All the proposed algorithms are very innovative although they look like ''straightforward''. To the best of our knowledge, the proposed 2D_BB_MAT (2D_CDT) algorithm is the first algorithm that can extend to a solution of the 3D_BB_MAT (3D_CDT) problem in parallel, and the 3D_BB_MAT (3D_CDT) algorithm is the first parallel algorithm proposed for solving the 3D_BB_MAT (3D_CDT) problem.
Smart audio access to multimedia information
Authors: Mario Malcangi
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

Intuitive and efficient access to multimedia information is becoming a strategic option, given the increasing availability of such information in large archives and on the web. Audio information is a powerful medium to communicate naturally with such systems, while accessing multimedia information semantically. To this end, we are integrating multiple signal-processing algorithms and soft computing to develop an audio-based front end for multimedia retrieval. Algorithm-based feature extraction is used to feed a Kohonen feature map and a fuzzy-logic classifier to develop a content-based, audio-access system that retrieves information in a multimedia domain.
Real-time guaranteed video transport for video-on-demand systems
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: Addresses two important issues: resource reservation and flow control, for video transmissions in a loss-free and timely delivery way for VOD (video-on-demand) systems. For the first issue, we propose a semi-static resource reservation scheme, which attempts to utilize resources efficiently and maximize the number of clients being serviced concurrently. For the second issue, we propose a server-initiated flow control scheme, in which the traffic flow is controlled by the server alone, using historical video information; thus, no feedback messages from its downstream switches are needed. Our approach is evaluated under a wide range of parameters through extensive simulations driven by trace data from various MPEG video streams.
A software architecture framework for on-line option pricing
Authors: Kiran Kola, Ruppa K. Thulasiram, Parimala Thulasiraman
Venue: The Journal of Supercomputing (2009)

The problem of growing computational complexity in the finance industry demands manageable, high-speed and real-time solutions in solving complex mathematical problems such as option pricing. In current option trading scenarios, determining a fair price for options "any time" and "anywhere" has become vital yet difficult computational problem. In this study, we have designed, implemented, and deployed an architecture for pricing options on-line using a hand-held device that is J2ME-based Mobile computing-enabled and is assisted by web mining tools. In our architecture, the client is a MIDP user interface, and the back end servlet runs on a standalone server bound to a known port address. In addition, the server uses table-mining techniques to mine real-time data from reliable web sources upon the mobile trader's directive. The server performs all computations required for pricing options since mobile devices have limited battery power, low bandwidth, and low memory. We have parallelized and implemented various computational techniques such as binomial lattice and finite differencing. To the best of our knowledge, this is one of the first studies that facilitate the mobile-enabled-trader to compute the price of an option in ubiquitous fashion. This architecture aims at providing the trader with various computational techniques to avail (to provide results from approximate to accurate results) while on-the-go and to make important and effective trading decisions using the results that will ensure higher returns on investments in options.
The Verilog Hardware Description Language, 5th ed. edition
Authors: Donald Thomas, Philip Moorby
Venue:  (2008)

Thomas & Moorbys The Verilog Hardware Description Language has become the standard reference text for Verilog. This edition presents the new IEEE 1364-2001 standard of the language. The examples have all been updated to illustrate the new features of the language. A cross referenced guide to the new and old features is provided. Thus, designers already familiar with Verilog can quickly learn the new features. Newcomers to the language can use it as a guide for reading old specifications. The Verilog Hardware Description Language, Fifth Edition, is a valuable resource for engineers and students interested in describing, simulating, and synthesizing digital systems; the extensive number of simulatable examples and wide range of representation styles covered ensure its quick use in design. The book is also ready for use in university courses, having been used for introductory logic design and simulation through advanced VLSI design courses. An appendix with tutorial help and a work-along style is keyed into the introduction for new students. Material supporting a computer-aided design course on the inner working of simulators is also included.
A proactive middleware platform for mobile computing
Authors: Andrei Popovici, Andreas Frei, Gustavo Alonso
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

An obvious prerequisite for mobile computing devices is the ability to adapt to different computing environments. Otherwise the devices are forced to carry with them everything they may eventually need during their operational life time. This is neither desirable nor feasible, thereby hinting at the need for dynamic adaptation. The idea would be to let the environment be proactive and adapt the application rather than forcing the application to adapt itself to every possible environment. In this paper we present a platform for doing exactly this. Applications running on our modified JVM can be extended at run time with new functionality. Through this platform, mobile devices can acquire on-the-fly any functionality extension they may need to work properly in a given environment. The functionality extensions are local in time and space: they are active only on a specific site and just for the time they are needed. The platform can be used in both centralized settings (with a base station providing the extensions) or in self configuring mode (extensions are provided by peers). In this paper we describe the platform, how to use it and report on one of the several prototypes that have been constructed.
The integration of real device capabilities in distributed applications based on OPC tehnology
Authors: Vasile Gaitan, Valentin Popa, Ioan Ungurean, Nicoleta Cristina Gaitan
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The aim of this paper is to present a simple yet powerful way of introducing new devices into a SCADA application based on OPC technology. In order to accomplish this, the ELECTRONIC DEVICE DESCRIPTION technology and Object Dictionary concept were used as a middleware between the SCADA application and the field devices. A text-based language was used for describing the digital communication characteristics of intelligent field instrumentation and equipment parameters - device status, diagnostic data, and configuration details - in an operating system (OS) and human machine interface (HMI) neutral environment.
An interactive software engineering tool for memory management and user program evaluation
Authors: Wolfgang W. Millbrandt, Juan Rodriguez-Rosell
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

As the use of virtual memory becomes more and more accepted, the problem of effective storage management becomes more and more important. To date most efforts to optimize the use of memory have been directed at devising memory management strategies at the operating system level that minimize the number of page faults. For example, Comeau has shown that the loading sequence of subroutines can have a considerable effect on paging activity. Hence page-fault-optimizing loaders, linkage editors and compilers have been proposed. Although the concepts of "locality" and "working set" have been known for some time (c.f. Denning), little effort has been made to provide the programmer with suitable tools for making his programs "more local". This seems to stem from the fact that, short of notions of "modular coding", little is known about what sorts of programming habits actually result in local code. Consequently, most optimization techniques used to date have assumed that user programs were an unmodifiable input to the operating system.
Design and implementation of a queue compiler
Authors: Arquimedes Canedo, Ben A. Abderazek, Masahiro Sowa
Venue: Microprocessors Microsystems (2009)

Queue processors are a viable alternative for high performance embedded computing and parallel processing. We present the design and implementation of a compiler for a queue-based processor. Instructions of a queue processor implicitly reference their operands making the programs free of false dependencies. Compiling for a queue machine differs from traditional compilation methods for register machines. The queue compiler is responsible for scheduling the program in level-order manner to expose natural parallelism and calculating instructions relative offset values to access their operands. This paper describes the phases and data structures used in the queue compiler to compile C programs into assembly code for the QueueCore, an embedded queue processor. Experimental results demonstrate that our compiler produces good code in terms of parallelism and code size when compared to code produced by a traditional compiler for a RISC processor.
Learning-based pronoun resolution for Turkish with a comparative evaluation
Authors: Yılmaz Kılıçaslan, Edip Serdar Güner, Savaş Yıldırım
Venue: Computer Speech and Language (2009)

The aim of this paper is twofold. On the one hand, it attempts to explore several machine learning models for pronoun resolution in Turkish, a language not sufficiently studied with respect to anaphora resolution and rarely being subjected to machine learning experiments. On the other hand, this paper offers an evaluation of the classification performances of the learning models in order to gain insight into the question of how to match a model to the task at hand. In addition to the expected observation that each model should be tuned to an optimum level of expressive power so as to avoid underfitting and overfitting, the results also suggest that non-linear models properly tuned to avoid overfitting outperform linear ones when applied to the data used in our experiments.
A Feasibility Study on Hyperblock-based Aggressive Speculative Execution Model
Authors: Ming Cong, Hong An, Yongqing Ren, Canming Zhao, Jun Zhang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Speculation execution model which executes sequential programs in parallel through speculation is an effective technique for making better use of growing on-chip resources and exploiting more instruction-level parallelism of applications. However, accompanied high communication overheads and roll-back penalties can not be neglected. This paper focuses on analyzing the feasibility of aggressive speculation execution model and finding an appropriate degree of "aggressiveness" under hyperblock-based execution model. We analyze the characteristic of control dependences and data dependences between adjacent hyperblocks, and propose a quantitative analysis method to detect data dependences on hyperblock-based execution model, and then evaluate the feasibility of aggressive speculative execution model on 8 applications from SPEC2K. Our experiments show most applications can get high prediction accuracy on control-flow from hyperblock-based prediction mechanisms, especially SPECFP. Furthermore, we analyze factors which impact expected prediction depth and find depth depends more on application than predictors.
A robust APTAS for the classical bin packing problem
Authors: Leah Epstein, Asaf Levin
Venue: Mathematical Programming: Series A and B (2009)

Bin packing is a well studied problem which has many applications. In this paper we design a robust APTAS for the problem. The robust APTAS receives a single input item to be added to the packing at each step. It maintains an approximate solution throughout this process, by slightly adjusting the solution for each new item. At each step, the total size of items which may migrate between bins must be bounded by a constant factor times the size of the new item. We show that such a property cannot be maintained with respect to optimal solutions.
Causeway: support for controlling and analyzing the execution of multi-tier applications
Authors: Anupam Chanda, Khaled Elmeleegy, Alan L. Cox, Willy Zwaenepoel
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

Causeway provides runtime support for the development of distributed meta-applications. These meta-applications control or analyze the behavior of multi-tier distributed applications such as multi-tier web sites or web services. Examples of meta-applications include multi-tier debugging, fault diagnosis, resource tracking, prioritization, and security enforcement. Efficient online implementation of these meta-applications requires meta-data to be passed between the different program components. Examples of metadata corresponding to the above meta-applications are request identifiers, priorities or security principal identifiers. Causeway provides the infrastructure for injecting, destroying, reading, and writing such metadata. The key functionality in Causeway is forwarding the metadata associated with a request at so-called transfer points, where the execution of that request gets passed from one component to another. This is done automatically for system-visible channels, such as pipes or sockets. An API is provided to implement the forwarding of metadata at system-opaque channels such as shared memory. We describe the design and implementation of Causeway, and we evaluate its usability and performance. Causeway's low overhead allows it to be present permanently in production systems. We demonstrate its usability by showing how to implement, in 150 lines of code and without modification to the application, global priority enforcement in a multi-tier dynamic web server.
Algorithms for validating E-tickets in mobile computing environment
Authors: A. Tripathi, T. Suman Kumar Reddy, Sanjay Madria, H. Mohanty, R. K. Ghosh
Venue: Information Sciences: an International Journal (2009)

E-tickets issued online can be used by different vendors to provide services such as discount coupons for E-shopping, or an entrance for a football game. One major issue associated with E-tickets is the problem of validation, which becomes more severe in a mobile environment due to mobility of a mobile host (MH) and frequent failure/disconnection of validation servers known as mobile support stations (MSSs). Some additional problems include the identification of duplicate submissions of an E-ticket by a MH. Thus, this paper proposes two protocols using the Flat and Hierarchical schemes for E-ticket processing and validation in a mobile environment that guarantee at least and at most once property (each E-ticket is validated at least and at most once). The protocols have been validated and compared through complexity analysis and experiments.
Bifurcation control in small-world networks
Authors: Zunshui Cheng, Jinde Cao
Venue: Neurocomputing (2009)

In this paper, the problem of Hopf bifurcation control is considered for a small-world network model with time delays. We know that for the system without control, as the positive gain parameter of the system passes a critical point, Hopf bifurcation occurs. To control the Hopf bifurcation, a time-delayed feedback controller is proposed to delay the onset of an inherent bifurcation when such bifurcation is undesired. Numerical simulation results confirm that the new feedback controller using time delay is efficient in controlling Hopf bifurcation.
Online Task Scheduling for Heterogeneous Reconfigurable Systems
Authors: Xuegong Zhou, Liang Liang, Ying Wang, Chenglian Peng
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

In heterogeneous reconfigurable systems including FPGA and CPU, besides software tasks and hardware tasks, there exist hybrid tasks which can be either executed on CPU as software tasks or implemented on FPGA as hardware tasks. This paper mainly focuses on the online scheduling problem within heterogeneous reconfigurable systems. According to a reconfigurable system prototype, a task scheduler model and its corresponding scheduling algorithm are presented. The model combines task allocation and task placement with task migration, making use of the great flexibility of hybrid tasks. Simulation results have demonstrated that the proposed algorithm can provide preferable scheduling performance and reduce the rejection rate.
Sectional domain specific languages
Authors: Walter Cazzola, Ivan Speziale
Venue: Proceedings of the 4th workshop on Domain-specific aspect languages (2009)

Nowadays, many problems are solved by using a domain specific language (DSL), i.e., a programming language tailored to work on a particular application domain. Normally, a new DSL is designed and implemented from scratch requiring a long time-to-market due to implementation and testing issues. Whereas when the DSL simply extends another language it is realized as a source-to-source transformation or as an external library with limited flexibility. The Hive framework is developed with the intent of overcoming these issues by providing a mechanism to compose different programming features together forming a new DSL, what we call a sectional DSL. The support (both at compiler and interpreter level) of each feature is separately described and easily composed with the others. This approach is quite flexible and permits to build up a new DSL from scratch or simplifying an existing language without penalties. Moreover, it has the desirable side-effect that each DSL can be extended at any time potentially also at run-time.
RETRACTED: Investigating the efficiency in oil futures market based on GMDH approach
Authors: Mohsen Mehrara, Ali Moeini, Mehdi Ahrari, Ali Erfanifard
Venue: Expert Systems with Applications: An International Journal (2009)

This article has been retracted at the request of the Editor-in-Chief. Please see Elsevier Policy on Article Withdrawal (http://www.elsevier.com/locate/withdrawalpolicy). Reason: This article has copied material previously published in the article ''Are there exploitable inefficiencies in the futures market for oil?'', Shambora et. al., Energ. Econ., 29 (2007) 18-27, doi:10.1016/j.eneco.2005.09.004. As such, this article represents a severe abuse of the scientific publishing system and a clear violation of publishing ethics, and therefore must be retracted.
Clustering for nonlinear system identification
Authors: José De Jesús Rubio Avila, Andrés Ferreyra Ramírez, Carlos Avilés-Cruz, Ivan Vazquez-Alvarez
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

We propose a new on-line clustering fuzzy neural network. Learning structure and parameter learning are updated at the same time in our algorithm, we do not make difference in structure learning and parameter learning. It generates groups with a given radius. The center is updated in order to get that the center is near to the incoming data in each iteration, in this way, It does not need to generate a new rule in each iteration, i.e., it does not generate many rules and It does not need to prune the rules.
Qualitative and Quantitative Crying Analysis of New Born Babies Delivered Under High Risk Gestation
Authors: Antonio Verduzco-Mendoza, Emilio Arch-Tirado, Carlos A. Reyes García, Jaime Leybón Ibarra, Juan Licona Bonilla
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

High risk newborns present high irritability and poor physiological stability among other abnormalities. Two months old infants do not have phonatory control due to neurological immaturity at early age. While age increases, expiration capacity increases too, being reflected in lasting length. Crying qualitative description is complementary to quantitative analysis. The aim of this study is the qualitative and quantitative description from the spectral analysis of crying in infants considered as infants of high neonatal risk. In this paper we will present some qualitative characteristics obtained from crying analysis and how we think qualitative analysis could be considered as an early diagnostic tool by relating its results to the baby´s neurophysiologic state.
A Balanced Ensemble Learning with Adaptive Error Functions
Authors: Yong Liu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

In the practice of designing neural network ensembles, it is common that a certain learning error function is defined and kept the same or fixed for each individual neural network in the whole learning process. Such fixed learning error function not only likely leads to over-fitting, but also makes learning slow on hard-learned data points in the data set. This paper presents a novel balanced ensemble learning approach that could make learning fast and robust. The idea of balanced ensemble learning is to define adaptive learning error functions for different individual neural networks in an ensemble, in which different individuals could have different formats of error functions in the learning process, and these error functions could be changed as well. Through shifting away from well-learned data and focusing on not-yet-learned data by changing error functions for each individual among the ensemble, a good balanced learning could be achieved for the learned ensemble.