ppxscal/embedding_network huggingface dataset:
Modeling concurrent operational interruptions in construction activities with Simplified Discrete Event Simulation Approach (SDESA)
Authors: Ming Lu, Wah-Ho Chan
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Numerous previous applications have demonstrated the high potential of discrete simulation methodologies in designing and analyzing construction systems. Still, construction simulation applications largely remain software exercises at the academic level because of the time and effort as required in constructing a valid simulation model that matches the real processes and operations. This paper introduces an enhanced version of the Simplified Discrete Event Simulation Approach (SDESA) by incorporating a concurrent interruptions model, which is intended to make construction simulations more realistic without compromising the simplicity of the original SDESA. Particular emphasis is placed on how to model the effects of operational interruptions upon the system performance by applying SDESA. The well-established CYCLONE method acts as a cross-validation tool to check the results given by SDESA. And the validity and simplicity of SDESA modeling are illustrated with a simple earthmoving operation simulation and a real hoist and barrow concreting operation simulation.
An Approach to Optimizations Links Utilization in MPLS Networks
Authors: M. K. Huerta, X. Hesselbach, R. Fabregat
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

In this paper we present a study for the optimization of the links utilization in several MPLS network topologies. This information helps in determining the maximum link utilization required, which is a valuable knowledge in balancing load strategies in the network. We present mathematical models that tune the optimal parameters for strategically routing traffic in an MPLS network. We present the Optimal Link Utilization Model (OLUM) for different topologies. OLUM provides an approach that would result in optimally balanced link utilization. Finally we compare the results of the model with the interior point and simplex algorithms. Results show that the maximum link utilization required is minimized.
Preattentive Binding of Auditory and Visual Stimulus Features
Authors: István Winkler, István Czigler, Elyse Sussman, János Horváth, Lászlo Balázs
Venue: Journal of Cognitive Neuroscience (2005)

We investigated the role of attention in feature binding in the auditory and the visual modality. One auditory and one visual experiment used the mismatch negativity (MMN and vMMN, respectively) event-related potential to index the memory representations created from stimulus sequences, which were either task-relevant and, therefore, attended or task-irrelevant and ignored. In the latter case, the primary task was a continuous demanding within-modality task. The test sequences were composed of two frequently occurring stimuli, which differed from each other in two stimulus features (standard stimuli) and two infrequently occurring stimuli (deviants), which combined one feature from one standard stimulus with the other feature of the other standard stimulus. Deviant stimuli elicited MMN responses of similar parameters across the different attentional conditions. These results suggest that the memory representations involved in the MMN deviance detection response encoded the frequently occurring feature combinations whether or not the test sequences were attended. A possible alternative to the memory-based interpretation of the visual results, the elicitation of the McCollough color-contingent aftereffect, was ruled out by the results of our third experiment. The current results are compared with those supporting the attentive feature integration theory. We conclude that (1) with comparable stimulus paradigms, similar results have been obtained in the two modalities, (2) there exist preattentive processes of feature binding, however, (3) conjoining features within rich arrays of objects under time pressure and/or longterm retention of the feature-conjoined memory representations may require attentive processes.
Inferential, robust non-negative matrix factorization analysis of microarray data
Authors: Paul Fogel, S. Stanley Young, Douglas M. Hawkins, Nathalie Ledirac
Venue: Bioinformatics (2007)

Motivation: Modern methods such as microarrays, proteomics and metabolomics often produce datasets where there are many more predictor variables than observations. Research in these areas is often exploratory; even so, there is interest in statistical methods that accurately point to effects that are likely to replicate. Correlations among predictors are used to improve the statistical analysis. We exploit two ideas: non-negative matrix factorization methods that create ordered sets of predictors; and statistical testing within ordered sets which is done sequentially, removing the need for correction for multiple testing within the set. Results: Simulations and theory point to increased statistical power. Computational algorithms are described in detail. The analysis and biological interpretation of a real dataset are given. In addition to the increased power, the benefit of our method is that the organized gene lists are likely to lead better understanding of the biology. Availability: An SAS JMP executable script is available from http://www.niss.org/irMF Contact: young@niss.org Supplementary information: http://www.niss.org/irMF
Exploiting Geometrical Properties on Protein Similarity Search
Authors: Saiful Akbar, Josef Kung, Roland Wagner
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

