Investigating the concordance of Gene Ontology terms reveals the intra- and inter-platform reproducibility of enrichment analysis Reliability and Reproducibility of differentially expressed genes (DEGs) are essential for the biological interpretation of microarray data. The microarray quality control (MAQC) project launched by US Food and Drug Administration (FDA) elucidated that the lists of DEGs generated by intra- and inter-platform comparisons can reach a high level of concordance, which mainly depended on the statistical criteria used for ranking and selecting DEGs. Generally, it will produce reproducible lists of DEGs when combining fold change ranking with a non-stringent p-value cutoff. For further interpretation of the gene expression data, statistical methods of gene enrichment analysis provide powerful tools for associating the DEGs with prior biological knowledge, e.g. Gene Ontology (GO) terms and pathways, and are widely used in genome-wide research. Although the DEG lists generated from the same compared conditions proved to be reliable, the reproducible enrichment results are still crucial to the discovery of the underlying molecular mechanism differentiating the two conditions. Therefore, it is important to know whether the enrichment results are still reproducible, when using the lists of DEGs generated by different statistic criteria from inter-laboratory and cross-platform comparisons. In our study, we used the MAQC data sets for systematically accessing the intra- and inter-platform concordance of GO terms enriched by Gene Set Enrichment Analysis (GSEA) and LRpath.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

dna microarray
intra-/inter-platform comparison
gene ontology enrichment
microarray quality control (maqc)


An agent based system for activity monitoring on network ABSAMN Computer network as a force drags its customers to share more and more resources while on the other hand managing such network recourses is a challenging job for an IT professional and perhaps becoming difficult humanly. In this paper, we have proposed an agent based system for activity monitoring on network (ABSAMN) for the monitoring of resources over a network, suitable for network of networks; commonly known as CAN (campus area network). Multi-agent system is a system composed of several agents, collectively capable of achieving goals that are difficult to achieve by an individual agent or monolithic system. We propose the use of multi-agent system to ensure proper system operation by watching for inconsistencies in user activities, node level activity, internet monitoring, and system configuration. The system is fully autonomous and once initialized with the given rules and domain knowledge ABSAMN manages resources on its own with the help of mobile agents. We have evaluated this architecture on the university campus having seven labs equipped with 20300 number of PCs in various labs. Results were very promising and support the implementation of the solution.

O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

network monitoring
agent based monitoring
collaborated agent based system
absamn architecture
multi-agent system


CAPPS: A Framework for Power-Performance Tradeoffs in Bus-Matrix-Based On-Chip Communication Architecture Synthesis On-chip communication architectures have a significant impact on the power consumption and performance of emerging chip multiprocessor (CMP) applications. However, customization of such architectures for an application requires the exploration of a large design space. Designers need tools to rapidly explore and evaluate relevant communication architecture configurations exhibiting diverse power and performance characteristics. In this paper, we present an automated framework for fast system-level, application-specific, power-performance tradeoffs in a bus matrix communication architecture synthesis (CAPPS). Our study makes two specific contributions. First, we develop energy models for system-level exploration of bus matrix communication architectures. Second, we incorporate these models into a bus matrix synthesis flow that enables designers to efficiently explore the power-performance design space of different bus matrix configurations. Experimental results show that our energy macromodels incur less than 5% average cycle energy error across 180-65 nm technology libraries. Our early system-level power estimation approach also shows a significant speedup ranging from 1000 to 2000 when compared with detailed gate-level power estimation. Furthermore, on applying our synthesis framework to three industrial networking CMP applications, a tradeoff space that exhibits up to 20% variation in power and up to 40% variation in performance is generated, demonstrating the usefulness of our approach.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

communication architecture power estimation


Appearance-based person recognition using color/path-length profile Recognizing a person is a basic process of video understanding. In this paper, we present a method for recognizing (matching) persons based on their overall extrinsic appearance, regardless of their (upright) pose. Appearance is that of their visible clothing and bodies seen in silhouette obtained by background subtraction. The method of appearance recognition uses kernel estimation of probabilities associated with color/path-length profiles and uses KullbackLeibler distance to compare such profiles with possible models. We show that with suitable normalization of color variables our method appears to be robust under conditions varying viewpoints, complex illumination, and multiple cameras. Our method is also useful to detect changes in appearance, for instance caused by carried packages. When there are more than one profiles to match in one frame, we adopt multiple matching algorithm enforcing 1 to 1 constraint to improve the performance.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

person recognition
appearance
kullbackleibler distance

color/path-length
kernel density estimation


A framework for designing sustainable urban communities Purpose - The purpose of the paper is to show how the sustainability of urban settlements can be improved by treating as a variable the design of property rights: to realty, corporations, and currencies, and the communication and control architecture of communities. Design/methodology/approach - System science shows how the resulting increases in the richness and variety of communication and control channels improve the governance of urban precincts. The new variables also provide a way to integrate the design of the built environment into the design of its governance architecture. The scope of orthodox economic analysis is extended to include the value of assets and liabilities to provide additional feedback signals. This more holistic economic framework increases the richness of the '' semiotic '' channel of social communication and control that complements those based on senses, words and prices. Findings - The analysis reveals self-reinforcing feed-forward and feedback channels between the use and maintenance of the built environment and its governance architecture not available in less holistic design frameworks. Practical implications - The paper identifies the need for urban planners to extend their discipline to become governance architects and how the knowledge of system scientists can be applied to improve the design of capitalism. Originality/value - A new design paradigm is identified that allows improvements to be introduced in the ability of towns or suburbs, to become self-financing, self-governing political units. The paradigm identifies how capitalism can be designed to become more efficient, equitable, responsive, and democratic.

O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A 4-mm-square miniaturized Doherty power amplifier module for W-CDMA mobile terminals Recently, the Doherty amplifier technique has been the focus of attention not only for base stations but also for mobile terminals because of its high power-added efficiency in the large back-off region. In this paper, we present a miniaturized Doherty power amplifier (PA) module for W-CDMA mobile terminals. The developed Doherty PA module consists of a 4-mm-square ceramic substrate (4.0 mm x 4.0 mm x 1.5 mm, alumina, dielectric constant = 8.8), a 1-mm-square GaAs MMIC (1.0 mm x 1.0 mm x 0. 1 mm), and 0603-size SMD passive components. To miniaturize the module size, the optimal designed quarter-wavelength transmission lines, which are used for impedance conversion for carrier amplifier output and phase compensation for peak amplifier input, are embedded in the ceramic module substrate. Two GaAs HBTs for a carrier amplifier and a peak amplifier and base bias circuits for each amplifier are integrated onto a single-chip GaAs MMIC. Measurement results at 1950 MHz in a W-CDMA uplink signal indicate that 27 dBm of the maximum output power, 45% of the power-added efficiency (PAE), I I dB of power gain, and 43% of PAE at 6 dB back-off, i.e. 24 dBm output power, are obtained with the developed Doherty PA. In other words, the PAE is improved from the theoretical PAE of a conventional class B amplifier, namely, from 23% to 43%. This is the smallest Doherty amplifier developed in the form of a module for mobile terminals.

O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O


Time series forecasting using a hybrid ARIMA and neural network model Autoregressive integrated moving average (ARIMA) is one of the popular linear models in time series forecasting during the past three decades. Recent research activities in forecasting with artificial neural networks (ANNs) suggest that ANNs can be a promising alternative to the traditional linear methods. ARIMA models and ANNs are often compared with mixed conclusions in terms of the superiority in forecasting performance. In this paper, a hybrid methodology that combines both ARIMA and ANN models is proposed to take advantage of the unique strength of ARIMA and ANN models in linear and nonlinear modeling. Experimental results with real data sets indicate that the combined model can be an effective way to improve forecasting accuracy achieved by either of the models used separately.

