ppxscal/embedding_network huggingface dataset:
Optimistic pruning for multiple instance learning
Authors: Amy McGovern, David Jensen
Venue: Pattern Recognition Letters (2008)

This paper introduces a simple evaluation function for multiple instance learning that admits an optimistic pruning strategy. We demonstrate comparable results to state-of-the-art methods using significantly fewer computational resources.
An exploratory study of cloud remote sensing capabilities of the Communication, Ocean and Meteorological Satellite (COMS) imagery
Authors: Y. -S. Choi, C. -H. Ho, M. -H. Ahn, Y. -M. Kim
Venue: International Journal of Remote Sensing (2007)

The present study documents optimal methods for the retrieval of cloud properties using five channels (0.6, 3.7, 6.7, 10.8 and 12.0 µm) that are used in many geostationary meteorological satellite observations. Those channels are also to be adopted for the Communication, Ocean and Meteorological Satellite (COMS) scheduled to be launched in 2008. The cloud properties focused on are cloud thermodynamic phase, cloud optical thickness, effective particle radius and cloud-top properties with specific uncertainties. Discrete ordinate radiative transfer models are simulated to build up the retrieval algorithm. The cloud observations derived from the Moderate-resolution Imaging Spectroradiometer (MODIS) are compared with the results to assess the validity of the algorithm. The preliminary validation indicates that the additional use of a band at 6.7 µm would be better in discriminating the cloud ice phase. Cloud optical thickness and effective particle radius can also be produced up to, respectively, 64 and 32 µm by functionally eliminating both ground-reflected and cloud-and ground-thermal radiation components at 0.6 and 3.7 µm. Cloud-top temperature (pressure) in ±3 K (±50 hPa) uncertainties can be estimated by a simple 10.8-µm method for opaque clouds, and by an infrared ratioing method using 6.7 and 10.8 µm for semitransparent clouds.
Code compression for VLIW embedded systems using a self-generating table
Authors: Chang Hong Lin, Yuan Xie, Wayne Wolf
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

We propose a new class of methods for VLIW code compression using variable-sized branch blocks with self-generating tables. Code compression traditionally works on fixed-sized blocks with its efficiency limited by their small size. A branch block, a series of instructions between two consecutive possible branch targets, provides larger blocks for code compression. We compare three methods for compressing branch blocks: table-based, Lempel-Ziv-Welch (LZW)-based and selective code compression. Our approaches are fully adaptive and generate the coding table on-the-fly during compression and decompression. When encountering a branch target, the coding table is cleared to ensure correctness. Decompression requires a simple table lookup and updates the coding table when necessary. When decoding sequentially, the table-based method produces 4 bytes per iteration while the LZW-based methods provide 8 bytes peak and 1.82 bytes average decompression bandwidth. Compared to Huffman's 1 byte and variable-to-fixed (V2F)'s 13-bit peak performance, our methods have higher decoding bandwidth and a comparable compression ratio. Parallel decompression could also be applied to our methods, which is more suitable for VLIW architectures.
A general grid-clustering approach
Authors: Shihong Yue, Miaomiao Wei, Jeen-Shing Wang, Huaxiang Wang
Venue: Pattern Recognition Letters (2008)

Hierarchical clustering is an important part of cluster analysis. Based on various theories, numerous hierarchical clustering algorithms have been developed, and new clustering algorithms continue to appear in the literature. It is known that both divisive and agglomerative clustering algorithms in hierarchical clustering play a pivotal role in data-based models, and have been successfully applied in clustering very large datasets. However, hierarchical clustering is parameter-sensitive. When the user has no knowledge of how to choose the input parameters, the clustering results may become undesirable. In this paper, we propose a general grid-clustering approach (GGCA) under a common assumption about hierarchical clustering. The key features of the GGCA include: (1) the combination of the divisible and the agglomerative clustering algorithms into a unifying generative framework; (2) the determination of key input parameters: an optimal grid size for the first time; and (3) the application of a two-phase merging process to aggregate all data objects. Consequently, the GGCA is a non-parametric algorithm which does not require users to input parameters, and exhibits excellent performance in dealing with not well-separated and shape-diverse clusters. Some experimental results comparing the proposed GGCA with the existing methods show the superiority of the GGCA approach.
Effect of particle inertia on the dynamics of depositional particulate density currents
Authors: Mariano I. Cantero, Marcelo H. García, S. Balachandar
Venue: Computers Geosciences (2008)

