Numerical simulation on the flow and heat transfer of polymer powder in rotational molding A numerical study is developed to predict of flow behavior and heat transfer processes during rotational molding of polymer powder by using Discrete Element Method (DEM). The aim of this study is to model different forms, the evolution of mixing and segregation and the evolution of heat transfers in polymer powder. Influence of physical and thermal properties on the granular flow and heat transfer are investigated though the numerical example of polymer powder HDPE.

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 B I O O B I O O O O O B I 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 O O O O O B I O O O O O O O O O O

discrete element method
rotational molding
segregation
heat transfer


Error exponents for the two-user Poisson multiple-access channel The error exponent of the two-user Poisson multiple-access channel under peak and average power constraints, but unlimited in bandwidth, is considered. First, a random coding lower bound on the error exponent is obtained, and an extension of Wyner's single-user codes [1] is shown to be exponentially optimum for this case as well, Second, the sphere-packing bounding technique suggested in [3] is generalized to the case at hand and an upper bound on the error exponent, which coincides with the lower bound, is derived. Thus, this channel joins its single-user partner as one of very few for which the reliability function is known.

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

optical code division multiple access (cdma)


Lepp terminal centroid method for quality triangulation We discuss Lepp-centroid versus Lepp-midpoint algorithms for Delaunay quality triangulation. We present geometrical results that ensure that the centroid version produces triangulations with both average smallest angles greater than those obtained with the midpoint version and with bigger smallest edges, without suffering from a rare looping case associated to the midpoint method. Empirical study shows that the centroid method behaves significantly better than the midpoint version (and than the off-center algorithm for angles bigger than 25?), for geometries whose initial Delaunay triangulation have triangle smallest edges over the boundary.

O O O O 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 O O O

mesh generation
lepp-delaunay algorithms
lepp midpoint
lepp centroid


Web Service Diagnoser Model for managing faults in web services Automated policy generation tool A generic run time fault diagnoser model Monitoring component in service registry Monitoring component in service provider Fault taxonomy for publishing faults, binding faults, discovery faults and execution faults

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

web service faults
fault diagnosis model
web service policy
soap handler


Failure recovery for structured p2p networks: Protocol design and performance under churn Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured p2p networks. We confine our study to the hypercube routine scheme used by several structured p2p systems. To improve system robustness and facilitate failure recovery, we introduce the property of K-consistency, K >= 1, which generalizes consistency defined previously. (Consistency guarantees connectivity from any node to any other node.) We design and evaluate a failure recovery protocol based upon local information for K-consistent networks. The failure recovery protocol is then integrated with a join protocol that has been proved to construct K-consistent neighbor tables for concurrent joins. The integrated protocols were evaluated by a set of simulation experiments in which nodes joined a 2000-node network and nodes (both old and new) were randomly selected to fail concurrently over 10,000 s of simulated time. In each such "churn" experiment, we took a "snapshot" of neighbor tables in the network once every 50 s and evaluated connectivity and consistency measures over time as a function of the chum rate, timeout value in failure recovery, and K. We found our protocols to be effective, efficient, and stable for an average node lifetime as low as 8.3 min. Experiment results also show that the average routing delay of our protocols increases only slightly even when the churn rate is greatly increased. (c) 2006 Elsevier B.V. All rights reserved.

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 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 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 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

hypercube routing
k-consistency
sustainable churn rate
peer-to-peer networks


A simple coverage-evaluating approach for wireless sensor networks with arbitrary sensing areas We present a simple and fast deterministic solution to the area coverage problem in wireless sensor networks. The task is to determine whether all points in a region are covered by a given set of sensors, where each sensor may have any arbitrary sensing shape. We transform the area coverage problem to the intersection points' coverage problem, which is simpler and more suitable for evaluating the area coverage problem than previous approaches in our view. (c) 2007 Elsevier B.V. All rights reserved.

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

sensor network
computational geometry
k-coverage


Laws of large numbers for weighted sums of fuzzy set-valued random variables In this paper, we shall present weak and strong laws of large numbers (WLLN's and SLLN's) for weighted sums of independent (not necessarily identically distributed) fuzzy set-valued random variables in the sense of the extended Hausdorff metric d(H)(infinity), based on the result of set-valued random variable obtained by Taylor and Inoue(32,33). This work is a continuation of Li and Ogura(20).

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

extended hausdorff metric d(h)(infinity)

stochastically dominated random elements


Evaluation of connection types in design for disassembly (DFD) using analytic network process Design for disassembly (DFD) is an important design concept to make products more friendly for maintenance and remanufacturing practices. One of the important issues in DFD guidelines is related with the selection of the connectors used in the product. This paper evaluates the alternative connection types using the powerful analytic network process (ANP). The paper generates a complete ANP model, which includes all important aspects of connector selection. The model presented evaluates alternative connectors by including the three main concerns: (1) making product disassembly friendly; (2) making product assembly efficient; and (3) increasing the product performance when it is in-use. The results obtained from the model can benefit designers in making better decisions on selecting connectors to be used in the product. Benefits of the approach is detailed through illustrative example. (c) 2006 Elsevier Ltd. All rights reserved.

O O O O O B I I 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 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 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 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

design for disassembly
disassembly
connectors
anp


A cooperative control model for multiagent-based material handling systems This paper presents an Artificial Immune System (AIS)-based model for cooperative control of multiagent systems. This cooperative control model describes collective behaviors of autonomous agents, known as the AIS agents that are exemplified by the regulated activities performed by individual agents under the computation paradigm of Artificial Immune System. The regulations and emergence of agent behaviors are derived from the immune threshold measures that determine those activities performed by the AIS agents at an individual level. These threshold measures together with the collective behavioral model defined the cooperative control of the AIS-based control framework under which AIS agents behave and act strategically according to the changing environment. The cooperative control model is presented under the three domains, namely exploration, achievement and cooperation domains where AIS agents operate. In this research, we implemented the proposed cooperative control model with a case study of automated material handling with a group of AIS agents that cooperate to achieve the defined tasks.

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 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


a linear time exact hidden surface algorithm This paper presents a new hidden surface algorithm. Its output is the set of the visible pieces of edges and faces, and is as accurate as the arithmetic precision of the computer. Thus calculating the hidden surfaces for a higher resolution device takes no more time. If the faces are independently and identically distributed, then the execution time is linear in the number of faces. In particular, the execution time does not increase with the depth complexity. This algorithm overlays a grid on the screen whose fineness depends on the number and size of the faces. Edges and faces are sorted into grid cells. Only objects in the same cell can intersect or hide each other. Also, if a face completely covers a cell then nothing behind it in the cell is relevant. Three programs have tested this algorithm. The first verified the variable grid concept on 50,000 intersecting edges. The second verified the linear time, fast speed, and irrelevance of depth complexity for hidden lines on 10,000 spheres. This also tested depth complexities up to 30, and showed that perspective scenes with the farther objects smaller are even faster to calculate. The third verified this for hidden surfaces on 3000 squares.

O O O O B I B O B 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 B 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 B O B O O B O O O O O O O O O O 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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O

grid
concept
paper
hidden surface
device
size
complexity
algorithm
distributed

precise
computation
computer graphics
object
computational geometry
relevance
timing
space-filling
variable grid
hidden line
molecular models
algorithms analysis
geometric intersections
variability
program
overlay
surface