O O O O O O B O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

time series forecasting combined forecast


Mitigation of Control Channel Jamming under Node Capture Attacks Availability of service in many wireless networks depends on the ability for network users to establish and maintain communication channels using control messages from base stations and other users. An adversary with knowledge of the underlying communication protocol can mount an efficient denial of service attack by jamming the communication channels used to exchange control messages. The use of spread spectrum techniques can deter an external adversary from such control channel jamming attacks. However, malicious colluding insiders or an adversary who captures or compromises system users is not deterred by spread spectrum, as they know the required spreading sequences. For the case of internal adversaries, we propose a framework for control channel access schemes using the random assignment of cryptographic keys to hide the location of control channels. We propose and evaluate metrics to quantify the probabilistic availability of service under control channel jamming by malicious or compromised users and show that the availability of service degrades gracefully as the number of colluding insiders or compromised users increases. We propose an algorithm called GUIDE for the identification of compromised users in the system based on the set of control channels that are jammed. We evaluate the estimation error using the GUIDE algorithm in terms of the false alarm and miss rates in the identification problem. We discuss various design trade-offs between robustness to control channel jamming and resource expenditure.

O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O

control channel jamming
node capture attacks

wireless multiple access
security
probabilistic metrics


Reducing the energy consumption caused by flooding messages in mobile ad hoc networks The message flooding method is an important and useful operation for several applications. However, if a network has a large number of mobile nodes and these nodes use the flood operation often, a mobile nodes scarce battery energy will be quickly consumed due to flooding too many messages. In this paper, we propose an approach to reducing the energy consumption caused by flooding messages. The energy saving is achieved by (1) merging several small flood messages into a larger one, and (2) limiting the scope of a flood message. Our simulation results show that, at the cost of an increased message forwarding delay, the proposed approach can substantially reduce flood messages energy consumption without increasing their delivery failure rates.

O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information dissemination
low energy consumption


automatic image analysis process for the detection of concealed weapons The goal of this research is to develop a process, using current imaging hardware and without human intervention, that provides an accurate and timely detection alert of a concealed weapon and its location in the image of the luggage. There are several processes in existence that are able to highlight or otherwise outline a concealed weapon in baggage but so far those processes still require a highly trained operator to observe the resulting image and draw the correct conclusions. We attempted three different approaches in this project. The first approach uses edge detection combined with pattern matching to determine the existence of a concealed pistol. Rather than use the whole body of the weapon which varies significantly, the trigger guard was used since it is fairly consistent in dimensions. While the processes were reliable in detecting a pistol's presence, on any but the simplest of images, the computational time was excessive and a substantial number of false positives were generated. The second approach employed Daubechie wavelet transforms but the results have so far been inconclusive. A third approach involving an algorithm based on the scale invariant feature transform (SIFT) is proposed.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O

edge detection
scale invariant feature transform
pattern matching

weapons detection
invariants
wavelets
daubechies


Reliability modeling in spatially distributed logistics systems This article proposes methods for modeling service reliability in a supply chain. The logistics system in a supply chain typically consists of thousands of retail Stores along with multiple distribution centers (DC). Products are transported between DC & stores through multiple routes. The service reliability depends on DC location layouts, distances from DC to stores, time requirements for product replenishing at stores, DC's capability for supporting store demands, and the connectivity of transportation routes. Contingent events such as labor disputes, bad weather, road conditions, traffic situations, and even terrorist threats can have great impacts on a system's reliability. Given the large number of store locations & multiple combinations of routing schemes, this article applies an approximation technique for developing first-cut reliability analysis models. The approximation relies on multi-level spatial models to characterize patterns of store locations & demands. These models support several types of reliability evaluation of the logistics system under different probability scenarios & contingency situations. Examples with data taken from a large-scale logistics system of an automobile company illustrate the importance of studying supply-chain system reliability.

O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O

contingency
distribution centers
service reliability


the jrpm system for dynamically parallelizing java programs We describe the Java runtime parallelizing machine (Jrpm), a complete system for parallelizing sequential programs automatically. Jrpm is based on a chip multiprocessor (CMP) with thread-level speculation (TLS) support. CMPs have low sharing and communication costs relative to traditional multiprocessors, and thread-level speculation (TLS) simplifies program parallelization by allowing us to parallelize optimistically without violating correct sequential program behavior. Using a Java virtual machine with dynamic compilation support coupled with a hardware profiler, speculative buffer requirements and inter-thread dependencies of prospective speculative thread loops (STLs) are analyzed in real-time to identify the best loops to parallelize. Once sufficient data has been collected to make a reasonable decision, selected loops are dynamically recompiled to run in parallel.Experimental results demonstrate that Jrpm can exploit thread-level parallelism with minimal effort from the programmer. On four processors, we achieved speedups of 3 to 4 for floating point applications, 2 to 3 on multimedia applications, and between 1.5 and 2.5 on integer applications. Performance was achieved by automatic selection of thread decompositions by the hardware profiler, intra-procedural optimizations on code compiled dynamically into speculative threads, and some minor programmer transformations for exposing parallelism that cannot be performed automatically.

O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O B O B O O O O O O O O O O B O O O O O O O O O O O B B O O O B I O B I B O O O B O O O B O O B O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O B O O O B O O O B O O O O O O O O O O O B I B O O O O O B O O O O O O O B B O O O O O O B O O O B O O O O B O O O O O O O O B O O O O O O O O O

communication
requirements
applications
performance
floating point
virtual machine
runtime
minimal
sharing
thread
program
dependencies
exploit
code
behavior
data
demonstrate
support
dynamic compilation
hardware
programmer

speedup
buffers
real-time
thread-level speculation
select
processor
chip multiprocessors
systems
experimentation
optimality
procedure
parallel
speculating
relation
profiles
multimedia application
completeness


evaluating the dynamic properties of recommendation algorithms Collaborative recommendation algorithms are typically evaluated on a static matrix of user rating data. However, when users experience a recommender system, it is dynamic, constantly evolving as new items and new users arrive. The dynamic properties of collaborative recommendation have become important as prediction algorithms based on the interactions of rating histories have been proposed, and as researchers seek to understand problems of robustness and maintenance in rating databases. This paper proposes a new evaluation method for the dynamic aspects of collaborative algorithms, the "temporal leave-one-out" approach, which can provide insight into both user-specific and system-level evolution of recommendation behavior. As a case study, the methodology is applied to the Influence Limiter algorithm [12], showing that its robustness to attack comes at a high accuracy cost.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


data modelling of scientific simulation programs Current research into data modelling of large scientific simulation programs is described. The research includes an empirical study of data management in such programs and an analysis of how scientists actually use their data. The goal of the research is to provide theoretical tools to improve data management for this class of applications. In this paper, data modelling in the scientific environment is described, and some comparisons between data modelling for scientific simulation programs and commercial applications are made.

B O O O B O O B O B O O O O B O O O O B O O O O O B O O O O O O B O O O O B O B O O O O B O O O O B O O B O O O B O B O O B B O O O O O O O O O O O B O O O B O O O B O O

applications research use simulation analysis data paper tools class

data models
empirical studies
program
environments
data management