In this work we address the effect of particle inertia on depositional particulate density currents. We employ a two-fluid model based on the equilibrium Eulerian approach and present highly resolved two-dimensional (2D) simulations of the flow for a Reynolds number of 3450 (this particular choice corresponds to values of Grashof number Gr of 1.5x10^6).The simulations capture physical aspects of two-phase flows, such as particle preferential concentration and particle migration down turbulence gradients (turbophoresis), which modify substantially the structure and dynamics of the flow. In the simulations we observe the migration of particles from the core of Kelvin-Helmholtz vortices shed from the front of the current as well as their accumulation in the current head. This redistribution of particles in the current affects the propagation velocity of the front, bottom shear stress patterns, as well as deposition rates and patterns.
Cheek to Chip: Dancing Robots and AI's Future
Authors: Jean-Julien Aucouturier, Katsushi Ikeuchi, Hirohisa Hirukawa, Shin'ichiro Nakaoka, Takaaki Shiratori, Shunsuke Kudoh, Fumio Kanehiro, Tetsuya Ogata, Hideki Kozima, Hiroshi G. Okuno, Marek P. Michalowski, Yuta Ogai, Takashi Ikegami, Kazuhiro Kosuge, Takahiro Takeda, Yasuhisa Hirata
Venue: IEEE Intelligent Systems (2008)

More and more AI researchers are trying to make robots dance to music. This installment of T&C features five essays showing how this research addresses issues that are central to dance.
Global optimization using a synchronization of multiple search Points autonomously driven by a chaotic dynamic model
Authors: Takashi Okamoto, Eitaro Aiyoshi
Venue: Journal of Global Optimization (2008)

In the present paper, we propose a new multipoint type global optimization model using a chaotic dynamic model and a synchronization phenomenon in nonlinear dynamic systems for a continuously differentiable optimization problem. We first improve the Discrete Gradient Chaos Model (DGCM), which drives each search point's autonomous movement, based on theoretical analysis. We then derive a new coupling structure called PD type coupling in order to obtain stable synchronization of all search points with the chaotic dynamic model in a discrete time system. Finally, we propose a new multipoint type global optimization model, in which each search point moves autonomously by improved DGCM and their trajectories are synchronized to elite search points by the PD type coupling model. The proposed model properly achieves diversification and intensification, which are reported to be important strategies for global optimization in the Meta-heuristics research field. Through application to proper benchmark problems [Liang et al. Novel composition test functions for numerical global optimization. In: Proceedings of Swarm Intelligence Symposium, 2005 (SIS 2005), pp. 68---75 (2005); Liang et al. Nat. Comput. 5(1), 83---96, 2006] (in which the drawbacks of typical benchmark problems are improved) with 100 or 1000 variables, we confirm that the proposed model is more effective than other gradient-based methods.
Adaptive Fuzzy Control for Utilization Management
Authors: Mehmet H. Suzer, Kyoung-Don Kang
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

An increasing number of real-time systems are embedded in mission critical systems such as target tracking systems, in which workloads may dynamically vary, for example, depending on the number of targets in the area of interest. Feedback control has been applied to support real-time performance in dynamic environments, producing promising initial results. However, mathematical system modeling necessary for feedback control is challenging. To reduce the difficulty of system modeling, we apply fuzzy control for direct nonlinear mappings between the utilization error (= targetutilization $-$ current utilization) and the workload adjustment required to achieve the target utilization via IF-THEN rules. Moreover, via online adaptation, our fuzzy controller can amplify or dampen its own fuzzy control signal, if necessary, to expedite the convergence to the desired utilization. In our simulation study, our approach quickly converges to the target utilization when the workload significantly changes. In contrast, the tested baselines oscillate between overload and underutilization.
Non-Line-of-Sight Localization in Multipath Environments
Authors: Chee Kiat Seow, Soon Yim Tan
Venue: IEEE Transactions on Mobile Computing (2008)

