ppxscal/embedding_network huggingface dataset:
An Evaluation Method of the Number of Monte Carlo STA Trials for Statistical Path Delay Analysis
Authors: Masanori Imai, Takashi Sato, Noriaki Nakayama, Kazuya Masu
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We present an evaluation method for estimating the lower bound number of Monte Carlo STA trials required to obtain at least one sample which falls within top-k % of its parent population. The sample can be used to ensure that target designs are timing-error free with a predefined probability using the minimum computational cost. The lower bound number is represented as a closed-form formula which is general enough to be applied to other verifications. For validation, Monte Carlo STA was carried out on various benchmark data including ISCAS circuits. The minimum number of Monte Carlo runs determined using the proposed method successfully extracted one or more top-k % delay instances.
Interference Aware and Delay Bounded Routing in Hybrid Wireless-Optical Access Network
Authors: Zeyu Zheng, Jianping Wang, Jin Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Hybrid Wireless-Optical Access Network (WOAN) is a newly emerged network which integrates passive optical networks (PONs) and wireless mesh neworks(WMNs) to provide the ubiquitous, high bandwidth last mile Internet access. In WOAN, transmission delay for traffic up to the Internet consists of wireless path delay in WMNs and waiting delay at ONUs due to the TDMA schedule. The ONU from which transmission delay is minimal is chosen to be the destination for traffic and the minimal transmission delay is defined as delay bound. In the paper, we intend to find the wireless path to the destinated ONU with path delay no more than delay bound and meanwhile with the minimal maximal link delay, which is defined as Interference Aware and Delay Bounded Routing (IADBR) problem. We propose both centralized and distributed algorithms to solve IADBR. Simulation results show that the distributed algorithm performs quite closely to the optimal centralized algorithm and performs much better than the shortest path algorithm.
Shape Discrimination Using Integral Features
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

"Integral features" are calculated by summing the local features over all the pixels, where the local features are determined by the state of the neighborhood of each pixel. The states are defined by using a two-dimensional series of mask functions on the polar coordinate system with the logarithmic scale of r-direction. This definition enables the efficient extraction of features from any arbitrary distant area. The features for shape discrimination are constructed from the short-range correlations of the gradients of the image data. For discrimination of image data we used the linear model as used in the multivariate analysis. We also developed nonlinear model learning by maximizing the discriminant efficiency. In the models, each pixel has the value that represents the validity of discrimination and weighted summations are performed when the integral features are calculated. The validity of the linear and nonlinear models is verified in experiments using the image data of real objects. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A note on universal composable zero-knowledge in the common reference string model
Authors: Andrew C. C. Yao, Frances F. Yao, Yunlei Zhao
Venue: Theoretical Computer Science (2009)

Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model lose deniability that is a natural security property and implication of the ZK functionality in accordance with the UC framework. An open problem (or, natural query) raised in the literature is: are there any other essential security properties, other than the well-known deniability property, that could be lost by UCZK in the CRS model, in comparison with the ZK functionality in accordance with the UC framework? In this work, we answer this open question (or, natural query), by showing that when running concurrently with other protocols UCZK in the CRS model can lose proof of knowledge (POK) property that is very essential and core security implication of the ZK functionality. This is demonstrated by concrete attack against naturally existing UCZK protocols in the CRS model. Then, motivated by our attack, we make further clarifications of the underlying reasons beneath the concrete attack, and investigate the precise security guarantee of UC with CRS.
Convergence and stability of a numerical method for micromagnetics
Authors: Zhiping Li, Xianmin Xu
Venue: Numerische Mathematik (2009)

The convergence and stability of a numerical method, which applies a nonconforming finite element method and an artificial boundary method to a multi-atomic Young measure relaxation model, for micromagnetics are analyzed. By revealing some key properties of the solution sets of both the continuous and discrete problems, we show that our numerical method is stable, and the solution set of the continuous problem is well approximated by those of the discrete problems. The performance of our method is also illustrated by some numerical examples.
Signed-rank tests for location in the symmetric independent component model
Authors: Klaus Nordhausen, Hannu Oja, Davy Paindaveine
Venue: Journal of Multivariate Analysis (2009)