Effective allocation of customers to distribution centres: A multiple ant colony optimization approach The global and competitive business environment has identified the importance of a quick and efficient service towards the customers in the past few decades. Distribution centre (DC) plays an important role in maintaining the uninterrupted flow of goods and materials between the manufacturer and customers. The performance of the supply chain network can be easily improved by an effective or balanced allocation of customers to DCs. Improper or unbalanced allocation of customers can lead to the under- or overutilization of facilities and can further deteriorate the customer service. Performance of the DC can be judged on the basis of its ability to provide the right goods, at the right time and at the right place. The lead time or transit time to deliver the goods to the customers is an important parameter for the measuring the efficiency and effectiveness of a particular DC in a supply chain. In this paper, a multiple ant colony optimization (MACO) approach is discussed in an effort to design a balanced and efficient supply chain network that maintains the best balance of transit time and customers service. The focus of this paper is on the effective allocation of the customers to the DCs with the two-fold objective of minimization of the transit time and degree of imbalance of the DCs. MACO technique is a modified form of the traditional ant colony system, where multiple ant colonies cooperate with each other to find the best possible customer allocation pattern for the DC. The proposed technique shows better performance because of its nature of considering both positive and negative feedback in search of optimum or near-optimum results. The developed algorithm based on the proposed approach is tested on a real practical problem and the results are discussed in this paper.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ant colony system
distribution centre
balanced allocation
supply chain network


Line accessibility of free form surfaces Given a three dimensional object B?R3 B ? R 3 , the visual hull of B (a concept introduced by Laurentini in 1992) is the smallest set VB?R3 V B ? R 3 containing B with the following property: for each point p on the boundary of VB V B there exists a direction from which p is on a silhouette of VB V B . The notion of the visual hull has applications in computer graphics (visibility and silhouette based algorithms), manufacturing (accessibility, wire EDM and hot wire cutting), and more. We present a tractable algorithm for computing a decomposition of a C1 C 1 smooth, closed parametric surface S?R3 S ? R 3 , positioned in an arrangement with other occluding surfaces, into those regions that belong to the visual hull and those that do not (later referred to as the line-accessible or line-inaccessible regions). For efficiency, our method introduces two early domain pruning criteria, using a recursive subdivision of the parameter domain, along with a tangent plane bounding cone: one criterion detects regions that are guaranteed to belong to the visual hull, while the other detects regions that cannot belong to it (both use sufficient and not necessary conditions). Only to those sub-domains that remain after this significant domain reduction, an algebraic (subdivision based) solver is applied, to solve two sets of algebraic equations, already presented by Laurentini in 1999, gaining one to two orders of magnitude improvement in the computation times. We provide a derivation of these equations via a different approach, compared to Laurentini in 1999, using the model we refer to as the dynamic SSI solution of the surface and the moving tangent plane. Concrete computational examples are provided as well.

O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

subdivision solvers
algebraic constraints solving


Online social networks and offline protest Large-scale protests occur frequently and sometimes overthrow entire political systems. Meanwhile, online social networks have become an increasingly common component of peoples lives. We present a large-scale longitudinal study that connects online social media behaviors to offline protest. Using almost 14 million geolocated tweets and data on protests from 16 countries during the Arab Spring, we show that increased coordination of messages on Twitter using specific hashtags is associated with increased protests the following day. The results also show that traditional actors like the media and elites are not driving the results. These results indicate social media activity correlates with subsequent large-scale decentralized coordination of protests, with important implications for the future balance of power between citizens and their states.

O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B O O O O O B I O O O O O O O O B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B O O O O O O O O O O O O O O

social media
twitter
protests
arab spring


Style synthesis and analysis of car designs for style quantification based on product appearance similarities Understanding how similar design appears is a key element to understanding companies design strategies. However, it is difficult to evaluate companies design strategies with conventional style measurement methods since they only taxonomically measure whether a specific characteristic is included in a specific style. This study numerically measured car design similarities to synthesize and analyze car brand styles, thereupon discovering the design trends among car brands for strategic design positioning. This paper aims to find methods for quantifying style differences and identifying unique design elements of car designs among 23 automobile manufacturers based on design similarities of a large quantity of car designs (N=119). To achieve this goal, a hybrid style quantification methodology a mixture of Fourier decomposition, eye tracker, and shape grammar was created to evaluate similarities, visual significance, and combinations of 19 car design elements. Fourier decomposition was incorporated to find the quantifiable values of design similarities of car design elements. Visual significance analysis was also conducted for each car design element through eye tracker to measure the importance of certain design elements for weighting factors. Then, each combination of design elements was compared with car design elements of other cars for similarity calculations. Finally, car design alternatives were synthesized, and transitions of design positioning were analyzed based on the similarity values weighed by the visual significance results. Using the suggested methods, alternate designs can be synthesized while preserving brands design styles, and design trends can be analyzed for strategic evaluation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

style analysis
design management
design strategy
brand association


Lattice-BGK methods for simulating incompressible fluid flows The lattice-Bhatnagar-Gross-Krook (BGK) method has been used to simulate fluid how in the nearly incompressible limit. But for the completely incompressible Bows, two special approaches should be applied to the general model, for the steady and unsteady cases, respectively. Introduced by Zou et al.,(1) the method for steady incompressible Bows will be described briefly in this paper. For the unsteady case, we will show, using a simple numerical example, the need to solve a Poisson equation for pressure.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O

lattice-bgk method
unsteady incompressible flow
one-dimensional flow


Noise Limits on Reconstructing Diffraction Signals From Random Tomographs An information theoretic criterion for the feasibility of reconstructing diffraction signals from noisy tomographs, when the positions of the tomographs within the signal are unknown, is derived. For shot-noise limited data, the number of detected photons per tomograph for successful reconstruction is much smaller than previously believed necessary, growing only logarithmically with the number of contrast elements of the diffracting object. Reconstruction up to the theoretic criterion is demonstrated on simulated data with an algorithm that combines the expectation-maximization (EM) principle with constraints arising from the band-limited nature of the signal.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

band-limited signal
expectation maximization (em)
mutual information
shot noise
tomography


Workflows for generating tetrahedral meshes for finite element simulations on complex geological structures We developed, tested and validated three workflows to generate a good tetrahedral mesh from a geological basis model. We used a simulation of a transient electromagnetic measurement as a testcase. We can show that the suggested worklfows lead to a tessellation on which the simulation can be run robustly.

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

unstructured tetrahedral mesh
geomodeler
electromagnetics


DocCloud: A document recommender system on cloud computing with plausible deniability Recommender systems select the most interesting products for costumers based on their interests. The move of a recommender system to a cloud faces many challenges from the perspective of the protection of the participants. Little work has been done regarding secure recommender systems or how to cope with the legal liability of the cloud provider and any virtual machine inside the cloud. We propose DocCloud, a recommender system that focused on the protection of all participants against legal attacks. We present the architecture of DocCloud and analyze the security mechanisms that the system includes. Specifically, we study the properties of plausible deniability and anonymity of the recommenders and intermediate nodes. This way, nodes can recommend products to the customers while deny any knowledge about the product they are recommending or their participation in the recommendation process.

B O O B I O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B I O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

recommender system
doccloud
plausible deniability