This paper presents a comprehensive Non Line of Sight (NLOS) localization scheme and a least square estimator that leverages on the bi-directional estimation of the Angle of Arrival (AOA) and Time of Arrival (TOA) of signals exchanged between mobile and reference devices. The proposed localization scheme requires two or more signal paths which can be either Line of Sight (LOS) signals or Non-line of Sight (NLOS) multipath signals that undergo one bound scattering. Our multipath selection scheme is shown to be able to discard multiple bound scattering paths with a high degree accuracy. We used empirical data obtained through experimentation in a real environment to analyse the performance of our proposed localization scheme, and to compare it to the existing methods. The results of this experiment show that the proposed localization scheme that just uses two signal paths, is able to outperform the existing localization schemes in both LOS and extreme NLOS situations where all reference devices are in NLOS with the mobile device. This localization approach is very useful in multipath environments where it may not always be possible to have at least three reference devices in LOS with the mobile device.
Security-by-contract on the .NET platform
Authors: Lieven Desmet, Wouter Joosen, Fabio Massacci, Pieter Philippaerts, Frank Piessens, Ida Siahaan, Dries Vanoverberghe
Venue: Information Security Tech. Report (2008)

Over the last few years, the success of GPS-enabled PDAs has finally instigated a breakthrough of mobile devices. Many people now already have a device that can connect to the Internet and run untrusted code, typically a cell-phone or PDA. Having such a large interconnected and powerful computing base presents some new security issues. In order to counter new threats, the traditional security architectures need to be overhauled to support a new and more flexible way of securely executing mobile code. This article describes the concept of security-by-contract (SxC) and its implementation on the .NET platform. This new model allows users to guarantee that an untrusted application remains within the boundaries of acceptable behavior, as defined by the user herself. A number of different techniques will be presented that can be employed to enforce this behavior. In order to support the SxC paradigm, some new steps can be introduced in the application development process. In addition to building an application, developers can create an application contract and securely bind this contract to the application. The application deployment process supports legacy applications developed without such contracts, but it can support more advanced enforcement technologies for those applications that are SxC-aware.
Electrical method of measuring physical thickness and nitrogen concentration of silicon oxynitride gate dielectric for MOSFETs
Authors: J. H. Do, H. S. Kang, B. K. Kang
Venue: Microelectronic Engineering (2008)

This paper proposes an electrical method of measuring the physical thickness T"o"x and the nitrogen concentration @a"N of the silicon oxynitride (SiON) gate dielectric for MOSFETs. The proposed method uses the facts that the gate dielectric breakdown field strength E"B"D depends on @a"N for a given T"o"x and the direct tunneling (DT) current depends strongly on T"o"x. Gate current I"g versus gate voltage V"g (I"g-V"g) curves at a given @a"N were calculated for different T"o"xs using the DT model, and measurements were compared to the curves to obtain T"o"x. The @a"N was obtained by comparing the measured E"B"D at a given T"o"x with the theoretical E"B"D for a SiON gate dielectric. These two steps were iterated until the convergence error of @a"N was less than 1%. The I"g-V"g curves calculated using the extracted T"o"xs and @a"Ns agreed very well with measurements when V"g was less than the gate breakdown voltage. The difference between the equivalent oxide thickness (EOT) measured using the C-V method and the EOT calculated using the extracted T"o"x and @a"N was less than 7%, demonstrating that the proposed method can accurately determine T"o"x and @a"N of an ultra-thin SiON gate dielectric from only the measured I"g-V"g curve of the MOSFET.
A Novel Distributed Authentication Framework for Single Sign-On Services
Authors: Kaleb Brasee, S. Kami Makki, Sherali Zeadally
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In this paper we present a novel single sign-on scheme known as Secure Distributed Single Sign-On (SeDSSO). SeDSSO provides secure fault-tolerant authentication using threshold key encryption with a distributed authentication service. The authentication service consists of n total authentication servers utilizing a (t, n) threshold encryption scheme, where t distinct server-signed messages are required to generate a message signed by the service. SeDSSO provides secure portable identities by defining a two-factor identity that uses both a username/password and a unique USB device. The combination of a distributed authentication service and two-factor identities allows SeDSSO to securely authenticate users in any environment.
COMPLEMENTARITY OF THE LIVING SYSTEMS AND THE DIALECTICAL SYSTEMS THEORIES: THE CASE OF PUBLIC MEDICAL CARE IN SLOVENIA
Authors: Tatjana Mlakar, Matjaz Mulej
Venue: Cybernetics and Systems (2007)