Expected computations on color spanning sets Given a set of \(n\) points, each is painted by one of the \(k\) given colors, we want to choose \(k\) points with distinct colors to form a color spanning set. For each color spanning set, we can construct the convex hull and the smallest axis-aligned enclosing rectangle, etc. Assuming that each point is chosen independently and identically from the subset of points of the same color, we propose an \(O(n^2)\) time algorithm to compute the expected area of convex hulls of the color spanning sets and an \(O(n^2)\) time algorithm to compute the expected perimeter of convex hulls of the color spanning sets. For the expected perimeter (resp. area) of the smallest perimeter (resp. area) axis-aligned enclosing rectangles of the color spanning sets, we present an \(O(n\log n)\) (resp. \(O(n^2)\)) time algorithm. We also propose a simple approximation algorithm to compute the expected diameter of the color spanning sets. For the expected distance of the closest pair, we show that it is \(\#\)P-complete to compute and there exists no polynomial time \(2^{n^{1-\varepsilon }}\) approximation algorithm to compute the probability that the closest pair distance of all color spanning sets equals to a given value \(d\) unless \(P=NP\), even in one dimension and when each color paints two points.

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

expected value
imprecise data
computational geometry


dynamic chunk adjustment for prioritized sctp video streaming in heterogeneous wlan and umts networks SCTP (Stream Control Transmission Protocol) has demonstrated its scalability and flexibility in multiplexing multiple video streams into a single association as compared to other transport layer protocols. Yet in a single SCTP association, it lacks the QoS provision of prioritized multimedia streams with different requirements. This paper therefore presents a dynamic chunk adjustment for SCTP (DC-SCTP) in supporting multiple prioritized video streams in a heterogeneous WLAN and UMTS network. The proposed DC-SCTP not only allows us to specify different bit rate requirements for prioritized multimedia streams in a single association, but it also offers the "de-association" capability to minimize the unnecessary channel wastage, when a mobile node moves into a UMTS network from a WLAN. Simulation performed on NS-2 demonstrates the effectiveness and the advantages of our proposed DC-SCTP schemes over the original SCTP.

B I I O O B B I 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 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 I I O B 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 O O O O 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 B O O O O O O O O O O O O O O O O O O B

dynamic chunk adjustment
video streaming
sctp
umts
wlan


Parameter estimation approach to the free boundary for the pricing of an American call option In this paper, we consider a free boundary problem which arises in the pricing of an American call option. The free boundary represents the optimal exercise price as a function of time before a maturity date. We are developing a parameter estimation technique to obtain both the optimal exercise curve of an American call option and its price. For the numerical solution of a forward problem, a time marching finite element method is adopted. Numerical experiment shows the convergence property of the approximation scheme. (C) 2006 Elsevier Ltd. All rights reserved.

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 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

free boundary problem
optimal exercise curve

american option
black-scholes equation
finite-element method
numerical result


A longitudinal study of development and maintenance The information systems we see around us today are at first sight very different from those that were developed 15years ago and more. On the other hand, it seems that we are still struggling with many of the same problems, such as late projects and unfulfilled customer demands. The paper presents finding relative to the distribution of work between maintenance and development tasks, comparing to the results reported earlier to assess the stability of important metrics within the area. This paper presents the main results of a survey-investigation performed in 2008 in 67 Norwegian organizations comparing the distribution of work to results from similar investigations performed in Norway in 1993, 1998, and 2003. Some comparisons to similar investigations performed in USA before this is also provided. The amount of application portfolio upkeep (work made to keep up the functional coverage of the application system portfolio of the organization, including the development of replacement systems), is at the same level as reported in 1998 and 2003. The level of application maintenance is also on the same level as the similar investigations conducted in 2003 and 1998. There was a significant increase in both maintenance and application portfolio upkeep from 1993 to 1998, which could partly be attributed to be the extra maintenance and replacement-oriented work necessary to deal with the year 2000 problem, but this seemed to be reversed in 2003 and 2008. As for the 2003 investigation, the slow IT-market in general seemed to have influenced the results negatively seen from the point of view of application systems support efficiency in organization. No similar explanation can be used for the 2008 numbers. Based on the last surveys it seems than a stable level of work distribution both on maintenance and application portfolio upkeep have been reached, although the underlying development technologies are still undergoing large changes. This is contrary to others claiming that the amount of maintenance is still increasing.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

application evolution
survey investigation


Selection of effective singular values using difference spectrum and its application to fault diagnosis of headstock The noise reduction effect of singular value decomposition (SVD) relies on the selection of effective singular values. The characteristic of singular values of normal signal and noise being studied, it is pointed out that there is a sudden change in the singular values of normal signal, but not in the ones of noise. The concept of difference spectrum of singular value is put forward, which consists of the forward differences of singular value sequence and can describe the sudden change status of singular values of a complicated signal. The automatic selection of effective singular values can be realized by the peak of the difference spectrum. If the maximum peak of difference spectrum is located in the first coordinates, it means that a strong direct current (DC) component is contained in original signal and the number of effective singular values will be determined by the second maximum peak coordinates, while what the first singular value corresponds to is the DC component, or else the number of effective singular values is determined by the maximum peak coordinates. The relationship between column number of matrix and noise removing quantity of SVD is also studied using difference spectrum and the result shows that this relationship is like a symmetrical parabola. By dint of the difference spectrum, the hidden modulation feature caused by gear vibration in headstock is isolated from a turning force signal and the fault gear is accurately located by this modulation feature.

O O O O O O B I 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 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 O O B 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 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 B I 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 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 O O O O O

singular value decomposition
difference spectrum
maximum peak
gear vibration


?-Resolution principle based on lattice-valued propositional logic LP(X) ? In the present paper, resolution-based automated reasoning theory in an L-type fuzzy logic is focused. Concretely, the ?-resolution principle, which is based on lattice-valued propositional logic LP(X) with truth-value in a logical algebra lattice implication algebra, is investigated. Finally, an ?-resolution principle that can be used to judge if a lattice-valued logical formula in LP(X) is always false at a truth-valued level ? (i.e., ?-false), is established, and the theorems of both soundness and completeness of this ?-resolution principle are also proved. This will become the theoretical foundation for automated reasoning based on lattice-valued logical LP(X).

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 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 B I O O O O O O O O O O B I O O O O O

automated reasoning
resolution principle

multi-valued logic
lattice-valued logic
lattice implication algebras


Environmental-adaptive indoor radio path loss model for wireless sensor networks localization In the received signal strength indicator (RSSI) based indoor wireless sensor networks localization system, RSSI measurements are very susceptible to multipath fading, anisotropy of antenna, low supply voltage of node and so on, which will cause the system failure to achieve a high location accuracy. This paper presents an environmental-adaptive path loss model. In the process of localization, the calibrated coefficient LSV of low supply voltage, which can be determined by monitoring the supply voltage of the sender, is used to calibrate ranging errors caused by its low supply voltage. The blind node utilizes the absolute value of RSSI to generate the phase of the corresponding receiver's location so as to determine the correction coefficient of indoor multipath fading Ri. Furthermore, in order to improve the accuracy of RSSI measurements, we also take full consideration of the effect of antenna to accurately determine the corresponding path loss model of the two communication nodes. The proposed path loss model is suitable for the majority of wireless location systems that are on the basis of RSSI-based ranging techniques. Experiment results show that the estimation accuracy and adaptability of the proposed path loss model are significantly higher than that of the traditional one.

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 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 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 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 B I 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 B O O O B I I O O O O O O O O O

path loss model
multipath fading
adaptability

received signal strength indicator (rssi)


Real-time pricing program in a smart grid environment Improving system efficiency and reliability is motivating countries to design and execute different types of time of use demand response programs. However, certain deficiencies prevent these programs from reaching their goals. Smart meters as a mechanism could help the electric system to reach the highest demand-side management goals which are inaccessible through today's methods. On the other hand, realization of smart meters in a system would be very costly. In this situation, identifying the most influential buses to implement the infrastructures of a smart grid is of highest importance. In this paper, after a short overview of demand response programs and problems facing them, a smart meter is introduced as a solution to these problems. As a test grid, the IEEE 57-bus network has been chosen to compare the results of the execution of a normal time of use program and real-time pricing program available in a smart grid. In order to execute the mentioned programs in this system, 10 buses have been selected as the most influential buses using a generation shift factor method. The execution of time of use and real-time pricing programs on the selected buses have been simulated using a demand response model. Finally, the time of use program and the real-time pricing program in a smart grid environment have been compared with respect to load shape modification, load factor, price curve, and 'Expected Power Not Supplied'.

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 O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O


Comparing design approaches for elliptic curve point multiplication over GF(2k) GF ( 2 k ) with polynomial basis representation Point Multiplication (PM) is considered the most computationally complex and resource hungry Elliptic Curve Cryptography (ECC) mathematical operation. PM hardware accelerator design can follow several approaches that lead to a fast, small or flexible implementation, meeting related application specifications. However, each PM design decision has certain outcomes in utilized hardware resources and computation speed. Such a key design decision is related to the structure of the GF(2k) GF ( 2 k ) multipliers to be employed in the PM accelerator. In this paper, we highlight the GF(2k) GF ( 2 k ) multiplication role in the overall PM performance and investigate what are the trade-offs on a PM accelerator when using bit serial or bit parallel multiplication approach in terms of speed, chip covered area and flexibility. To achieve this goal, we estimate these tradeoffs for a single point operation and specify realistic design cases for bit serial and bit parallel multiplier based PM design approaches. To evaluate the theoretical modeling, a point operation design methodology based on the parallelism and rescheduling of GF(2k) GF ( 2 k ) operations is proposed. This design approach is adapted to two characteristic PM algorithm realizations, the traditional double & add algorithm and the side channel attack resistant Montgomery power ladder algorithm. Our goal is to assess the resulting PM accelerator overall performance so as to achieve high speed with an acceptable cost on chip covered area (hardware resources). Using this methodology, PM is performed in series of GF(2k) GF ( 2 k ) parallelism stages. To test the proposed methodology, 8 PM accelerator use cases are identified that can offer high speed, flexibility, side channel attack resistance or small chip covered area. To provide fair comparisons and results, a common PM architecture is devised and the use case PM accelerators are implemented in FPGA technology. Depending on the designers goal, the proposed architectures and 8 implementations can offer the benefit of either high speed (the proposed work is currently one of the fastest known GF(2k) GF ( 2 k ) bit parallel multiplier based PM realization) or flexibility with reasonable compromises in chip covered area.

O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Fool Me Twice: Exploring and Exploiting Error Tolerance in Physics-Based Animation The error tolerance of human perception offers a range of opportunities to trade numerical accuracy for performance in physics-based simulation. However, most prior work on perceptual error tolerance either focus exclusively on understanding the tolerance of the human visual system or burden the application developer with case-specific implementations such as Level-of-Detail (LOD) techniques. In this article, based on a detailed set of perceptual metrics, we propose a methodology to identify the maximum error tolerance of physics simulation. Then, we apply this methodology in the evaluation of four case studies. First, we utilize the methodology in the tuning of the simulation timestep. The second study deals with tuning the iteration count for the LCP solver. Then, we evaluate the perceptual quality of Fast Estimation with Error Control (FEEC) [Yeh et al. 2006]. Finally, we explore the hardware optimization technique of precision reduction.

O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


On the finite element analysis of inverse problems in fracture mechanics This paper presents a numerical study of inverse parameter identification problems in fracture mechanics. Inverse methodology is applied to the detection of subsurface cracks and to the study of propagating cracks. The procedure for detecting subsurface cracks combines the finite element method with a sequential quadratic programming algorithm to solve for the unknown geometric parameters associated with the internal flaw. The procedure utilizes finite element substructuring capabilities in order to minimize the processing and solution time for practical problems. The finite element method and non-linear optimization are also used in determining the direction a crack will propagate in a heterogeneous planar domain. This procedure involves determining the direction that produces the maximum strain energy release for a given increment of crack growth. The procedure is applied to several numerical examples. The results of these numerical studies coincide with theoretical predictions and experimentally observed crack behavior.

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

crack identification
crack propagation
finite elements
inverse analysis


A high-speed energy-efficient 64-bit reconfigurable binary adder Datapaths for media signal processing are typically built using programmable computational elements such as adders and multipliers, which can be run-time reconfigured to operate on simple integers with 8, 16, or 32 bits of precision. In this brief, a new high-speed energy-efficient reconfigurable adder for media signal processing is presented. The proposed circuit is based on carry-propagation schemes and can be partitioned to perform one 64-, two 32-, four 16-, and eight 8-bit additions. When the Austria Mikro System (AMS) 0.35 mum 2-poly 3-metal 3.3 V CMOS (CSD) process is used to produce layout, a worst propagation delay of about 4.9 ns and an average energy dissipation of about 181 muW/MHz are obtained.

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 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

arithmetic
reconfigurable computing
vlsi


generation of crossmedia dynamic learning contexts from itv Tendencies in convergence, integration and co-existence of several media technologies are creating new opportunities for the globalization of learning practices. Simultaneously, the lifelong learning phenomena, which will take place in a wide variety of contexts and locations, call for flexible environments. iTV holds a great potential in this scenario, but there is still limited research in terms of cognitive and interaction aspects. This paper presents a new paradigm to generate crossmedia dynamic learning contexts from iTV with the aim to link the mentioned opportunities in flexible, adequate and effective learning contexts. In order to better illustrate this paradigm an iTV system, (e-iTV), was designed. The system generates, via iTV, Crossmedia Online Personalized Learning Environments, also designated as COPLE or web lessons, accessible from several types of devices. The system is prepared to respond to communication needs of the viewers since and allows them to share their web lesson. In practical terms, the e-iTV system uses the TV set, not as the final medium, but as a starting point to new crossmedia dynamic learning and communications contexts. The motivations and goals of this work are presented, followed by a review of related work and concepts and the presentation of the conceptual framework. A description of the analysis, planning, development and evaluation of the e-iTV system is presented based on a specific HCI based model. The paper concludes by opening perspectives for future research and developments.

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 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 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 B 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 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 B O O O O O O O O O O O O O

itv service
itv learning
personalized web lessons
itv interaction
crossmedia learning environments


Analysis of Deskew Signaling Via Adaptive Timing This paper presents an adaptive timing method for analysis of deskew signaling In high-performance Integrated systems. The proposed approach models the practical deskew schemes as an adaptive system to study the performance limit or deskew signaling. We Investigate the statistical properties of optimal deskew, which can be considered as the theoretical limit of deskew signaling. This approach also allows us to study the related energy efficiency Issues in deskew schemes. We determine the bound on energy efficiency subject to the performance constraint on deskew signaling. Simulation results show that the performance of practical deskew schemes in a 90-nm process is 23.2% away front the optimal deskew scheme, and the gap of energy efficiency is 51% above the bound.

O O O O O O O O O O O O O O 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 I O O O O O O O O O B I O O O 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 O O O O B I O O O O O


synthetic generation of cellular network positioning data The flow of data coming from wireless telecommunication devices enables a novel classes of applications of high societal and economic impact. However, to make this flow of data useful, techniques for the discovery of consumable and concise knowledge out of these raw data have to be developed. Within the long term goal of devising knowledge discovery and analysis methods for trajectories of moving objects, this paper focuses on providing a system to build benchmark datasets for cellular devices positioning data, that typically will not be easily publicly available for scientific research. We called this system CENTRE (CEllular Network Trajectories Reconstruction Environment), and it aims at randomly generating movement data of users through cellular network by simulating semantic-based movement behaviours from a setting of user parameters. CENTRE allows to combine user preferences which may influence the random distributions, domain semantics such as those depending on the cartography and by interesting geo-referenced objects or spatial constraints. The system is composed by three components, namely the Synthetic Trajectories Generation , able to generate possible objects behaviour on a specific space, the Logs generation , which is designed to take into account the various network technological requirements and the Approximated Trajectories Reconstruction which performs the reconstruction taking into account the approximation of the data.

O B O O B O B O B O B O O B B O O O O O O B O O O O O O O O O O B O B O O O O O O O O O B O O O O B O O O O O O O O O O O B O O O O O B O O O O B O O O O O O O B O O O O O B O O O O O O O O O O B O O O O O O B B B O O O O O O O B B O B O O B O O O B O O O O O B O O O O O B 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 B B O O O O O O O O O O B O O B O O O O O O O B O O B O B O O O B B O O O B O O B O B O O B

requirements network applications generation reconstruction movement benchmark approximation account knowledge paper user spatial wireless research influence users trajectories space flow data telecommunication

cellular network
object
constraint
randomization
component
posit
analysis method
knowledge discovery
systems
environments
user preference
semantic
device
data mining
mobile devices positioning
spatio-temporal data generators
discoveries
distributed
moving object
class


Performing flexible control on low-cost microcontrollers using a minimal real-time kernel In recent years, approaches to control performance and resource optimization for embedded control systems have been receiving increased attention. Most of them focus on theory, whereas practical aspects are omitted. Theoretical advances demand flexible real-time kernel support for multitasking and preemption, thus requiring more sophisticated and expensive software/hardware solutions. On the other hand, embedded control systems often have cost constraints related with mass production and strong industrial competition, thus demanding low-cost solutions. In this paper, it is shown that these conflicting demands can be softened and that a compromise solution can be reached. We advocate that recent research results on optimal resource management for control tasks can be implemented on simple multitasking preemptive real-time kernels targeting low-cost microprocessors, which can be easily built in-house and tailored to actual application needs. The experimental evaluation shows that significant control performance improvement can be achieved without increasing hardware costs.

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 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

adaptive resource management
embedded systems
microcontroller
real-time kernel


Query-biased summarization based on lexical chaining Recently, the prevalence of information retrieval engines has created an important application of the automatic summarization as the display of retrieval results, whereby the user can quickly and accurately judge the relevance of texts returned as a result of a query. Here, rather than producing a generic summary, the summary that reflects the user's topic of interest (information need) expressed in the query would be considered as more suitable. This type of summary is often called query-biased summary. In this paper we present a method for producing query-biased summaries using lexical chains. Lexical chains are sequences of words that are in lexical cohesion relation with each other, and tend to indicate fragments of a text that form a semantic unit. Using lexical chains would enable to produce more coherent and readable summaries than previous approaches to query-biased summarization. To evaluate the effectiveness of our method, a task-based evaluation scheme is adopted. The results from the experiments show that query-biased summaries by lexical chains outperform others in the accuracy of subjects' relevance judgments.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 container multimodal transportation scheduling approach based on immune affinity model for emergency relief Various disasters with serious results are reported and happen around our lives. Most of them are unconventional contingency events. Emergency relief is an important activity dealing with the disasters to transfer a large number of materials to the destroyed places for casualties and reconstruction for the country, even the world. Container multimodal transportation will play an important role because of its superior characteristics. The relations in the process of supply and transportation build up the container supply chain. It is critical to schedule the multimodal transportation flow of the chain with time efficiency of higher reliability. In this study, the system of container multimodal transportation emergency relief is modeled as an affinity network inspired by the immune system. An integer linear programming model is proposed to build the path selection for container supply chain in the context of emergency relief. The simulation study shows the promising effects of the model. The study is valuable for designing the emergency logistics management system with optimal path selection and flow design of container supply chain in disaster environments. (C) 2010 Elsevier Ltd. All rights reserved.

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 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 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 O O O O O O O O O B I 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 B I O O O O O B I O O O O O O O O O O

emergency relief
immune affinity model
path selection
supply chain

multimodal transport
emergency management


Supermartingales in prediction with expert advice The paper applies the method of defensive forecasting, based on the use of game-theoretic supermartingales, to prediction with expert advice. In the traditional setting of a countable number of experts and a finite number of outcomes, the Defensive Forecasting Algorithm is very close to the well-known Aggregating Algorithm. Not only the performance guarantees but also the predictions are the same for these two methods of fundamentally different nature. The paper also discusses a new setting where the experts can give advice conditional on the learner's future decision. Both the algorithms can be adapted to the new setting and give the same performance guarantees as in the traditional setting. Finally, an application of defensive forecasting to a setting with several loss functions is outlined. (C) 2010 Elsevier B.V. All rights reserved.

O O B I I I O O O O O O O O O O O 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 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

prediction with expert advice
defensive forecasting algorithm
aggregating algorithm


Constructing and application of multimedia TV-news archives ? This paper addresses an integrated information mining techniques for broadcasting TV-news. This utilizes technique from the fields of acoustic, image, and video analysis, for information on news story title, newsman and scene identification. The goal is to construct a compact yet meaningful abstraction of broadcast TV-news, allowing users to browse through large amounts of data in a non-linear fashion with flexibility and efficiency. By adding acoustic analysis, a news program can be partitioned into news and commercial clips, with 90% accuracy on a data set of 400h TV-news recorded off the air from July 2005 to August 2006. By applying speaker identification and/or image detection techniques, each news stories can be segmented with a better accuracy of 95.92%. On-screen captions or subtitles are recognized by OCR techniques to produce the text title of each news stories. The extracted title words can be used to link or to navigate more related news contents on the WWW. In cooperation with facial and scene analysis and recognition techniques, OCR results can provide users with multimodal query on specific news stories. Some experimental results are presented and discussed for the system reliability, performance evaluation and comparison.

O O O O B 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 O O O B I O O O O O O O O O O O O O O O O O O O

multimedia
information mining
multimodal query


A data-driven approach to optimizing spectral speech enhancement methods for various error criteria Gain functions for spectral noise suppression have been derived in literature for some error criteria and statistical models. These gain functions are only optimal when the statistical model is correct and the speech and noise spectral variances are known. Unfortunately, the speech distributions are unknown and can at best be determined conditionally on the estimated spectral variance. We show that the decision-directed approach for speech spectral variance estimation can have an important bias at low SNRs, which generally leads to too much speech suppression. To correct for such estimation inaccuracies and adapt to the unknown speech statistics, we propose a general optimization procedure, with two gain functions applied in parallel. A conventional algorithm is run in the background and is used for a priori SNR estimation only. For the final reconstruction a different gain function is used, optimized for a wide range of signal-to-noise ratios. The gain function providing for the reconstruction is trained on a speech database, by minimizing a relevant error criterion. The procedure is illustrated for several error criteria. The method compares favorably to current state-of-the-art methods, and needs less smoothing in the decision-directed spectral variance estimator.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

spectral distortion measures
speech model


Structure-Function Relationships in Estrogen Receptors and the Characterization of Novel Selective Estrogen Receptor Modulators with Unique Pharmacological Profiles This article summarizes recent research on the development of estrogen receptor alpha (ER?) and estrogen receptor beta (ER?) subtype-selective ligands based on our understanding of structure-activity relationships in these two estrogen receptors and differences in their ligand binding domains and activation function domains. The use of these ligands should enable greater understanding of the unique biologies mediated by ER? versus ER? and may, as well, provide selective estrogen receptor modulators having unique biological and pharmacological profiles optimal for prevention and treatment of breast cancer, for menopausal hormone replacement, for prevention of osteoporosis, and for potential cardiovascular benefit.

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


Nondeterministic Moore automata and Brzozowski's minimization algorithm Moore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to a given NMA. We propose an algorithm that is a variant of Brzozowski's minimization algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice. Moreover, we explore more general classes of NMA and analyze the applicability of the algorithm. For some of such classes the algorithm does not return the minimal equivalent deterministic automaton. (C) 2012 Elsevier B.V. All rights reserved.

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 O O O O O O

brzozowski's minimization algorithm
automata minimization


Quaternion Zernike moments and their invariants for color image analysis and object recognition Moments and moment invariants have become a powerful tool in pattern recognition and image analysis. Conventional methods to deal with color images are based on RGB decomposition or graying, which may lose some significant color information. In this paper, by using the algebra of quaternions, we introduce the quaternion Zernike moments (QZMs) to deal with the color images in a holistic manner. It is shown that the QZMs can be obtained from the conventional Zernike moments of each channel. We also provide the theoretical framework to construct a set of combined invariants with respect to rotation, scaling and translation (RST) transformation. Experimental results are provided to illustrate the efficiency of the proposed descriptors.

B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 technique for constructing aspect weavers using a program transformation engine As aspect-orientation grows in influence, the scope of applicability also will need to expand. The new approaches for improved modularization offered by aspect-orientation can provide benefits not only to new development efforts, but to legacy systems as well. A difficulty with legacy system adoption of aspect-orientation, however, is in the construction of new weavers for the disparate programming languages in which the legacy software is coded. In this paper, we describe our experience with using a program transformation system as the underlying engine for weaver construction. In particular, the capability for weaving aspects into Object Pascal (Delphi) is demonstrated using the Design Maintenance System (DMS). From this Object Pascal weaving environment, the improved modularization of several crosscutting concerns in a commercial software application is shown. The paper also describes an initial approach for construction of language-independent aspect weavers.

O O O O B O O O B I 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 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 O O O O B O O O B O O O B I O O O O B O O O O O O O O O O O B O O O O O O B B O O O O B O O O O O O O O O O O O O B O O O O B O O O O O O O O O B O

software
legacy systems
aspect
influence
engine
maintenance
design
object
experience
paper
program transformation

crosscutting concern
applications
aspect orientation
systems
environments
developer
language
modular
adopt
programming language


the temporal query language tquel Recently, attention has been focussed on historical databases (HDBs), representing an enterprise over time. We have developed a new language, TQuel, to query an HDB. TQuel is a superset of Quel, the query language in the Ingres relational database management system. This paper provides an overview of the language, motivating the various design decisions with the objective that it be a minimal extension, both syntactically and semantically, of Quel.

O B B B O O B 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 B B O O O O B B O O B O O O O O B O O O B O O O O O O O O B O O O O O O O

attention enterprise language design temporal paper database minimal management query

systems
motivation
object
query languages
extensibility
timing
relational database


The Controlling Value Boolean Matching We present here the Controlling Value Boolean Matching based on fault analysis. The problem is to match a Boolean function with don't cares on library cells under arbitrary input permutations and/or input-output phase assignments. Most of the library cells can be represented by tree structure circuits. The approach presented here is suitable for these structures and computes the Boolean matching better than the structural matching used in SIS. It can handle library cells with a general topology and reconvergent paths. The benchmark test shows that the Controlling Value Boolean Matching can be as faster as the structural matching used in SIS.

O O 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 O O O O O O O O O O O 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 B I O O O O O O O O O O O

observability
technology mapping
signatures


Adaptive FE-analysis of column supported Reissner-Mindlin plates An adaptive finite element program based on the Zienkiewicz-Zhu error estimator, superconvergent patch recovery of stress (SPR) and displacement (SPRD) and an efficient advancing front mesh generator has been applied to plate bending analysis. The most accurate and effective error estimation is to use SPRD for the bending moment part and SPR for the shear part. This paper reports on the implementation and a numerical experiment on a real life engineering problem; a column-supported car park slab. Further, studies concerning the behavior of plates and ideas of how to get an improved solution in the 'disturbed regions' (boundaries, column-plate intersections etc,), where the plate theory in itself is in error, are presented. (C) 1999 Published by Elsevier Science Ltd. All rights reserved.

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 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 O O O O O O O O O O O O O O O O O O O O O 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

mesh adaptive fem
discretization error
boundary layer


workshop on end user programming for the web In the past several years, there has been a resurgence in research activity in end user programming (EUP), all focused on the web. This work is spread across a variety of institutions and has been published in a variety of conference venues, including CHI, UIST, IUI, and WWW. This workshop will bring these researchers together for a common discussion, with the following goals:establish a sense of community amongst researchers in this area; discuss common problems and lessons learned about doing research in EUP for the web; define a standard corpus of tasks that can be used to evaluate current and future EUP systems; and plan the publication of an edited book on the topic of end user programming for the web.

O O B I I O O B O O O O O O O O O O O O O O B I I 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 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 I I O O B


reducing branch costs via branch alignment Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving instruction cache locality, and the few studies concerned with branch prediction reported small or minimal improvements. As wide-issue architectures become increasingly popular the importance of reducing branch costs will increase, and branch alignment is one mechanism which can effectively reduce these costs. In this paper, we propose an improved branch alignment algorithm that takes into consideration the architectural cost model and the branch prediction architecture when performing the basic block reordering. We show that branch alignment algorithms can improve a broad range of static and dynamic branch prediction architectures. We also show that a program performance can be improved by approximately 5\% even when using recently proposed, highly accurate branch prediction architectures. The programs are compiled by any existing compiler and then transformed via binary transformations. When implementing these algorithms on a Alpha AXP 21604 up to a 16\% reduction in total execution time is achieved.

O O O O O O O O O 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 I 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 B O O O O O O B I 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 B B I O O O O O O B B 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 B O O O O O O

program
cost model
branch prediction
dynamic
architecture
performance
reduction
paper
algorithm
locality
minimal

aligning
research
branch target buffers
profile-based optimization
trace scheduling
compilation
timing
instruction caches
blocking


Delay characterization and performance evaluation of cluster-based WSN with different deployment distributions We demonstrated the key role of BS location selection for random topology to fulfill the application mission. Delay statistical analysis captures the intrinsic properties of the main delay components. Real-time applications should examine the instantaneous delay and not only depend on the average values. A tradeoff should be considered between the energy utilization efficiency and the required amount of data/coverage.

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

qos wireless sensor networks
random deployment sensors
cluster formation
energy efficiency
secure sensor networks


Twitter data analysis by means of Strong Flipping Generalized Itemsets We analyze Twitter user-generated content enriched with taxonomy hierarchies. We analyze changes in itemset correlation at different abstraction levels. We extract patterns having many unexpected low level correlation changes. We discover patterns useful for expert advanced analysis.

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

social network analysis and mining
data mining and knowledge discovery
generalized itemset mining


Novel voltage programming n-channel TFT pixel circuit for low power and high performance AMOLED displays A novel 7T1C pixel circuit is proposed for high resolution, high frame rate, and low power AMOLED displays. The whole line time is in use only for charging the data voltage. The current non-uniformity is reduced to 2.5% at a 240Hz full-HD AMOLED display. The average compensated voltage error is reduced to 0.18V, compared to 0.75V of 5T2C. The initialization power consumptions are 98mW and the dynamic power saving is 98.7% over 5T2C.

O B I O O O O O B I O O O O O O O O O O O O O B I 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 O O O O O O O O O O O O

high resolution
high frame rate
low power
voltage programming


Defining the Chemotherapeutic Targets of Histone Deacetylase Inhibitors The use of many conventional chemotherapeutic drugs is often severely restricted due to dose-limiting toxicities, as these drugs target the destruction of the proliferating fraction of cells, often with little specificity for tumor cells over proliferating normal body tissue. Many newer drugs attempt to overcome this shortcoming by targeting defective gene products or cellular mechanisms that are specific to the tumor, thereby minimizing the toxicity to normal tissue. Histone deacetylase inhibitors are an example of this type of tumor-directed drug, having significant toxicity for tumors but minimal effects on normal tissue. These drugs can affect the transcriptional program by modifying chromatin structure, but it is not yet clear whether specific transcriptional changes are directly responsible for their tumor-selective toxicity. Recent evidence suggests that transcriptional changes underlie their cytostatic activity, although this is not tumor-selective and affects all proliferating cells. Here we present evidence that supports an alternative mechanism for the tumor-selective cytotoxicity of histone deacetylase inhibitors. The target is still likely to be the chromatin histones, but rather than transcriptional changes due to modification of the transcriptionally active euchromatin, we propose that hyperacetylation and disruption of the transcriptionally inactive heterochromatin, particularly the centromeric heterochromatin, and the inability of tumor cells to cell cycle arrest in response to a specific checkpoint, underlies the tumor-selective cytotoxicity of these drugs.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O O O O O O O O O O O O O O O O O O O O O O O

histone deacetylase inhibitor
centromere
cell cycle checkpoint
mitosis


QNoC: QoS architecture and design process for network on chip We define Quality of Service (QoS) and cost model for communications in Systems on Chip (SoC), and derive related Network on Chip (NoC) architecture and design process. SoC inter-module communication traffic is classified into four classes of service: signaling (for inter-module control signals); real-time (representing delay-constrained bit streams); RD/WR (modeling short data access) and block-transfer (handling large data bursts). Communication traffic of the target SoC is analyzed (by means of analytic calculations and simulations), and QoS requirements (delay and throughput) for each service class are derived. A customized Quality-of-Service NoC (QNoC) architecture is derived by modifying a generic network architecture. The customization process minimizes the network cost (in area and power) while maintaining the required QoS. The generic network is based on a two-dimensional planar mesh and fixed shortest path (XY based) multi-class wormhole routing. Once communication requirements of the target SoC are identified, the network is customized as follows: The SoC modules are placed so as to minimize spatial traffic density, unnecessary mesh links and switching nodes are removed, and bandwidth is allocated to the remaining links and switches according to their relative load so that link utilization is balanced. The result is a low cost customized QNoC for the target SoC which guarantees that QoS requirements are met.

B 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 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 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 B O O O O O O O O O O O


Towards NFC payments using a lightweight architecture for the Web of Things The Web (and Internet) of Things has seen the rapid emergence of new protocols and standards, which provide for innovative models of interaction for applications. One such model fostered by the Web of Things (WoT) ecosystem is that of contactless interaction between devices. Near Field Communication (NFC) technology is one such enabler of contactless interactions. Contactless technology for the WoT requires all parties to agree one common definition and implementation and, in this paper, we propose a new lightweight architecture for the WoT, based on RESTful approaches. We show how the proposed architecture supports the concept of a mobile wallet, enabling users to make secure payments employing NFC technology with their mobile devices. In so doing, we argue that the vision of the WoT is brought a step closer to fruition.

O B O O O B B 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 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 B B 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 B O O O O O O O O O O O O O O O O O O O O O O O

nfc
web of things
architecture
lightweight
mobile wallet


web

based

presentation

of

semantically

tagged

content

for

public

sculptures

and

monuments

in

the

uk

The

documentation

and

presentation

of

digital

content

is

a

critical

but

non-trivial

task

for

the

Cultural

Heritage

sector.

Curators

are

often

faced

with

the

task

of

cataloguing

every

piece

of

heritage

and

maintaining

the

resulting

information

in

such

a

way

which

is

suitable

for

scholarly

research

and

public

dissemination.

Hence,

the

integration

of

content

poses

additional

challenges.

This

paper

introduces

research

conducted

to

integrate

semantically

tagged

content

to

the

catalogue

acquired

within

the

Public

Monuments

and

Sculpture

Association's

National

Recording

Project

(NRP)

in

the

UK.

This

research

involves

the

combination

of

graphical

APIs

and

semantic

technologies

in

order

to

integrate

content

with

semantic

tags

in

a

web

browser.

Although

the

initial

results

are

still

experimental;

it

is

expected

that

they

will

support

scholarly

research

and

public

dissemination

by

presenting

a

variety

of

integrated

documentation

on

the

project

website:

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 O O O 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


An empirical analysis of the optimality rate of flow shop heuristics If a certain optimization problem is NP-hard or even harder, one could expect that the chances of solving it optimally should rather decrease with an increase of the problem size. We reveal, however, that the opposite occurs for a strongly NP-hard problem, which requires sequencing n jobs through an m machine flow shop so as to minimize the makespan. In particular, we empirically examine optimality rates (the probability of being optimal) of the famous NEH heuristic of Nawaz et al. [Nawaz, M., Enscore, Jr., E., Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, The International Journal of Management Science 11, 9195] and two improved versions of NEH. By using millions of simulation trials and a new effective lower bound on the shortest makespan, we observe relatively high optimality rates of the three heuristics for small values of m. Rather surprisingly, for larger values of n, the heuristics become more frequently optimal as n increases. Neither theoretical nor empirical studies of optimality rates of flow shop heuristics have been conducted so far, and to the best of our knowledge no similar studies are known in the field of operations research.

O O O O O B 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 B I 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 O O O O O O O O O O O O O O O O O O O O O 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 B 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 B 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

flow shop
makespan
heuristics
optimality


Semi-online scheduling problems on two identical machines with inexact partial information In semi-online scheduling problems, we always assume that some partial additional information is exactly known in advance. This may not be true in some applications. This paper considers semi-online scheduling problems on two identical machines with inexact partial information. Three versions are considered, where we know in advance that the total size of all jobs, the optimal value, and the largest job size are in given intervals, respectively, while their exact values are unknown. We give both lower bounds of the problems and competitive ratios of algorithms as functions of a so-called disturbance parameter r is an element of [1, infinity). We establish for which r the inexact partial information is useful to improve the performance of a semi-online algorithm with respect to its pure online problem. Optimal or near optimal algorithms are then obtained. (c) 2007 Elsevier B.V All rights reserved.

O B 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 O O O O O O O O O O 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

analysis of algorithm
semi-online
competitive analysis


A selective video encryption scheme for MPEG compression standard With the increase of commercial multimedia applications using digital video, the security of video data becomes more and more important. Although several techniques have been proposed in order to protect these video data, they provide limited security or introduce significant overhead. This paper proposes a video security scheme for MPEG video compression standard, which includes two methods: DCEA (DC Coefficient Encryption Algorithm) and "Event Shuffle." DCEA is aim to encrypt group of codewords of DC coefficients. The feature of this method is the usage of data permutation to scatter the ciphertexts of additional codes in DC codewords. These additional codes are encrypted by block cipher previously. With the combination of these algorithms, the method provides enough security for important DC component of MPEG video data. "Event Shuffle" is aim to encrypt the AC coefficients. The prominent feature of this method is a shuffling of AC events generated after DCT transformation and quantization stages. Experimental results show that these methods introduce no bit overhead to MPEG bit stream while achieving low processing overhead to MPEG codec.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I

commercial multimedia applications
mpeg codec
processing overhead
bit overhead

selective encryption
mpeg bitstream
data shuffle


Damage detection using generic elements: Part II. Damage detection This paper proposes the use of generic elements in damage detection, based on the use of an updated baseline finite element model, modal sensitivities and changes in the measured modal quantities arising from structural damage. A companion paper presented the fundamental theory of model updating and generic element or substructure parameterisation. The experimental structure was chosen so that a considerable difference existed between the baseline finite element model and the undamaged (healthy) structure. However the structure was successfully updated so that the model can be used effectively for damage detection and location. The main aim of this paper is to propose a method for the estimation of damage location and apply it to an experimental case study. The novel aspects of this approach are the type of parameterisation employed for the model updating and damage detection studies and the use of measured mode shapes to handle geometrical symmetry of the structure.

B I O B I O O B I O O O O O O B 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 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 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 B O O O O O O B I O O O O O O O O O O O O O O O

generic elements
parameterisation
damage detection
damage location

experimental modal analysis
finite element method


Attribute-based encryption schemes with constant-size ciphertexts Attribute-based encryption (ABE), as introduced by Sahai and Waters, allows for fine-grained access control on encrypted data. In its key-policy flavor (the dual ciphertext-policy scenario proceeds the other way around), the primitive enables senders to encrypt messages under a set of attributes and private keys are associated with access structures that specify which ciphertexts the key holder will be allowed to decrypt. In most ABE systems, the ciphertext size grows linearly with the number of ciphertext attributes and the only known exception only supports restricted forms of access policies. This paper proposes the first attribute-based encryption (ABE) schemes allowing for truly expressive access structures and with constant ciphertext size. Our first result is a ciphertext-policy attribute-based encryption (CP-ABE) scheme with 0(1)-size ciphertexts for threshold access policies and where private keys remain as short as in previous systems. As a second result, we show that a certain class of identity-based broadcast encryption schemes generically yields monotonic key-policy attribute-based encryption (KP-ABE) systems in the selective set model. Our final contribution is a KP-ABE realization supporting non-monotonic access structures (i.e., that may contain negated attributes) with short ciphertexts. As an intermediate step toward this result, we describe a new efficient identity-based revocation mechanism that, when combined with a particular instantiation of our general monotonic construction, gives rise to the most expressive KP-ABE realization with constant-size ciphertexts. The downside of our second and third constructions is that private keys have quadratic size in the number of attributes. On the other hand, they reduce the number of pairing evaluations to a constant, which appears to be a unique feature among expressive KP-ABE schemes. (C) 2011 Elsevier B.V. All rights reserved.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

public-key cryptography
provable security
attribute-based encryption
expressivity
efficiency


A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems In this paper, a new algorithm for solving constrained nonlinear programming problems is presented. The basis of our proposed algorithm is none other than the necessary and sufficient conditions that one deals within a discrete constrained local optimum in the context of the discrete Lagrange multipliers theory. We adopt a revised particle swarm optimization algorithm and extend it toward solving nonlinear programming problems with continuous decision variables. To measure the merits of our algorithm, we provide numerical experiments for several renowned benchmark problems and compare the outcome against the best results reported in the literature. The empirical assessments demonstrate that our algorithm is efficient and robust.

O O B I I O B I I 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 O O O O O O O O O O O O O O O O B I I 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

particle swarm optimization
discrete lagrange multipliers
nonlinear programming


assessing it service-learning Service-Learning is the delivery of a service to the community within the context of an educational program of study. Going further, it is a form of experiential learning, applying what was learned within a classroom or laboratory setting to problems of the real world. Using service-learning, students in information technology can experience the unstructured problems of a real world situation while having the structure of a university course. While one major goal of service-learning is service, the delivery of some benefit to the community partner, the other major goal is for the students to achieve the learning that is part of the department's education objectives. It is therefore a pedagogy which should be investigated for efficacy as any other pedagogy would be. This paper investigates how information technology based service-learning could be measured for both service and learning. For service, a longer term follow-up with the non-profit partners is presented. The purpose is to ascertain if the service learning project really did help the non-profit partners provide their services better, or, conversely, if the service-learning project was really a "feel good" project for the student and a "promotion" project for the community partner. For the learning portion of service-learning, a review of assessment methods is presented. These methods look at two areas, the application of Information Technology domain specific hard skills and also the application of other skills such as teamwork, communication, and project management. The use of a project postmortem is proposed as a reflective exercise to measure how the student participants have been changed in the process.

O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Deterministic versus stochastic seasonal fractional integration and structural breaks This paper considers a general model which allows for both deterministic and stochastic forms of seasonality, including fractional (stationary and nonstationary) seasonal orders of integration, and also incorporating endogenously determined structural breaks. Monte Carlo analysis shows that, in the case of a single break, the suggested procedure performs well even in small samples, accurately capturing the seasonal properties of the series, and correctly detecting the break date. As an illustration, the model is estimated using four US series (output, consumption, imports and exports). The results suggest that the seasonal patterns of these variables have changed over time: specifically, in the second subsample the systematic component of seasonality becomes insignificant, whilst the degree of persistence increases.

O O O O B 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 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

fractional integration
structural breaks

deterministic and stochastic seasonality


Efficient multi-camera vehicle detection, tracking, and identification in a tunnel surveillance application ? This paper presents an integrated solution for the problem of detecting, tracking and identifying vehicles in a tunnel surveillance application, taking into account practical constraints including real-time operation, poor imaging conditions, and a decentralized architecture. Vehicles are followed through the tunnel by a network of non-overlapping cameras. They are detected and tracked in each camera and then identified, i.e. matched to any of the vehicles detected in the previous camera (s). To limit the computational load, we propose to reuse the same set of Haar-features for each of these steps. For the detection, we use an AdaBoost cascade. Here we introduce a composite confidence score, integrating information from all stages of the cascade. A subset of the features used for detection is then selected, optimizing for the identification problem. This results in a compact binary vehicle fingerprint, requiring minimal bandwidth. Finally, we show that the same subset of features can also be used effectively for tracking. This Haar-features based tracking-by-identification yields surprisingly good results on standard datasets, without the need to update the model online. The general multi-camera framework is validated using three tunnel surveillance videos.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

vehicle detection
adaboost
tunnel surveillance


a language for testing programs The development of the artificial intelligence techniques, the multimedia and Internet technologies increase the interest to new computer-based teaching and learning systems. This paper presents an internal declarative language implemented in a multimedia knowledge-testing system. The focus of the paper is on the environment architecture as well as the syntax and semantic of the proposed language.

O O O O O O O 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

testing program
knowledge-testing system
language syntax and semantic


Words versus character N-grams for anti-spam filtering The increasing number of unsolicited e-mail messages (spam) reveals the need for the development of reliable anti-spam filters. The vast majority of content-based techniques rely on word-based representation of messages. Such approaches require reliable tokenizers for detecting the token boundaries. As a consequence, a common practice of spammers is to attempt to confuse tokenizers using unexpected punctuation marks or special characters within the message. In this paper we explore an alternative low-level representation based on character n-grams which avoids the use of tokcnizers and other language-dependent tools. Based on experiments on two well-known benchmark corpora and a variety of evaluation measures, we show that character n-grams are more reliable features than word-tokens despite the fact that they increase the dimensionality of the problem. Moreover, we propose a method for extracting variable-length n-grams which produces optimal classifiers among the examined models under cost-sensitive 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

anti-sparn filtering
machine learning
n-grams


Dynamic estimation of local mean power in GSM-R networks The dynamic estimation algorithm for Rician fading channels in GSM-R networks is proposed, which is an expansion of local mean power estimation of Rayleigh fading channels. The proper length of statistical interval and required number of averaging samples are determined which are adaptive to different propagation environments. It takes advantage of signal samples and Rician fading parameters of last estimation to reduce measurement overhead. The performance of this method was evaluated by measurement experiments along BeijingShanghai high-speed railway. When it is NLOS propagation, the required sampling intervals can be increased from \(1.1{\lambda}\) in Lees method to \(3.7{\lambda}\) of the dynamic algorithm. The sampling intervals can be set up to \(12{\lambda}\) although the length of statistical intervals decrease when there is LOS signal, which can reduce the measurement overhead significantly. The algorithm can be applied in coverage assessment with lower measurement overhead, and in dynamic and adaptive allocation of wireless resource.

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

gsm-r
rician fading channel
local power estimation
propagation measurement


Voltage setup problem for embedded systems with multiple voltages We formulate the following voltage setup problem: how many levels and at which values should voltages be implemented on the system to achieve the maximum energy saving by dynamic voltage scaling (DVS)? This problem challenges whether DVS technique's full potential in energy saving can be reached on multiple voltage systems. In this paper, 1) we derive analytical solutions for dual-voltage system; 2) we develop efficient numerical methods for the general case where analytical solutions do not exist; 3) we demonstrate how to apply our proposed algorithms in system design; and 4) our experimental results suggest that, interestingly, multiple voltage systems with proper voltage setup can be very close to DVS technique's full potential in energy saving.

O O O O O O O O O O O O O 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 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 B I O O O O O O O O O O O O O O O O O

dynamic voltage scaling
multiple voltage


Evaluating the mid-term competitiveness of a, product in a semiconductor fabrication factory with a systematic procedure Yield is undoubtedly the most critical factor to the competitiveness of a product in a semiconductor fabrication plant. Therefore, evaluating the competitiveness of a product with its yield is a reasonable idea. For this purpose, a systematic procedure is established to evaluate the mid-term competitiveness of a product based on the yield learning model. Further, a new correction function is designed to incorporate expert opinions about the mid-term yield target to main the competitiveness of a product into Chen and Wang's fuzzy yield learning model. Such expert opinions are very valuable to controlling the yield learning process and have not been considered in traditional models. The modified model ought to be more practical and accurate than the original one. To evaluate the advantages or disadvantages of the proposed methodology, it is applied to the practical data of four products. Experimental results show that the proposed model outperforms the other models by reducing MAPE to only 2%. Besides, as the evaluated competitiveness decreases, the superiority of the proposed model becomes more evident. (c) 2007 Elsevier Ltd. All rights reserved.

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 B 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 O O O O B 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 B 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 O O O O O O O O O O O O O O O O O O O O O O O O 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

yield learning
semiconductor
competitiveness
correction function


The Stability of the Generalized Hopfield Networks in Randomly Asynchronous Mode We present a study on the stability of the generalized Hopfield network in randomly asynchronous mode. First, the stability is investigated from the state space of the network. We introduce a concept of hole and define two kinds of stability in randomly asynchronous mode. By mathematical inductive method, we have proved that a generalized Hopfield network with non negative weights is strictly stable, that is, the network evolves to a simple holestable state with probability one when it starts at any initial state. For the general case, we made the simulation experiments on the networks with the number of neurons from 5 to 10. The empirical results have shown that almost any generalized Hopfield network with simple holes is strictly stable. 1997 Elsevier Science Ltd.

O B O O O O O O O O O O O O O O O B O O O B I 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 B 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 B I O O O O O O O O O O


Theoretical description of hydrogen bonding in oxalic acid dimer and trimer based on the combined extended-transition-state energy decomposition analysis and natural orbitals for chemical valence (ETS-NOCV) In the present study we have analyzed hydrogen bonding in dimer and trimer of oxalic acid, based on a recently proposed charge and energy decomposition scheme (ETS-NOCV). In the case of a dimer, two conformations, alpha and beta, were considered. The deformation density contributions originating from NOCV's revealed that the formation of hydrogen bonding is associated with the electronic charge deformation in both the sigma-(Delta rho(sigma)) and pi-networks (Delta rho(pi)). It was demonstrated that sigma-donation is realized by electron transfer from the lone pair of oxygen on one monomer into the empty rho(H-O)*orbital of the second oxalic acid fragment. In addition, a covalent contribution is observed by the density transfer from hydrogen of H-O group in one oxalic acid monomer to the oxygen atom of the second fragment. The resonance assisted component (Delta rho(pi)), is based on the transfer of electron density from the pi-orbital localized on the oxygen of OH on one oxalic acid monomer to the oxygen atom of the other fragment. ETS-NOCV allowed to conclude that the sigma(O---HO) component is roughly eight times as important as pi (RAHB) contribution in terms of energetic estimation. The electrostatic factor (Delta E-elstat) is equally as important as orbital interaction term (Delta E-orb). Finally, comparing beta-dimer of oxalic acid with trimer we found practically no difference concerning each of the O-HO bonds, neither qualitative nor quantitative.

O O O O O O B I I I I O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

natural orbitals for chemical valence
oxalic acid dimer and trimer

ets-nocv
extended transition state
resonance assisted hydrogen bonds


Huddle hierarchy based group key management protocol using gray code Secure and reliable group communication is an active area of research. Its popularity is fuelled by the growing importance of group-oriented and collaborative applications. The central research challenge is secure and efficient group key management. The present paper is based on the huddle hierarchy based secure multicast group key management scheme using the most popular absolute encoder output type code named gray code. The focus is of twofolds. The first fold deals with the reduction of computation complexity which is achieved in this protocol by performing fewer multiplication operations during the key updating process. To optimize the number of multiplication operations, the fast Fourier transform, divide and conquer approach for multiplication of polynomial representation of integers, is used in this proposed work. The second fold aims at reducing the amount of information stored in the Group Center and group members while performing the update operation in the key content. Comparative analysis to illustrate the performance of various key distribution protocols is shown in this paper and it has been observed that this proposed algorithm reduces the computation and storage complexity significantly.

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 O O O 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 I I 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 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 B I O

multicast group key management
huddle hierarchy
fast fourier transform
gray code
computation complexity
storage complexity


A panorama on multiscale geometric representations, intertwining spatial, directional and frequency selectivity The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design of image representations, which trade off between efficiency and complexity, while achieving accurate rendering of smooth regions as well as reproducing faithful contours and textures. The most recent ones, proposed in the past decade, share a hybrid heritage highlighting the multiscale and oriented nature of edges and patterns in images. This paper presents a panorama of the aforementioned literature on decompositions in multiscale, multi-orientation bases or dictionaries. They typically exhibit redundancy to improve sparsity in the transformed domain and sometimes its invariance with respect to simple geometric deformations (translation, rotation). Oriented multiscale dictionaries extend traditional wavelet processing and may offer rotation invariance. Highly redundant dictionaries require specific algorithms to simplify the search for an efficient (sparse) representation. We also discuss the extension of multiscale geometric decompositions to non-Euclidean domains such as the sphere or arbitrary meshed surfaces. The etymology of panorama suggests an overview, based on a choice of partially overlapping pictures. We hope that this paper will contribute to the appreciation and apprehension of a stream of current research directions in image understanding.

O O O B B I 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 B O O O O O O O O O O O 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 B O B 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 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 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

multiscale
geometric representations
sparsity
redundancy
bases
edges
textures
image processing

review
oriented decompositions
scale-space
wavelets
atoms
frames
haar wavelet
non-euclidean wavelets