A new robust capacitively coupled second harmonic quadrature LC oscillator A study of some reported superharmonic LC quadrature voltage-controlled oscillator (LC-QVCO) is performed in which it is shown that robustness of the quadrature oscillation varies depending on the coupling configuration. Next, a new superharmonic LC-QVCO is proposed in which the common source node in either of two identical cross-connected LC-VCOs is coupled via a capacitor to the node common between the two varactors in the LC-tank of the other LC-VCO. As a result of connecting common mode nodes, the currents flowing through the two coupling capacitors are comprised of only the even harmonics. In the proposed coupling configuration there exists a closed loop through which the second harmonic signals circulate. A qualitative argument is presented to justify the robustness of the quadrature nature of the proposed QVCO by applying the Barkhausen phase criterion to the second harmonic signals in the loop. Since the coupling devices are only two capacitors, no extra noise sources and power consumption are added to the core VCOs. A Monte-Carlo simulation showed that the phase error of the proposed QVCO caused by device mismatches is no more than 1 degrees. Also, generalizing this method to several numbers of VCOs in a loop, multiphase signals can be generated. The proposed circuits were designed using a 0.18-mu m RF CMOS technology and simulation results are presented.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O

lc quadrature voltage-controlled oscillators


An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness In this communication, we strive to apply a novel simulated annealing to consider scheduling hybrid flowshop problems to minimize both total completion time and total tardiness. To narrow the gap between the theory and the practice of the hybrid flowshop scheduling, we integrate two realistic and practical assumptions which are sequence-dependent setup and transportation times into our problem. We apply a metaheuristic based on simulated annealing (SA) which strikes a compromise between intensification and diversification mechanisms to augment the competitive performance of our proposed SA. A comprehensive calibration of different parameters and operators are done. We employ Taguchi method to select the optimum parameters with the least possible number of experiments. For the purpose of performance evaluation of our proposed algorithm, we generate a benchmark against which the adaptations of high performing algorithms in the literature are brought into comparison. Moreover, we investigate the impacts of increase of number of jobs on the performance of our algorithm. The efficiency and effectiveness of our hybrid simulated annealing are inferred from all the computational results obtained in various situations.

O O O O O O O O O O O O O O O B I I O B I O O O O O O O O O O O O O B B I O O O O B I I O B I O O O O O O O O O O O O B I B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O

scheduling
hybrid flowshop
total tardiness
total completion time
hybrid simulated annealing

transportation time
sequence-dependent setup times
local search


Adaptive clipping level control for OFDM peak power reduction using clipping and filtering In this paper, we focus on an OFDM peak power reduction method that uses clipping and filtering. This method can reduce the peak power of OFDM via clipping, and can also reduce the out-band emission via filtering, even if a nonlinear amplifier is used. However, the filtering causes peak power regeneration. For purposes of reducing the effect of peak power regeneration; we propose an adaptive clipping level control method for OFDM peak power reduction, as part of a technique using clipping and filtering. In this method, the clipping level is optimized by checking the peak power regrowth which is caused by inserting a filter, by using a multi-stage filtering simulator. Thus the peak power is adjusted to the target PAPR. If the target PAPR. is decided to be the saturation power of an amplifier, the bit error rate performance is improved without increasing the out-band emission. In order to confirm the effectiveness of the proposed system, we evaluate its performance by using computer simulation.

B I I I O B O O O O B I I O O O O O O O B O O O O O O B I I O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O B O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ofdm
clipping and filtering
adaptive clipping level control


Line ordering of reversible circuits for linear nearest neighbor realization Real quantum computing technologies have different restrictions and constraints which need to be considered during circuit synthesis. In certain technologies, only physically adjacent qubits can interact, which restricts their realizations to only linear nearest neighbor (LNN) architecture. In this work, we formulate the line ordering problem in LNN architecture as task assignment problem to find a mapping (permutation) between task graph and processor graph with minimum cost. We propose two different approaches, a greedy heuristic and a meta-heuristic algorithm based on Harmony Search to solve the task assignment problem. Experimental results show that our algorithms were able to reduce the quantum cost of benchmark circuits by approximately 30% on average. Moreover, the proposed algorithms were compared to one recently proposed ordering algorithm and were found to further improve the cost by approximately 16%.

B I O B I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

reversible circuits
linear nearest neighbor
greedy
harmony search
line ordering


Assessing design creativity Creativity is crucial for designing products and enabling innovation. Assessing creativity can help identify innovative designers and products, and support improvement of both. The literature variously defines creativity as a function of degree of novelty, usefulness, or both. Most methods for assessing creativity, however, focus only on assessing novelty of products. This research proposes a new method for assessing the creativity of products as a function of their novelty and usefulness. We develop individual methods for assessing novelty and usefulness of products, and then combine these into a method for assessing creativity of products. The proposed methods have been evaluated by benchmarking them, and other methods available from literature, against the collective, intuitive assessment of product creativity of experienced designers.

O O B B O O O O O O O O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O


Aggregated ratio analysis in DEA This paper proposes an aggregated ratio analysis model which can be utilized to evaluate relative efficiency of decision making units (DMUs). We show that our proposed ratio model is equivalent to the CCR DEA model. This equivalence property offers a great deal of opportunities for DEA to be interpreted and applied in different ways. Our model also offers an insight into the frontier analysis. Whether a DMU is on the frontier or efficient frontier can be informed by using our aggregated ratio analysis. Several results developed in the paper are coincident with that in the literature.

O O O O O O O O O B I I I O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O

aggregated ratio analysis model
efficiency
frontier


STATIC STRATEGIC GAME APPROACH FOR MULTIPLE ATTRIBUTE DECISION MAKING PROBLEMS WITHOUT WEIGHT INFORMATION In multiple attribute decision making (MADM) problems, it is usual that no single alternative works best for all performance attributes, so it is difficult to select the best from among multiple available alternatives, especially in the situation that the attribute weights are completely unknown. This research propose a game theory-based approach (GMADM) which incorporates static strategic game theory into MADM problems to derive the attribute weights, and then utilize the weight arithmetic average (WAA) operator to aggregate the attribute values corresponding to each alternative and rank alternatives by means of aggregated information. In GMADM, each attribute is regarded as a player taking part in the game, and the player's strategy is to select a value from interval [0, 1] to assign corresponding attribute weight, and the player's utility is defined as the agreement between the ranking of alternatives determined by the aggregated information and the one determined by the attribute values. When the game is in equilibrium status, the strategy profile is the best attribute weights which make each player have good utilities. Moreover, the equilibrium solution of game and the resolution method for the MADM problem without weight information have also been developed. Finally, the result of proposed approach for a practical MADM problem and its comparisons with one of other methods are given.

O O O O O B I I I O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multiple attribute decision making
game theory


identifying program, test, and environmental changes that affect behaviour Developers evolve a software system by changing the program source code, by modifying its context by updating libraries or changing its configuration, and by improving its test suite. Any of these changes can cause differences in program behaviour. In general, program paths may appear or disappear between executions of two subsequent versions of a system. Some of these behavioural differences are expected by a developer; for example, executing new program paths is often precisely what is intended when adding a new test. Other behavioural differences may or may not be expected or benign. For example, changing an XML configuration file may cause a previously-executed path to disappear, which may or may not be expected and could be problematic. Furthermore, the degree to which a behavioural change might be problematic may only become apparent over time as the new behaviour interacts with other changes. We present an approach to identify specific program call dependencies where the programmer's changes to the program source code, its tests, or its environment are not apparent in the system's behaviour, or vice versa. Using a static and a dynamic call graph from each of two program versions, we partition dependencies based on their presence in each of the four graphs. Particular partitions contain dependencies that help a programmer develop insights about often subtle behavioural changes.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

static analysis
dynamic impact analysis
software behaviour
comparative analyses