Systems science is about synthesis and integration for holism. The living systems (LST) and the dialectical systems theories (DST) are equally old. If both a quite holistic insight and creativity are needed, a combination of the LST and the DST is a better choice than using each of them separately. LST can make many details visible, while DST can make them an information basis for an innovative action. LST alone can hardly provide an action, especially one of a creative orientation. DTS alone can hardly provide all the necessary insight, but it can provide a bridge between different aspects of the process at stake and help them produce creative synergies of different professions' insights. A case of combining both LST and DST in studying public health care proves fruitful. DTS can influence people to use LST and its insight in a creative way.
The out-of-sample problem for classical multidimensional scaling
Authors: Michael W. Trosset, Carey E. Priebe
Venue: Computational Statistics Data Analysis (2008)

Out-of-sample embedding techniques insert additional points into previously constructed configurations. An out-of-sample extension of classical multidimensional scaling is presented. The out-of-sample extension is formulated as an unconstrained nonlinear least-squares problem. The objective function is a fourth-order polynomial, easily minimized by standard gradient-based methods for numerical optimization. Two examples are presented.
Mining multiple-level fuzzy blocks from multidimensional data
Authors: Yeow Wei Choong, Anne Laurent, Dominique Laurent
Venue: Fuzzy Sets and Systems (2008)

Multidimensional databases are now recognized as being the standard way to store aggregated and historized data. Multidimensional databases are designed to store information on measures (also known as indicators) regarding a set of dimensions. One important issue in this framework is the identification of homogeneous areas in data cubes, which allows users to summarize and visualize the data through the main trends they contain. In our previous work, we have proposed a levelwise approach to mine homogeneous areas of the data, called blocks that can be interpreted, for instance, as If product is Chocolate and month is between January and March and city is London or Paris, then the number of sales is 5. However, in this work, the information provided by the hierarchies defined over the dimensions is not taken into account. In this paper, we consider the case where measure values are discretized using a fuzzy partition, and we extend our method so as to mine multiple-level fuzzy blocks, that is, blocks that are defined using hierarchies and that characterize fuzzy measure values. Moreover, in order to avoid redundancies in the output set of blocks, only the most specific ones (according to hierarchies) are computed. We show that our algorithms are linear in the size of the cube, thus providing an efficient method for summarizing data cubes.
CarWeb: A Traffic Data Collection Platform
Authors: Chia-Hao Lo, Wen-Chih Peng, Chien-Wen Chen, Ting-Yu Lin, Chun-Shuo Lin
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

In this paper, we exploit the concept of sharing GPS data for estimate traffic information. Explicitly, we implemented CarWeb, a platform to collect real-time GPS data from cars. Once receiving a sufficient amount of GPS data from cars, we are able to estimate traffic information (i.e., speed information of roads). As such, users are able to obtain the update-to-date traffic information in CarWeb platform. In addition, we propose two algorithms to estimate traffic information with GPS data given. A prototype of CarWeb is implemented and functionalities of each component in CarWeb are demonstrated in this paper.
Linear Congruential Generators Do Not Produce Random Sequences
Authors: A. M. Frieze
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