The so-called independent component (IC) model states that the observed p-vector X is generated via X=@LZ+@m, where @m is a p-vector, @L is a full-rank matrix, and the centered random vector Z has independent marginals. We consider the problem of testing the null hypothesis H"0:@m=0 on the basis of i.i.d. observations X"1,...,X"n generated by the symmetric version of the IC model above (for which all ICs have a symmetric distribution about the origin). In the spirit of [M. Hallin, D. Paindaveine, Optimal tests for multivariate location based on interdirections and pseudo-Mahalanobis ranks, Annals of Statistics, 30 (2002), 1103-1133], we develop nonparametric (signed-rank) tests, which are valid without any moment assumption and are, for adequately chosen scores, locally and asymptotically optimal (in the Le Cam sense) at given densities. Our tests are measurable with respect to the marginal signed ranks computed in the collection of null residuals @L@?^-^1X"i, where @L@? is a suitable estimate of @L. Provided that @L@? is affine-equivariant, the proposed tests, unlike the standard marginal signed-rank tests developed in [M.L. Puri, P.K. Sen, Nonparametric Methods in Multivariate Analysis, Wiley & Sons, New York, 1971] or any of their obvious generalizations, are affine-invariant. Local powers and asymptotic relative efficiencies (AREs) with respect to Hotelling's T^2 test are derived. Quite remarkably, when Gaussian scores are used, these AREs are always greater than or equal to one, with equality in the multinormal model only. Finite-sample efficiencies and robustness properties are investigated through a Monte Carlo study.
Experimenting in mobile social contexts using JellyNets
Authors: Peter Gilbert, Eduardo Cuervo, Landon P. Cox
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

Programmable consumer devices have placed computation within arm's reach at all times and in all places. Unfortunately, researchers interested in investigating this phenomenon often struggle with the expense, inconvenience, and limited scale of existing experimental platforms. In this paper, we introduce a new experimental platform for mobile and pervasive computing based on JellyNets, an abstraction for exposing experiments to arbitrary mobile social contexts.
Mining frequent closed itemsets from a landmark window over online data streams
Authors: Xuejun Liu, Jihong Guan, Ping Hu
Venue: Computers Mathematics with Applications (2009)

The frequent closed itemsets determine exactly the complete set of frequent itemsets and are usually much smaller than the later. However, mining frequent closed itemsets from a landmark window over data streams is a challenging problem. To solve the problem, this paper presents a novel algorithm (called FP-CDS) that can capture all frequent closed itemsets and a new storage structure (called FP-CDS tree) that can be dynamically adjusted to reflect the evolution of itemsets' frequencies over time. A landmark window is divided into several basic windows and these basic windows are used as updating units. Potential frequent closed itemsets in each basic window are mined and stored in FP-CDS tree based on some proposed strategies. Extensive experiments are conducted to validate the proposed method.
NangKOM: Development of a Web Based Job Scheduling Tools for "Nangka on Mobile Using Wi-Fi Technology
Authors: Mustafa Man, W. Aezwani W. Abu Bakar, Che Hassanudin Che Hussin
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Nangka or Jackfruit is one of the plantation crops which are commercialized in Agriculture Business industry in Malaysia. There are certain activities involved in cultivation process until it's marketed. Every day job routine is done by farmer like pruning, fruit thinning, weeding, fertilizing and so on. Those job activities are not in well planned and schedule. The development of NangKOM software could help the farmers for their daily activities in this industry. NangKOM has been developed using web based technology and open source tools like PHP, MySQL database and Apache Web Server. NangKOM application will be accessed through mobile devices using Wi-Fi technology. The entire task schedule will be recorded and identified for the next job or task to do. These tools could produce forecasting result for jackfruit in graphical graph format and analysis. Therefore, it is hoped that NangKOM could improve and increase the productivity of Agriculture field in Malaysia.
Analysis of Support Vector Machines Regression
Authors: Hongzhi Tong, Di-Rong Chen, Lizhong Peng
Venue: Foundations of Computational Mathematics (2009)

Support vector machines regression (SVMR) is a regularized learning algorithm in reproducing kernel Hilbert spaces with a loss function called the &#x03b5;-insensitive loss function. Compared with the well-understood least square regression, the study of SVMR is not satisfactory, especially the quantitative estimates of the convergence of this algorithm. This paper provides an error analysis for SVMR, and introduces some recently developed methods for analysis of classification algorithms such as the projection operator and the iteration technique. The main result is an explicit learning rate for the SVMR algorithm under some assumptions.
Example-based dialog modeling for practical multi-domain dialog system
Authors: Cheongjae Lee, Sangkeun Jung, Seokhwan Kim, Gary Geunbae Lee
Venue: Speech Communication (2009)