a generalized channel router A generalized channel router operates on horizontal and vertical channels generated from an irregular cell structure, and is free of a routing grid. Such a router can solve virtually any routing problem. It has two major phases: the global routing phase and the channel routing phase. This paper describes both phases as they have been implemented at TI. It concludes with a demonstration of the versatility of the router (it is used to solve the Hampton Court Maze) and with applications of the router in TI's I2L (Integrated Injector Logic) / STL (Schottky Transistor Logic) Automatic Layout System.

O O O B O O O B O O O O O O O O O O O B O O O O O B B O O B O O O O B O O O O O O O O B O O O O B O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O B O O O O O B O O O O B O B O

applications structure grid layout router routing logic paper

systems
demonstrate
general
global routing
integrability


a system-level methodology for fully compensating process variability impact of memory organizations in periodic applications Process variability is an emerging problem that is becoming worse with each new technology node. Its impact on the performance and energy of memory organizations is severe and degrades the system-level parametric yield. In this paper we propose a broadly applicable system-level technique that can guarantee parametric yield on the memory organization and which minimizes the energy overhead associated to variability in the conventional design process. It is based on offering configuration capabilities at the memory-level and exploiting them at the system-level. This technique can decrease by up to a factor of 5 the energy overhead that is introduced by state-of-the-art process variability compensation techniques, including statistical timing analysis. In this way we obtain results close to the ideal nominal design again.

O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O


a bucket architecture for the open video project The Open Video project is a collection of public domain digital video available for research and other purposes. The Open Video collection currently consists of approximately 350 video segments, ranging in duration from 10 seconds to 1 hour. Rapid growth for the collection is planned through agreements with other video repository projects and provision for user contribution of video. To handle the increased accession, we are experimenting with buckets, aggregative intelligent publishing constructs for use in digital libraries.

O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O


Joint pricing and inventory control with a Markovian demand model We consider the joint pricing and inventory control problem for a single product over a finite horizon and with periodic review. The demand distribution in each period is determined by an exogenous Markov chain. Pricing and ordering decisions are made at the beginning of each period and all shortages are backlogged. The surplus costs as well as fixed and variable costs are state dependent. We show the existence of an optimal (s,S,p)-type feedback policy for the additive demand model. We extend the model to the case of emergency orders. We compute the optimal policy for a class of Markovian demand and illustrate the benefits of dynamic pricing over fixed pricing through numerical examples. The results indicate that it is more beneficial to implement dynamic pricing in a Markovian demand environment with a high fixed ordering cost or with high demand variability.

B I I I I O O B I O O O O B I I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O

joint pricing and inventory control
markovian demand


Cost-effective triple-mode reconfigurable pipeline FFT/IFFT/2-D DCT processor This investigation proposes a novel radix-4(2) algorithm with the low computational complexity of a radix-16 algorithm but the lower hardware requirement of a radix-4 algorithm. The proposed pipeline radix-4(2) single delay feedback path (R4(2)SDF) architecture adopts a multiplierless radix-4 butterfly structure, based on the specific linear mapping of common factor algorithm (CFA), to support both 256-point fast Fourier transform/inverse fast Fourier transform (FFT/IFFT) and 8 x 8 2-D discrete cosine transform (DCT) modes following with the high efficient feedback shift registers architecture. The segment shift register (SSR) and overturn shift register (OSR) structure are adopted to minimize the register cost for the input re-ordering and post computation operations in the 8 x 8 2-D DCT mode, respectively. Moreover, the retrenched constant multiplier and eight-folded complex multiplier structures are adopted to decrease the multiplier cost and the coefficient ROM size with the complex conjugate symmetry rule and subexpression elimination technology. To further decrease the chip cost, a finite wordlength analysis is provided to indicate that the proposed architecture only requires a 13-bit internal wordlength to achieve 40-dB signal-to-noise ratio (SNR) performance in 256-point FFT/IFFT modes and high digital video (DV) compression quality in 8 x 8 2-D DCT mode. The comprehensive comparison results indicate that the proposed cost effective reconfigurable design has the smallest hardware requirement and largest hardware utilization among the tested architectures for the FFT/IFFT computation, and thus has the highest cost efficiency. The derivation and chip implementation results show that the proposed pipeline 256-point FFT/IFFT/2-D DCT triple-mode chip consumes 22.37 mW at 100 MHz at 1.2-V supply voltage in TSMC 0.13-mu m CMOS process, which is very appropriate for the RSoCs IP of next-generation handheld devices.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computation complexity
next-generation wireless communications
pipeline architecture
r4(2)sdf
triple modes


Controllable local monotonic cubic interpolation in fluid animations While linear interpolation has been used frequently in computer graphics, higher-order interpolation is often desirable in applications requiring higher-order accuracy. In this paper, we study how interpolation filters, employed to resample such data as velocity, density, and temperature in simulating the equations of fluid dynamics, affect the animation of fluids. For this purpose, we have designed a controllable local cubic interpolation scheme that offers G(1) (or C-1) continuity globally. It is based on monotonic splines so does not suffer from undue overshooting. Furthermore, it is possible to control the general behavior of the interpolation through a global tension parameter, providing a continuous spectrum of linear to cubic interpolation. We analyze how this controllable interpolation filter may be effectively used to enhance the visual reality for physically based fluid animation. Copyright (c) 2005 John Wiley & Sons, Ltd.

O O O O B O O O O O B O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O B I O O O O O O O O

cubic polynomial
monotonicity
controllability


Conditional diagnosability of alternating group networks The growing size of a multiprocessor system increases its vulnerability to component failures. In order to maintain the system's high reliability, it is crucial to identify and replace the faulty processors through testing, a process known as fault diagnosis. The minimum size of a largest connected component in such a networked system is typically used as a measure for fault tolerance of the system. For this measure, the conditional diagnosability of the system in terms of an alternating group network is important, which is studied in the present paper under a comparison model, with some precise and useful bounds of tolerance derived. (C) 2010 Published by Elsevier B.V.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O

conditional diagnosability
alternating group network


Forwarding Devices: From Measurements to Simulations Most popular simulation and emulation tools use high-level models of forwarding behavior in switches and routers, and give little guidance on setting model parameters such as buffer sizes. Thus, a myriad of papers report results that are highly sensitive to the forwarding model or buffer size used. Incorrect conclusions are often drawn from these results about transport or application protocol performance, service provisioning, or vulnerability to attacks. In this article, we argue that measurement-based models for routers and other forwarding devices are necessary. We devise such a model and validate it with measurements from three types of Cisco routers and one Juniper router, under varying traffic conditions. The structure of our model is device-independent, but the model uses device specific parameters. The compactness of the parameters and simplicity of the model make it versatile for high-fidelity simulations that preserve simulation scalability. We construct a profiler to infer the parameters within a few hours. Our results indicate that our model approximates different types of routers significantly better than the default ns-2 simulator models. The results also indicate that queue characteristics vary dramatically among the devices we measure, and that backplane contention can be a factor.

O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Managing schema evolution in a container-based persistent system Managing schema evolution is a problem every persistent system has to cope with to be useful in practice. Schema evolution consists basically of supporting class modification and dealing with data objects created and stored under the old class definitions. Several proposals have been made to handle this problem in systems that follow a full orthogonally, persistent approach, but, until now, there has not been any proposal to support it in container-based persistent systems. In this paper we describe a schema evolution management system designed for Barbados. Barbados is a complete programming environment which is based on an architecture of containers to provide persistent storage. Barbados does not provide full orthogonal persistence, but, as will be described in this paper, its architecture has several other advantages. Among them is the fact that this model is especially suitable for solving the schema evolution problem. Copyright (C) 2002 John Wiley Sons, Ltd.

O B I O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O