This paper discusses about several combinations of protein similarity measurement-methods, with respect to normalization, spatial partitions, geometrical properties, and distance metrics. We compare the effectiveness of possible combinations to each other. Our experiment shows that the feature based on fractional occupancy outperforms other methods. In addition, merging individual features might also yield good result. A prototype of 3D protein geometrical-similarity retrieval system is built for implementing our approach.
A Generic Framework for Monitoring Timing Constraints over Uncertain Events
Authors: Honguk Woo, Aloysius K. Mok, Chan-Gun Lee
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

This paper provides a comprehensive approach to the problem of monitoring timing constraints over event streams for which the timestamp values are inherently uncertain. We first propose a generic framework for capturing the early detection of the violation of timing constraints, based on the notion of probabilistic violation time. In doing so, we provide a systemic approach for deriving a set of necessary constraints at compilation time. Our work is innovative in that the framework is formulated to be "modular" with respect to the probability distributions on timestamp values. We demonstrate the applicability of the framework for two different timestamp models, Gaussian and Histogram. The gaussian model is appropriate for representing event timing from a wide variety of sensors with well-modelled physical noise characteristics; we show how we can efficiently derive the probabilistic violation time of timing constraints by exploiting the relation between the gaussian distribution parameters. The histogram model can be used where the timestamps of events are available from measurements only as arbitrary probability distributions: we show how to derive an efficient timing constraint monitoring method for the histogram model.
Applying patterns to novice programming problems
Authors: Ron Porter, Paul Calder
Venue: Proceedings of the 2002 conference on Pattern languages of programs - Volume 13 (2003)

A major difficulty for novice programmers is the application of their knowledge of programming language features to the solving of novel problems. As patterns are built around problem-solution pairs their use in this context is indicated. This paper suggests a process for applying patterns to problems and demonstrates its use in a simple example problem.
Using Mobile Agents for Object Sharing in P2P Networks
Authors: Tainchi Lu, Mingchi Fu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper we devise a stationary agent to serve as a coordinator between federates and mobile clients. Furthermore, we employ a logical ring construction to facilitate the object sharing and matching. A navigating agent dispatched by the stationary agent can follow a mobile client to transport to the target. Besides, once the client requires more remote objects, the navigating agent refers to the itinerary that was specified by the stationary agent to migrate to the next destination for acquiring them. The experimental results show that the usage of mobile agents can increase more capabilities, flexibilities, and adaptabilities to most large-scale simulations.
Memory Protection through Dynamic Access Control
Authors: Kun Zhang, Tao Zhang, Santosh Pande
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Current anomaly detection schemes focus on control flow monitoring. Recently, Chen et al. [2] discovered that a large category of attacks tamper program data but do not alter control flows. These attacks are not only realistic, but are also as important as classical attacks tampering control flows. Detecting these attacks is a critical issue but has received little attention so far. In this work, we propose an intrusion detection scheme with both compiler and micro-architecture support detecting data tampering directly. The compiler first identifies program regions in which the data should not be modified as per program semantics. Then the compiler performs an analysis to determine the conditions for modification of variables in different program regions and conveys this information to the hardware and the hardware checks the data accesses based on the information. If the compiler asserts that the data should not be modified but there is an attempt to do so at runtime, an attack is detected. The compiler starts with a basic scheme achieving maximum data protection but such a scheme also suffers from high performance overhead. We then attempt to reduce the performance overhead through different optimization techniques. Our experiments show that our scheme achieves strong memory protection with tight control over the performance degradation. Thus, our major contribution is to provide an efficient scheme to detect data tampering while minimizing the overhead.
An fMRI Investigation of Speech and Tone Segmentation
Authors: Paul C. Locasto, Donna Krebs-Noble, Rao P. Gullapalli, Martha W. Burton
Venue: Journal of Cognitive Neuroscience (2004)

Recent research strongly indicates that phonological tasks activate a subregion of the inferior frontal gyrus. The purpose of the present fMRI study was to investigate the extent to which activation of this region during phonological processing is due to speech processes per se such as articulatory recoding or to other cognitive task demands such as working memory. Thus, we compared activation patterns during segmentation of speech and tone sequences to a tone discrimination task. In particular, participants performed same/different judgments on pairs of words, pseudowords, and tone sequences that required segmentation of a continuous acoustic signal as well as tone pairs that did not require segmentation. Accuracy and reaction time data showed that speech and tone sequence segmentation conditions patterned more similarly to each other than to tone discrimination pairs. Analyses of group data revealed strong activation of the region at the border of the left inferior and middle frontal gyrus for all three segmentation conditions compared to tone discrimination, but no consistent differences were observed when word and pseudoword segmentation were directly contrasted. Analyses of individual subjects indicated that a large number of participants activated a small area of the middle frontal gyrus during the speech conditions compared to the sequences. These results suggest that a significant portion of active frontal areas is recruited for extracting acoustic information and maintaining it in memory for decision. However, some regions at the border of the inferior/middle frontal gyrus may be unique to speech segmentation.
Modelling heterogeneity in manpower planning: dividing the personnel system into more homogeneous subgroups: Research Articles
Authors: Tim De Feyter
Venue: Applied Stochastic Models in Business and Industry (2006)