This paper proposes a generic dialog modeling framework for a multi-domain dialog system to simultaneously manage goal-oriented and chat dialogs for both information access and entertainment. We developed a dialog modeling technique using an example-based approach to implement multiple applications such as car navigation, weather information, TV program guidance, and chatbot. Example-based dialog modeling (EBDM) is a simple and effective method for prototyping and deploying of various dialog systems. This paper also introduces the system architecture of multi-domain dialog systems using the EBDM framework and the domain spotting technique. In our experiments, we evaluate our system using both simulated and real users. We expect that our approach can support flexible management of multi-domain dialogs on the same framework.
Temporally smoothed and gap-filled MODIS land products for carbon modelling: application of the ƒPAR product
Authors: J. M. Nightingale, J. T. Morisette, R. E. Wolfe, B. Tan, F. Gao, G. Ederer, G. J. Collatz, D. P. Turner
Venue: International Journal of Remote Sensing (2009)

TIMESAT software is used to produce a temporally and spatially Gap-Filled and Smoothed (GFS) version of the MODIS (Moderate Resolution Imaging Spectro-radiometer) &fnof;PAR (fraction of absorbed photosynthetically active radiation) product (MOD15). We apply this new &fnof;PAR product within two commonly used carbon and vegetation productivity models, CASA (Carnegie-Ames-Stanford Approach) and the MODIS GPP (Gross Primary Production) algorithm (MOD17). The GFS product removes noise present within the original MOD15 &fnof;PAR dataset, yet is comparable to the linearly interpolated UMT (University of Montana) &fnof;PAR used in the MOD17 algorithm. However, the GSF data provides a realistic &fnof;PAR time-series in relation to magnitude and seasonality associated with radiation in regions where persistent cloud cover is an issue. It is available for North America and the northern part of South America covering the Amazon basin for the MODIS acquisition period (2000-2005).
Modeling and Simulating a Mathematical Tool for Multi-robot Pattern Transformation
Authors: Blesson Varghese, Gerard T. McKee
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

The work reported in this paper is motivated by the need to investigate general methods for pattern transformation. A formal definition for pattern transformation is provided and four special cases namely, elementary and geometric transformation based on repositioning all and some agents in the pattern are introduced. The need for a mathematical tool and simulations for visualizing the behavior of a transformation method is highlighted. A mathematical method based on the Moebius transformation is proposed. The transformation method involves discretization of events for planning paths of individual robots in a pattern. Simulations on a particle physics simulator are used to validate the feasibility of the proposed method.
Standard Deviation and Intra Prediction Mode Based Adaptive Spatial Error Concealment (SEC) in H.264/AVC
Authors: Jun Wang, Lei Wang, Takeshi Ikenaga, Satoshi Goto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Transmission of compressed video over error prone channels may result in packet losses or errors, which can significantly degrade the image quality. Therefore an error concealment scheme is applied at the video receiver side to mask the damaged video. Considering there are 3 types of MBs (Macro Blocks) in natural video frame, i.e., Textural MB, Edged MB, and Smooth MB, this paper proposes an adaptive spatial error concealment which can choose 3 different methods for these 3 different MBs. For criteria of choosing appropriate method, 2 factors are taken into consideration. Firstly, standard deviation of our proposed edge statistical model is exploited. Secondly, some new features of latest video compression standard H.264/AVC, i.e., intra prediction mode is also considered for criterion formulation. Compared with previous works, which are only based on deterministic measurement, proposed method achieves the best image recovery. Subjective and objective image quality evaluations in experiments confirmed this.
Binary Constant Weight Codes Based on Cyclic Difference Sets
Authors: Nian Li, Xiangyong Zeng, Lei Hu
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Based on cyclic difference sets, sequences with two-valued autocorrelation can be constructed. Using these constructed sequences, two classes of binary constant weight codes are presented. Some codes proposed in this paper are proven to be optimal.
Estimating Aggregates over Multiple Sets
Authors: Edith Cohen, Haim Kaplan
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Many datasets, including market basket data, text or hypertext documents, and measurement data collected in different nodes or time periods, are modeled as a collection of sets over a ground set of (weighted) items. We consider the problem of estimating basic aggregates such as the weight or selectivity of a subpopulation of the items. We extend classic summarization techniques based on sampling to this scenario when we have multiple sets and selection predicates based on membership in particular sets.
Virtual Crowds: Methods, Simulation, and Control (Synthesis Lectures on Computer Graphics and Animation)
Authors: Norman Badler
Venue:  (2008)