object-oriented operating system
c plus
swizzling


Fuzzy logic to improve the robustness of decision support systems under uncertainty Companies deal with;many decision-making processes whose impact on the global performance can be very strong. As a consequence, the role of Decision Support Systems (DSSs) within the organization is critical. The ability of managing uncertainty turns to be a crucial issue for a DSS. In particular, the design of a DSS, that requires the formalization of the expert's preferences is usually affected by uncertainty. In this case, evaluating the system's robustness is an effective way to evaluate its ability in managing uncertainty. In this paper fuzzy logic is proposed as a technique to design a robust DSS. A quantitative method and an experiment to compare the robustness of a DSS based on fuzzy logic and the one of a weighting method are proposed. (C) 1999 Elsevier Science Ltd. All rights reserved.

B I O O O B O B I I O B O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O O O B O O O B I O O O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O B I O O O O O O O O O O

decision support systems
fuzzy logic
uncertainty
robustness
weighting method


Acceleration of acoustic emission signal processing algorithms using CUDA standard Offline processing of acoustic emission (AE) signal waveforms recorded during a long-term AE monitoring session is a challenging problem in AE testing area. This is due to the fact that today's AE systems can work with up to hundreds of channels and are able to process tens of thousands of AE events per second. The amount of data recorded during the session is very high. This paper proposes a way to accelerate signal processing methods for acoustic emission and to accelerate similarity calculation using the Graphic Processing Unit (GPU). GPU-based accelerators are an affordable High Performance Computing (HPC) solution which can be used in any industrial workstation or laptop. They are therefore suitable for onsite AE monitoring. Our implementation, which is based on Compute Unified Device Architecture (CUDA), proves that GPU is able to achieve 30 times faster processing speed than CPU for AE signal preprocessing. The similarity calculation is accelerated by up to 80 times. These results prove that GPU processing is a powerful and low-cost accelerator for AE signal processing algorithms.

O O B I O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O


Stochastic scheduling to minimize expected maximum lateness ? This paper is concerned with the problems in scheduling a set of jobs associated with random due dates on a single machine so as to minimize the expected maximum lateness in stochastic environment. This is a difficult problem and few efforts have been reported on its solution in the literature. In this paper, we first derive a deterministic equivalent to the expected maximum lateness and then propose a dynamic programming algorithm to obtain the optimal solutions. The procedures to compute optimal solutions are initially developed in the case of deterministic processing times, and then extended to stochastic processing times following arbitrary probability distributions. Moreover, several heuristic rules are suggested to compute near-optimal solutions, which are shown to be highly efficient and accurate by computer-based experiments.

B I O O B I I O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

stochastic scheduling
due dates
expected maximum lateness


Investigating the performance of a wrist stabilization device for image-guided percutaneous scaphoid fixation Conventional navigated surgery relies on placement of a reference marker on the anatomy of interest. However, placement of such a marker is not readily feasible in small anatomic regions such as the scaphoid bone of the wrist. This study aimed to develop an alternative mechanism for patient tracking that could be used to perform navigated percutaneous scaphoid fixation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O

image-guided surgery
navigation
percutaneous fixation
scaphoid fracture
wrist fracture


Positivity-preserving high order discontinuous Galerkin schemes for compressible Euler equations with source terms In [16,17], we constructed uniformly high order accurate discontinuous Galerkin (DG) schemes which preserve positivity of density and pressure for the Euler equations of compressible gas dynamics with the ideal gas equation of state. The technique also applies to high order accurate finite volume schemes. For the Euler equations with various source terms (e.g., gravity and chemical reactions), it is more difficult to design high order schemes which do not produce negative density or pressure. In this paper, we first show that our framework to construct positivity-preserving high order schemes in [16,17] can also be applied to Euler equations with a general equation of state. Then we discuss an extension to Euler equations with source terms. Numerical tests of the third order Runge-Kutta DG (RKDG) method for Euler equations with different types of source terms are reported. (C) 2010 Elsevier Inc. All rights reserved.

O O O O O O O B I I I I I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

compressible euler equations with source terms

weighted essentially non-oscillatory scheme


a functional correspondence between evaluators and abstract machines We bridge the gap between functional evaluators and abstract machines for the ?-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization.We illustrate this approach by deriving Krivine's abstract machine from an ordinary call-by-name evaluator and by deriving an ordinary call-by-value evaluator from Felleisen et al.'s CEK machine. The first derivation is strikingly simpler than what can be found in the literature. The second one is new. Together, they show that Krivine's abstract machine and the CEK machine correspond to the call-by-name and call-by-value facets of an ordinary evaluator for the ?-calculus.We then reveal the denotational content of Hannan and Miller's CLS machine and of Landin's SECD machine. We formally compare the corresponding evaluators and we illustrate some degrees of freedom in the design spaces of evaluators and of abstract machines for the ?-calculus with computational effects.Finally, we consider the Categorical Abstract Machine and the extent to which it is more of a virtual machine than an abstract machine.

O O O O O O B I O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Independent Directed Acyclic Graphs for Resilient Multipath Routing In order to achieve resilient multipath routing, we introduce the concept of independent directed acyclic graphs (IDAGs) in this paper. Link-independent (node-independent) DAGs satisfy the property that any path from a source to the root on one DAG is link-disjoint (node-disjoint) with any path from the source to the root on the other DAG. Given a network, we develop polynomial-time algorithms to compute link-independent and node-independent DAGs. The algorithm developed in this paper: 1) provides multipath routing; 2) utilizes all possible edges; 3) guarantees recovery from single link failure; and 4) achieves all these with at most one bit per packet as overhead when routing is based on destination address and incoming edge. We show the effectiveness of the proposed IDAGs approach by comparing key performance indices to that of the independent trees and multiple pairs of independent trees techniques through extensive simulations.

O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O

directed acyclic graphs (dags)
failure recovery
ip fast rerouting
network protection


the effect of malicious peers in a gossip-based reputation system Users trust management is one of the most important issues in the Internet. In fact, due to the distributed nature of many services it is not simple to assign an objective trust value to a user, especially in the presence of groups of malicious peers. In this paper we analyze the effect of group empowering on a gossip-based reputation system named GossipTrust. In particular, we show the GossipTrust immunity to a single growing group of malicious users and to a growing number of pairs of malicious users.

O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Identification of Fasting-induced Genes in the Rat Hypothalamus During food shortage, organisms activate defense mechanisms to maximize their chance of survival. At least in part, these responses are triggered by changes in hormonal status and neural status during starvation. The hypothalamus is organized as a collection of distinct autonomously active nuclei and is considered to play crucial roles in these survival responses. To isolate factors involved in these pathways, we carried out suppression subtractive hybridization analyses using complementary DNAs (cDNA) from the hypothalami of fasted and fed rats. We identified four genes, namely ubiquitin-conjugating enzyme E2D 3 (UBE2D3), cAMP-dependent protein kinase C beta subunit (PKC?), excitatory amino acid carrier 1 (EAAC1), and ferritin heavy polypeptide 1 (Fth1), that were upregulated after a 48-h fast compared to the fed status. According to previous reports, these genes have been implicated in protection against neuronal cell death under various neurodegenerative stresses, such as hypoxiaischemia and oxidative stress. Thus, the increased expressions of the genes identified in the present study may have protective effects against neural damage that could otherwise result in cell death

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O

suppression subtractive hybridization
oxidative stress