One of the most popular and fast methods of generating "random" sequence are linear congruential generators. This paper discusses the predictability of the sequence given only a constant proportion /spl alpha/ of the leading bits of the first few numbers generated. We show that the rest of the sequence is predictable in polynomial time, almost always, provided /spl alpha/ > 2/5.
Dual decomposition method for optimal and fair congestion control in Ad Hoc networks: Algorithm, implementation and evaluation
Authors: WeiQiang Xu, YaMing Wang, JiMing Chen, George Baciu, Youxian Sun
Venue: Journal of Parallel and Distributed Computing (2008)

For the design of a more efficient congestion control algorithm to optimize the resource allocation in Ad Hoc networks, the notion of the link's interference set is introduced to represent the contention relationship among flows in Ad Hoc networks, which is the fundamental difference from the contention relationship among flows in Internet. And the congestion control problem is formulated as a nonlinear optimization problem with the capacity constraint of the link's interference set. Then, based on the dual decomposition method, this problem is decomposed into many subproblems, which can be solved independently in a parallel fashion at each source/link, and builds the Dual Decomposition based Optimal and Fair Congestion Control framework (D^2OFC^2) to coordinate their source allocation among flows. Considering the synchronous implementation is difficult in realistic environment, the asynchronous implementation of D^2OFC^2 is presented. To deploy the practical protocol of D^2OFC^2, three deployment techniques are proposed: Queue Size Estimation method (QSE), Neighbor Set Approximation method (NSA), and Extensive HELLO message-based Piggybacking (EHP).The MATLAB-based simulation results illustrate that D^2OFC^2 can approach the globally optimal solution even in asynchronous environment. The NS2-based simulation results demonstrate that D^2OFC^2 outperforms default TCP and ATCP to achieve an efficient and fair resource allocation in Ad Hoc networks under three scenarios, including chain topology, grid topology, and random topology.
New policies for the dynamic traveling salesman problem
Authors: Gianpaolo Ghiani, Antonella Quaranta, Chefi Triki
Venue: Optimization Methods Software (2007)

The dynamic traveling salesman problem is a variant of the classical traveling salesman problem in which service requests arrive in a random fashion. In this paper we propose three new routing policies minimizing the expected total waiting time of all the demands in the system. In particular, we show that two policies are asymptotically optimal in heavy traffic, whereas the third one has a constant factor guarantee of two. We also perform extensive simulations in order to compare the three policies under various arrival rates.
Word-interleaved cache: an energy efficient data cache architecture
Authors: T. Venkata Kalyan, Madhu Mutyam
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

We propose a novel energy-efficient data cache architecture, namely, word-interleaved (WI) cache. In theWI cache, a cache block is distributed uniformly among the different cache ways and each line of a cache way holds some words of the block. This distribution provides an opportunity to activate/deactivate the cache ways based on the requested address's offset, thus minimizing the overall cache access energy. For a 4-way set associative cache of size 16KB and blocksize 32B, the proposed technique accomplishes dynamic energy savings of 54.2% without considering fast hits and 62.3% when fast hits are considered, with small performance degradation and negligible area overhead.
Parameter Identification of Nonlinear Viscoelastic-Plastic Constitutive Equation of Soybean and Cottonseed Based on Particles Swarm Optimization
Authors: Xiao Zheng, Guoxiang Lin, Jingzhou Wang, Yaxin Zhang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

By using of combining theoretical model with empirical model, the nonlinear viscoelastic-plastic constitutive equations of soybean and cottonseed were developed on the basis of the creep test. The parameter inverse problem of constitutive model was proposed using improved particles swarm optimization. Numerical simulations of creep of soybean and cottonseed were carried out. The definition of critical pressing time for oil extraction and the method for determining the critical pressing time using creep rate were proposed. The values of critical pressing time for extruded soybean and cottonseed under six applied pressures were evaluated. Results indicated that the nonlinear viscoelastic-plastic constitutive model could simulate rheological behaviors of soybean and cottonseed very well. Mean relative deviations between the experimental and predicted values of soybean and cottonseed were 1.55% and 1.93%, respectively. There were significant decreases in the values for the creep rates in the early stage of pressing, and decreases to an insignificant and stabilize value in the later stage.