Manpower planning is very useful for human resource management in large organizations. Most manpower models are concerned with the prediction of the future behaviour of the staff: they might leave the organization, get promoted or acquire more and new skills. This behaviour can vary a lot among different employees, what makes prediction difficult. It is common to tackle this problem by dividing the whole heterogeneous personnel system in several more homogeneous subgroups. This approach is often used to develop manpower planning models for prediction, control or optimization. Although the division in homogeneous subcategories is a fundamental and important step in the application of the models, up till now literature neglects to discuss a procedure to deal with this in practice. This paper suggests a general framework to find the distinguished homogeneous subcategories by determining and considering observable sources of personnel heterogeneity. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Formulating ordering policies in a supply chain by genetic algorithm
Authors: C.-C. H. Chan, C.-B. Cheng, S.-W. Huang
Venue: International Journal of Modelling and Simulation (2006)

This paper proposes using mixed inventory policies to determine ordering quantities for all organizations in a supply chain. Agents of organizations choose inventory policies from a set of candidate policies, and determine their ordering quantities for each period according to the chosen policies. A genetic algorithm is formulated to search for the optimal combination of inventory policies to minimize the total costs of the whole supply chain over a time horizon. To illustrate and evaluate the performance of our approach, many different setups of experiments are conducted by computer simulation of an MIT Beer game.
Network-Aware Overlays with Network Coordinates
Authors: Peter Pietzuch, Jonathan Ledlie, Michael Mitzenmacher, Margo Seltzer
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Network coordinates, which embed network distance measurements in a coordinate system, were introduced as a method for determining the proximity of nodes for routing table updates in overlay networks. Their power has far broader reach: due to their low overhead and automatic adaptation to changes in the network, network coordinates provide a new paradigm for managing dynamic overlay networks. We compare network coordinates to other proposals for network-aware overlays and show how they permit the lucid expression of a range of distributed systems problems in well-understood geometric terms.
A Game Theoretic Approach to Power Aware Wireless Data Access
Authors: Mark Kai Ho Yeung, Yu-Kwong Kwok
Venue: IEEE Transactions on Mobile Computing (2006)

We consider a basic scenario in wireless data access: a number of mobile clients are interested in a set of data items kept at a common server. Each client independently sends requests to inform the server of its desired data items and the server replies with a broadcast channel. We are interested in studying the energy consumption characteristics in such a scenario. First, we define a utility function for quantifying performance. Based on the utility function, we formulate the wireless data access scenario as a noncooperative game—wireless data access (WDA) game. Although our proposed probabilistic data access scheme does not rely on client caching, game theoretical analysis shows that clients do not always need to send requests to the server. Simulation results also indicate that our proposed scheme, compared with a simple always-request one, increases the utility and lifetime of every client while reducing the number of requests sent, with a cost of slightly larger average query delay. We also compare the performance of our proposed scheme with two popular schemes that employ client caching. Our results show that caching-only benefits clients with high query rates at the expense of both shorter lifetime and smaller utility in other clients.
A Collaborative Virtual Computer Security Lab
Authors: Jorg Keller, Ralf Naues
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The necessity of a lab course on computer security arises from the students' need to complement course work by hands-on experience. In order to meet the distance teaching demands of our institution, we designed an internet-based laboratory. We sketch the types of tasks the students are to perform, and our approach to check immediately whether students have completed a task. Yet, the typical tasks in labs only cover work done alone, while security engineering often comprises tasks involving several independent parties. This in turn calls for collaborative tasks, which we sketch. As students operate in larger groups, and the server hosting the lab machines can only run a finite number of them simultaneously, a reservation scheme is employed to guarantee fair access for all participants.
Integrating agent-oriented methodologies with UML-AT
Authors: Rubén Fuentes, Jorge J. Gómez-Sanz, Juan Pavón
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