statistical physics approaches for network-on-chip traffic characterization In order to face the growing complexity of embedded applications, we aim to build highly efficient Network-on-Chip (NoC) architectures which can connect in a scalable manner various computational modules of the platform. For such networked platforms, it is increasingly important to accurately model the traffic characteristics as this is intimately related to our ability to determine the optimal buffer size at various routers in the network and thus provide analytical metrics for various power-performance trade-offs. In this paper, we show that the main limitations of queueing theory and Markov chain approaches to solving the buffer sizing problem can be overcome by adopting a statistical physics approach to probability density characterization which incorporates the power law distribution, correlations, and scaling properties exhibited within an NoC architecture due to various network transactions. As experimental results show, this new approach represents a breakthrough in accurate traffic modeling under non-equilibrium conditions. As such, our results can be directly used to solve the buffer sizing problem for multiprocessor systems where communication happens via the NoC approach.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

networks-on-chip
fractional calculus
master equation
multi-processor systems
systems-on-chip


removal of misbehaving insiders in anonymous vanets Vehicular Ad hoc NETworks (VANETs), which provide vehicles with an easy access to exchange the up-to-date traffic status and various kinds of data, have become a promising application of mobile ad-hoc networks. In the life-critical VANETs, security issues are considered as a focal topic. One challenging problem among these issues is the insider misbehavior since it bypasses the traditional security mechanisms such as authentication. The existing works focusing on this problem do not take the privacy issue into account. Their presented solutions are paralyzed in the anonymous VANETs, where the drivers' real identity is protected. In this paper, we propose SLEP and PRP, two novel protocols to efficiently remove the misbehaving insiders from the anonymous VANETs. Through analysis and extensive simulations, we demonstrate that these two protocols can achieve high reaction speed and accuracy for both the local eviction and the permanent revocation to the misbehaving vehicles, at an acceptable cost.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O


perfect latin squares and parallel array access A new nonlinear skewing scheme is proposed for parallel array access. We introduce a new Latin square(perfect Latin square) which has several properties useful for parallel array access. A sufficient condition for the existence of perfect Latin squares and a simple construction method for perfect Latin squares are presented. The resulting skewing scheme provides conflict free access to various subsets of an N x N array using N memory modules. When the number of memory modules is an even power of two, address generation is performed in constant time using a simple circuit. This scheme is the first memory scheme that achieves constant time access to rows, columns, diagonals, and N 1/2 x N 1/2 subarrays of an N x N array using the minimum number of memory modules.

O O O O B O B O O O O B O O O B O B O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O B O O O O O O O O O B O B O B O O O O O O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O B O O O O B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O

power generation method access conflict parallel scheme

module arrays addressing memorialized timing circuits


Gait recognition using Pose Kinematics and Pose Energy Image Many of the existing gait recognition approaches represent a gait cycle using a single 2D image called Gait Energy Image (GEI) or its variants. Since these methods suffer from lack of dynamic information, we model a gait cycle using a chain of key poses and extract a novel feature called Pose Energy Image (PEI). PEI is the average image of all the silhouettes in a key pose state of a gait cycle. By increasing the resolution of gait representation, more detailed dynamic information can be captured. However, processing speed and space requirement are higher for PEI than the conventional GEI methods. To overcome this shortcoming, another novel feature named as Pose Kinematics is introduced, which represents the percentage of time spent in each key pose state over a gait cycle. Although the Pose Kinematics based method is fast, its accuracy is not very high. A hierarchical method for combining these two features is, therefore, proposed. At first, Pose Kinematics is applied to select a set of most probable classes. Then, PEI is used on these selected classes to get the final classification. Experimental results on CMU's Mobo and USF's HumanID data set show that the proposed approach outperforms existing approaches.

B I O B I O B I I O O O O B I O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

gait recognition
pose kinematics
pose energy image
gait energy image


Cell modeling with reusable agent-based formalisms Biologists are building increasingly complex models and simulations of cells and other biological entities, and are looking at alternatives to traditional representations. Making use of the object-oriented (OO) paradigm, the Unified Modeling Language (UML) and Real-time Object-Oriented Modeling (ROOM) visual formalisms, and the Rational Rose RealTime (RRT) visual modeling tool, we summarize a previously-described multi-step process for constructing top-down models of cells. We first construct a simple model of a cell using an architecture in which all objects are containers, agents, or passive objects. We then reuse these architectural principles and components to extend our simple cell model into a more complex cell, the goal being to demonstrate that encapsulation familiar to artificial intelligence researchers can be employed by systems biologists in their models. A red blood cell is embedded in a straight-forward manner within a larger system, which is in turn iteratively embedded within still larger systems, including a blood vessel, a circulatory system, a human being, and a simple ecology. Each complexity increment reuses the same architectural principles, including the use of agents, each of which continuously either moves passive small molecules between containers, or transforms these passive objects from one type into another. We show how it is possible to start with a direct diagrammatic representation of a biological structure such as a cell, using terminology familiar to biologists, and by following a process of gradually adding more and more detail, arrive at a system with structure and behavior of arbitrary complexity that can run and be observed on a computer.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

agent-based modeling
cell simulation
architectural reuse


Information technology maturity stages and enterprise benchmarking: an empirical study Purpose - Recently, many enterprises are using a variety of methods and techniques to examine and improve their current maturity level of information technology (IT). Although IT evaluation studies based on IT maturity stages have been conducted widely, the stages theory has not been confirmed through statistical testing. IT evaluation activities can present managerial implications to an enterprise by determining where it stands within the stages theory. The purpose of this paper is to test empirically and repeatedly the once-defined maturity model in order to make its validity more powerful. Design/methodology/approach - To define IT maturity stages and benchmarks with statistical testing, evaluation fields and factors of the L&K Model are referred to. Data were gathered by a questionnaire survey and interviews, in which 312 enterprises in South Korea participated. Consequently, IT maturity stages are defined and significant benchmarks of each stage are validated through ANOVA and post hoc comparison methods. Findings - The results of the study indicate the meanings and benchmarks of newly defined five stages of IT maturity: initiation, recognition, diffusion, control, and integration. Practical implications - The aim of this study is not only to apply an advanced methodology to study empirically how IT maturity level of an enterprise is improved, but also to suggest practical guidelines for actions to improve it. Originality/value - The five stages model is totally enhanced and reformulated from the previous stages theories. First, well-combined and comprehensive evaluation factors are used to critically appraise the evolutionistic characteristic of IT in enterprises. Second, the definition and benchmarks of the five stages model are confirmed through statistical testing with sufficient sample size (n = 312).

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O


Some robustness issues for comparing multiple logistic regression slopes to a control for small samples For comparing several logistic regression slopes to that of a control for small sample sizes, Dasgupta et al. (2001) proposed an "asymptotic" small-sample test and a "pivoted" version of that test statistic. Their results show both methods perform well in terms of Type I error control and marginal power when the response is related to the explanatory variable via a logistic regression model. This study finds, via Monte Carlo simulations, that when the underlying relationship is probit, complementary log-log, linear, or even non-monotonic, the "asymptotic" and the "pivoted" small-sample methods perform fairly well in terms of Type I error control and marginal power. Unlike their large sample competitors, they are generally robust to departures from the logistic regression model.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O

non-existence of maximum likelihood estimators