There are many applications of computer animation and simulation where it is necessary to model virtual crowds of autonomous agents. Some of these applications include site planning, education, entertainment, training, and human factors analysis for building evacuation. Other applications include simulations of scenarios where masses of people gather, flow, and disperse, such as transportation centers, sporting events, and concerts. Most crowd simulations include only basic locomotive behaviors possibly coupled with a few stochastic actions. Our goal in this survey is to establish a baseline of techniques and requirements for simulating large-scale virtual human populations. Sometimes, these populations might be mutually engaged in a common activity such as evacuation from a building or area; other times they may be going about their individual and personal agenda of work, play, leisure, travel, or spectator. Computational methods to model one set of requirements may not mesh well with good approaches to another. By including both crowd and individual goals and constraints into a comprehensive computational model, we expect to simulate the visual texture and contextual behaviors of groups of seemingly sentient beings.Table of Contents: Introduction / Crowd Simulation Methodology Survey / Individual Differences in Crowds / Framework (HiDAC + MACES + CAROSA) / HiDAC: Local Motion / MACES: Wayfinding with Communication and Roles / CAROSA: Functional Crowds / Initializing a Scenario / Evaluating Crowds
Dynamically survivable WDM network design with shared-cycles-based PWCE
Authors: Zhenrong Zhang, Anshi Xu, Yongqi He
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The concept of a protected working capacity envelope (PWCE) is very attractive for designing a dynamically survivable WDM network. In this paper, we consider a shared-cycles-based PWCE approach for designing survivable WDM networks where the traffic demand is dynamically changing. We develop an integer linear programming formulation to determine the protected working capacity envelope and use simulations to evaluate the blocking performance.
Composite subscriptions in content-based publish/subscribe systems
Authors: Guoli Li, Hans-Arno Jacobsen
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

Distributed publish/subscribe systems are naturally suited for processing events in distributed systems. However, support for expressing patterns about distributed events and algorithms for detecting correlations among these events are still largely unexplored. Inspired from the requirements of decentralized, event-driven workflow processing, we design a subscription language for expressing correlations among distributed events. We illustrate the potential of our approach with a workflow management case study. The language is validated and implemented in PADRES. In this paper we present an overview of PADRES, highlighting some of its novel features, including the composite subscription language, the coordination patterns, the composite event detection algorithms, the rule-based router design, and a detailed case study illustrating the decentralized processing of workflows. Our experimental evaluation shows that rule-based brokers are a viable and powerful alternative to existing, special-purpose, content-based routing algorithms. The experiments also show that the use of composite subscriptions in PADRES significantly reduces the load on the network. Complex workflows can be processed in a decentralized fashion with a gain of 40% in message dissemination cost. All processing is realized entirely in the publish/subscribe paradigm.
Opportunities for multiagent systems and multiagent reinforcement learning in traffic control
Authors: Ana L. Bazzan
Venue: Autonomous Agents and Multi-Agent Systems (2009)

The increasing demand for mobility in our society poses various challenges to traffic engineering, computer science in general, and artificial intelligence and multiagent systems in particular. As it is often the case, it is not possible to provide additional capacity, so that a more efficient use of the available transportation infrastructure is necessary. This relates closely to multiagent systems as many problems in traffic management and control are inherently distributed. Also, many actors in a transportation system fit very well the concept of autonomous agents: the driver, the pedestrian, the traffic expert; in some cases, also the intersection and the traffic signal controller can be regarded as an autonomous agent. However, the "agentification" of a transportation system is associated with some challenging issues: the number of agents is high, typically agents are highly adaptive, they react to changes in the environment at individual level but cause an unpredictable collective pattern, and act in a highly coupled environment. Therefore, this domain poses many challenges for standard techniques from multiagent systems such as coordination and learning. This paper has two main objectives: (i) to present problems, methods, approaches and practices in traffic engineering (especially regarding traffic signal control); and (ii) to highlight open problems and challenges so that future research in multiagent systems can address them.
Stochastic Robustness Controller Design upon Different Ranking Criteria
Authors: Hao Wu, Yali Xue, Tingjin Ren
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In order to evaluate the robustness performance of process control system with uncertainties, four quantified stochastic robustness indices are introduced upon some typical stochastic variable ranking criteria. Based on them, four kinds of stochastic robust controller optimization problems are presented to meet the system requirements. To solve the multi-objective stochastic programming problems, NSGA-II algorithm combined with Monte-Carlo experiments are utilized to obtain the Pareto robustness solutions. The methods are applied to a steam-turbine generator set control system design. The simulation results demonstrate better robustness performance compared with those obtained under nominal parameter condition. Further more, detailed comparison among the four methods reveals their unique character, in which pessimistic value criterion method is considered to be relatively the best.
Making Research More Relevant While Not Diminishing Its Rigor
Authors: Robert L. Glass
Venue: IEEE Software (2009)

One way to combine rigor and relevance in research might be to perform applicability checks, in which focus groups provide feedback on research projects.