There are many methodological approaches for Agent-Oriented Software Engineering, each one focusing on some features of multi-agent systems, but leaving others underdefined. For this reason, it would be interesting to have the possibility of applying different methods, according to their suitability to each particular problem domain and system view. Here, a key issue is how to integrate the information resulting from different methods in a common specification. We propose the use of an intermediate language called UML-AT, which would enable bidirectional transformations between models in different languages. These transformations allow representing views of those models in the language of choice at every moment. UML-AT is a UML profile based on the Activity Theory (AT) framework, which includes the concepts to describe societies of actors that are both autonomous and intentional. The translation with UML-AT mappings makes the integration process independent of any given methodology. At the same time, these mappings can be a basis to study missing features in design languages, according to what is needed in the study of the intentional and social aspects in multi-agent systems and human organizations following AT. This integration architecture by means of UML-AT mappings is illustrated with a case study about a legacy tourism application. It uses a support tool that automates the translation.
Evaluation of Signal Processing Effect in Media Gateway Based on Cross Correlation
Authors: Hao Wang, Yanying Wang, Jikun Guo, Dianwu Gao
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Signal processing is the critical equipment and the guarantee of technology to media gateway, so it is very important to evaluate the signal processing effect of media gateway. In this paper the Correlation Criterion which is based correlation operator on theory and uses correlation coefficient as the index of evaluation is put forward. In this method, the select of standard test signal is the key. The paper introduces the dependence and reason of choosing standard test signal. The cross correlation criterion is a normalized, quantitative, time domain evaluation method.
Information theoretic criteria for non-Gaussian ARMA order determination and parameter estimation
Authors: G. B. Giannakis, S. Shamsunder
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The problem of determining the orders and parameters of autoregressive moving average (ARMA) processes with an unknown but non-Gaussian probability density function is addressed. Asymptotically optimal, information theoretic criteria are developed based on higher-order statistics of the observed processes. The proposed algorithms rely upon sample cumulants, or polyspectra, and allow non-minimum phase and non-causal models unlike the conventional second-order correlation based methods. Unlike the linear rank-based cumulant methods, the nonlinear information theoretic type methods do not require subjective thresholding and yield strongly consistent estimators for the ARMA orders as well as the parameters. Simulation examples illustrate the feasibility of the theory.
On Rota's conjecture and excluded minors containing large projective geometries
Authors: Jim Geelen, Bert Gerards, Geoff Whittle
Venue: Journal of Combinatorial Theory Series B (2006)

We prove that an excluded minor for the class of GF(q)-representable matroids cannot contain a large projective geometry over GF(q) as a minor.
An Energy Level Based Routing Protocol in Ad Hoc Networks
Authors: Layuan Li, Chunlin Li, Peiyan Yuan
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

The study of energy constrained routing protocols in mobile Ad Hoc Networks (MANET) is attracting more attention recently. The typical MANET routing protocols of IETF are shortest routing protocols, that is, the least hops and do not consider the energy aware problem. Because the ad hoc network is an energy constrained system with the portable devices, it is a very important metric to evaluate the routing protocols whether which have a longer network lifetime or not. Based on the mobile node energy level and using the different forward tactics, this paper presents an energy level based routing protocols---ELBRP. The routing protocol not only makes the system energy consumption down but also prolongs the system lifetime and improves the delay characteristic. In this paper, the proof of correctness and complexity analysis of ELBRP are given. This paper campares the performance of existing protocols AODV, RDRP and proposed ELBRP via simulation. The studies show that ELBRP has a better delay performance, and a lower energy consumption and longer network lifetime than the other two and provides an available approach to ad hoc networks routing.
Understanding Human Behavior Using a Language Modeling Approach
Authors: Yu-Ming Liang, Sheng-Wen Shih, Arthur Chun-Chieh Shih, Hong-Yuan Mark Liao
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Visual analysis of human behavior has generated considerable interest in the field of computer vision because of the wide spectrum of potential applications. In this paper, we present a language modeling framework for understanding human behavior. The proposed framework consists of two modules: the key posture selection module, and the variable-length Markov model (VLMM) behavior recognition module. A key posture selection algorithm is developed based on the shape context matching technique. A codebook is then constructed with the computed key postures and used to convert input image sequences into training symbol sequences or recognition symbol sequences. Finally, a VLMM is applied to learn and recognize the constructed symbol sequences corresponding to human behavior patterns. Experiments on real data demonstrate the efficacy of the proposed system.