An implicit multigrid method for turbulent combustion An implicit multigrid scheme for solving the Navier-Stokes, turbulence, species, and variance transport equations describing turbulent combustion is presented. Turbulence chemistry interaction is included by use of presumed probability density functions (pdf). To avoid stiffness problems associated with chemically reacting flows, time integration is performed by an implicit LU-SGS algorithm. This requires the formation of a source term Jacobian. The complete, analytically derived Jacobian, including assumed pdf modeling, is given in the present paper. Thus, the high numerical stability of the original algorithm is maintained. Convergence acceleration is accomplished by a nonlinear multigrid method. Strongly nonlinear source terms in species, turbulence, and variance conservation equations usually keep multigrid methods from converging. It is shown that freezing of coarse grid source terms including spatial derivatives and restriction damping in regions of high chemical activity may remedy this problem. Two finite-rate chemistry test cases with methane and hydrogen combustion at supersonic speed demonstrate a strong reduction in required CPU time. (C) 2001 Academic Press.

O O B O O O B O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O

supersonic flows
probability density function


Probabilistic polynomial dynamical systems for reverse engineering of gene regulatory networks Elucidating the structure and/or dynamics of gene regulatory networks from experimental data is a major goal of systems biology. Stochastic models have the potential to absorb noise, account for un-certainty, and help avoid data overfitting. Within the frame work of probabilistic polynomial dynamical systems, we present an algorithm for the reverse engineering of any gene regulatory network as a discrete, probabilistic polynomial dynamical system. The resulting stochastic model is assembled from all minimal models in the model space and the probability assignment is based on partitioning the model space according to the likeliness with which a minimal model explains the observed data. We used this method to identify stochastic models for two published synthetic network models. In both cases, the generated model retains the key features of the original model and compares favorably to the resulting models from other algorithms.

O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

polynomial dynamical systems
reverse engineering


query execution techniques for caching expensive methods Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods are run on data with duplicate values, time is wasted redundantly computing methods on the same value. This problem has been studied in the context of programming languages, where "memoization" is the standard solution. In the database literature, sorting has been proposed to deal with this problem. We compare these approaches along with a third solution, a variant of unary hybrid hashing which we call Hybrid Cache. We demonstrate that Hybrid Cache always dominates memoization, and significantly outperforms sorting in many instances. This provides new insights into the tradeoff between hashing and sorting for unary operations. Additionally, our Hybrid Cache algorithm includes some new optimization for unary hybrid hashing, which can be used for other applications such as grouping and duplicate elimination. We conclude with a discussion of techniques for caching multiple expensive methods in a single query, and raise some new optimization problems in choosing caching techniques.

B O O O O O O O O O O O B O O O O O O O B O B O O O O O O O B O O B O O O O O O O O O B O O O O O O O B O O O O B O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O B B O O O B B O B O B B O O B O O O B O O O O O O O O O O O B O B O O O O O B B B O O O O O O B B O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O

value sorting applications hashing context cache values users memoization data queries demonstrate algorithm database hybrid query

computation
object
standardization
timing
group
object-oriented
method
optimality
operability
relation
caches
programming language


Side-channel attacks on HIGHT with reduced masked rounds suitable for the protection of multimedia computing system At CHES 2007, Biryukov and Knovratovich introduced a concept of side-channel attacks based on impossible collisions, and applied it to AES with reduced masked rounds. In this paper, we propose side-channel attacks on HIGHT (HIGh security and light weigHT) with the first 11, 12, 13 reduced masked rounds using impossible collision. Our best attacks on HIGHT with the first 11, 12 and 13 reduced masked rounds need 217, 232 and 240 chosen plaintexts and 223.6, 256.6 and 280.6 curve comparisons, respectively. They are the first known side-channel attacks on HIGHT with reduced masked rounds.

O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B I O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O


Continuous representations of time-series gene expression data We present algorithms for time-series gene expression analysis that permit the principled estimation of unobserved time points, clustering, and dataset alignment. Each expression profile is modeled as a cubic spline (piecewise polynomial) that is estimated from the observed data and every time point influences the overall smooth expression curve. We constrain the spline coefficients of genes in the same class to have similar expression patterns, while also allowing for gene specific parameters. We show that unobserved time points can be reconstructed using our method with 10-15% less error when compared to previous best methods. Our clustering algorithm operates directly on the continuous representations of gene expression profiles, and we demonstrate that this is particularly effective when applied to nonuniformly sampled data. Our continuous alignment algorithm also avoids difficulties encountered by discrete approaches. In particular, our method allows for control of the number of degrees of freedom of the warp through the specification of parameterized functions, which helps to avoid overfitting. We demonstrate that our algorithm produces stable low-error alignments on real expression data and further show a specific application to yeast knock-out data that produces biologically meaningful results.

O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

time series expression data
missing value estimation


shielding against design flaws with field repairable control logic Correctness is a paramount attribute of any microprocessor design; however, without novel technologies to tame the increasing complexity of design verification, the amount of bugs that escape into silicon will only grow in the future. In this paper, we propose a novel hardware patching mechanism that can detect design errors which escaped the verification process, and can correct them directly in the field. We accomplish this goal through a simple field-programmable state matcher , which can identify erroneous configurations in the processor's control state and switch the processor into formally-verified degraded performance mode , once a "match" occurs. When the instructions exposing the design flaw are committed, the processor is switched back to normal mode. We show that our approach can detect and correct infrequently-occurring errors with almost no performance impact and has approximately 2\% area overhead.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


DEEP STRUCTURES - REAL INFORMATION REQUIREMENTS DETERMINATION We argue that a class of information is missing in the traditional ways of performing information requirements determination (IRD) activities. This ''deep structure'' information consists of the values, beliefs and unwritten rules in an organization. Previous research shows that failure to identify this is one of the reasons why information systems (IS) fail. Here, therefore, focus group methodology is suggested as a preprocess for IRD processes for uncovering latent information. Further, in order to see how effective the focus group method is for eliciting deep structure information, a laboratory experiment was conducted. The results suggest, first, that deep structure information is qualitatively different from surface structure information and second, that information gathered using the focus group methodology contains more deep structure information than that using traditional interviews. Implications are discussed.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O B I I O O O O O O O O O O B I I O O O O O O O O O O O O O O B I O O O B I I O O O O O O O O


A novel background subtraction method based on color invariants This paper discusses the problem of segmenting foreground objects precisely in surveillance video images when foreground moving objects and the still backgrounds have the similar color parts. Motivated by the studies in color constancy, the notion of color invariants is introduced to realize integrated segmentation in color similar situations. Color invariants, which are derived from a physical model, are used as descriptors of image. Then a simple background subtraction method using the color invariants is performed to examine the effectiveness of color invariants in color similar situations. The experimental results demonstrated that the color invariants based method performed well in various situations of color similarity and also was robust to environmental illumination change. Moreover, the color invariants based method achieved higher accuracy and efficiency of background subtraction compared with other existing algorithms in practical real-time surveillance video images of indoor environments. Crown Copyright (c) 2013 Published by Elsevier Inc. All rights reserved.

O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O B I O O O O O O O O O O B I O O O O O O O O B I O O O O O O B I O O B I O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O

background subtraction
color invariants
color similarity
illumination change
indoor environments


From transaction to transformation: information and communication technology, professional development and the formation of communities of practice Abstract Using the concept of layers of community, this paper describes and explains the ways in which teams of teachers, teacher educators and researchers worked together on the research project InterActive Education: teaching and learning in the information age. The focus is on the development and dissemination of professional knowledge as it relates to teaching and learning that incorporates information and communications technology (ICT) as a tool. Drawing on a range of data, we illustrate how micro-, meso- and macro-communities inter-connect to create the settings for improved professional growth. The purpose is to challenge the linearity embedded in much of the professional development processes associated with ICT and to re-model the relationship between practice and research.

O O O O O O O O B I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O

communities of practice
professional development