An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application tasks with dependences. These applications exhibit both task and data parallelism, and combining these two ( also called mixed parallelism) has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task and data parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the task graph, the runtime estimates and scalability characteristics of the tasks, and the intertask data communication volumes. A locality-conscious scheduling strategy is used to improve intertask data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications and synthetic graphs shows that our algorithm consistently generates schedules with a lower makespan as compared to Critical Path Reduction (CPR) and Critical Path and Allocation (CPA), two previously proposed scheduling algorithms. Our algorithm also produces schedules that have a lower makespan than pure task- and data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.

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

processor allocation
scheduling
mixed parallelism

data-flow graphs
locality-conscious scheduling


Applying gravitational search algorithm in the QoS-based Web service selection problem With the growing use of service-oriented architecture for designing next generation software systems, the service composition problem and its execution complexity have become even more important in responding to different user requests. The gravitational search algorithm is one of the latest heuristic algorithms. It has a number of distinguishing features, such as rapid convergence, lower memory usage, and the use of particular parameters, for instance, the distance between the solutions. In this paper, we propose a model for the optimization of the Web service composition problem based on qualitative measures and the gravitational search algorithm. To determine the efficacy of this proposed model we solve the problem with the particle swarm optimization algorithm for comparison. Simulation results show that the gravitational search algorithm has a high potential and substantial efficiency in finding the best combination of Web services.

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

gravitational search algorithm (gsa)
quality of service (qos)
ontology engineering


A FEM and FDM integrated approach for analysis of performance and characteristics of a converter A three-dimensional numerical model for a metal monolithic converter was developed to simulate its performance and analyze its characteristics. The employed numerical scheme incorporates the finite element method for analyzing heat conduction in solids of monolith substrate and the finite difference method for simulating physical and chemical phenomena in each of the monolith channels. Satisfactory solution is obtained by a convergent iteration between the FEM and the FDM modules at each time step. The fact that the simulation and measurement agree well verifies the validity of the three-dimensional model and the numerical approach used in this study.

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

finite element method
metal monolithic converter


NP-hardness of Euclidean sum-of-squares clustering A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al. (Mach. Learn. 56:9-33, 2004), is not valid. An alternate short proof is provided.

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


Situation Understanding Based on Heterogeneous Sensor Networks and Human-Inspired Favor Weak Fuzzy Logic System Humans use multiple sources of sensory information to estimate environmental properties and has innate ability to integrate information from heterogeneous data sources. How the multi-sensory and multimodal information are integrated in human brain? There is consensus that it depends on the prefrontal cortex (PFC). The PFC has top-down control (favor weak) and rule-based mechanisms, and we propose to incorporate the favor weak mechanism into rule-based fuzzy logic systems (FLS) via using upper and lower membership functions. The inference engine of favor weak fuzzy logic system is proposed under three different categories based on fuzzifiers. We observe that the favor weak FLS is a special type-1 FLS which is embeded in an interval type-2 FLS, so it's much simpler in computing than an interval type-2 FLS. We apply the favor weak FLS to situation understanding based on heterogeneous sensor network, and it shows that our favor weak fuzzy logic system has clear advantage comparing to the type-1 FLS. The favor weak FLS can increase the probability of threat detection, and provides timely indication & warning (I&W).

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

favor weak
fuzzy logic systems
heterogeneous sensor networks
situation understanding


Calculation of grey level co-occurrence matrix-based seismic attributes in three dimensions We develop a workflow for full 3D GLCM calculation. Based on the GLCM we calculate textural attributes and compare them to common seismic attributes. With the help of GLCM-based attributes we can highlight seismic facies. Facies features such as channels can be directly extracted as geobodies.

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

grey level co-occurrence matrix
seismic attributes


Using repair priorities to reduce stock investment in spare part networks In this paper, we examine the impact of repair priorities in spare part networks. Several heuristics for assigning priorities to items as well as optimising stock levels are developed, extending the well-known VARI-METRIC method. We model repair shops by multi-class, multi-server priority queues. A proper priority setting may lead to a significant reduction in the inventory investment required to attain a target system availability (usually 1020%). The saving opportunities are particularly high if the utilisation of the repair shops is high and if the item types sharing the same repair shop have clearly different characteristics (price, repair time). For example, we find an investment reduction of 73% for a system with single server repair shops with an utilisation of 0.90 that handle five different item types.

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


automated re-invention of six patented optical lens systems using genetic programming This paper describes how genetic programming was used as an invention machine to automatically synthesize complete designs for six optical lens systems that duplicated the functionality of previously patented lens systems. The automatic synthesis was done "from scratch"-that is, without starting from a pre-existing good design and without pre-specifying the number of lenses, the physical layout of the lenses, the numerical parameters of the lenses, or the non-numerical parameters of the lenses. One of the six genetically evolved lens systems infringed a previously issued patent; three contained many of the essential features of the patents, without infringing; and the others were non-infringing novel designs that duplicated (or improved upon) the performance specifications contained in the patents. One of the six patents was issued in the 21st-century. The six designs were created in a substantially similar and routine way, suggesting that the approach used may have widespread utility. The genetically evolved designs are instances of human-competitive results produced by genetic programming in the field of optical design.

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

invention machine
genetic programming
patents

human-competitive results
optical lens system
automated design


Effective Neural Network Ensemble Approach for Improving Generalization Performance This paper, with an aim at improving neural networks' generalization performance, proposes an effective neural network ensemble approach with two novel ideas. One is to apply neural networks' output sensitivity as a measure to evaluate neural networks' output diversity at the inputs near training samples so as to be able to select diverse individuals from a pool of well-trained neural networks; the other is to employ a learning mechanism to assign complementary weights for the combination of the selected individuals. Experimental results show that the proposed approach could construct a neural network ensemble with better generalization performance than that of each individual in the ensemble combining with all the other individuals, and than that of the ensembles with simply averaged weights.

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


Evaluating search engines A comparative study between international and Greek SE by Greek librarians Purpose - The use of search engines is the most widely acceptable way for information foraging on the net. Their wide use as an information retrieval tool has created the need for their evaluation as a means of improving their performance. This research attempts to record Greek librarians' views on search engines: their performance and characteristics. Design/methodology/approach - A total of 16 librarians were asked to search for a specific topic using eight search engines; four international (google.com, altavista.com, yahoo.com, exalead.com) and four Greek (google.gr (searching only for Greek text), in.gr, robby.gr, find.gr). Eight questionnaires were completed by each participant; one for every search engine. A total of 128 initial searches were performed by the librarians, followed by 86 further searches with changed search terms. The librarians recorded their experiences in retrieving information and evaluated the first 20 results according to the criteria of precision, relevancy of the retrieved records and the way the results were displayed by each search tool. Findings - Analysis of the results leads to conclusions about librarians' familiarity with search engines and their views on the retrieved information. The results indicated that participants were satisfied by the presentation, the visualization, the quality and value of results and they were very satisfied with the search engines' interfaces. Thus, most retrieved items were relevant and so the degree of precision was satisfactory. Users preferred mainly international search engines rather than Greek search engines. It was evident that most librarians were very satisfied with the performance of the search engines and felt that their queries had been answered successfully. Originality/value - The paper presents one of the few studies regarding international and Greek search engines and their use by librarians. The study gathered data with regard to the views of Greek librarians on the use of search engines and their characteristics. In addition, it recorded the attitude of librarians to both the search process and subsequent information retrieval, using Greek and international search engines. It compared different search engines and studied parameters like quality, precision, presentation and value of the search results. This research could form the basis of further study of librarians' behavior in the use of search engines for satisfying their information needs and comparison of information retrieval systems.

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

search engines
information retrieval systems
evaluation
greek librarians


teaching programming algorithms aided by computer graphics Effects of operations on abstract data objects are often difficult for students to comprehend. Visual models can be helpful to students, when the connections among the data object models, virtual machine representations of data objects, and algorithms operating on the data objects are made clear to the students. This paper discusses the design criteria used to develop a series of Pascal programs, implemented on widely used microcomputers, which make use of graphics to illustrate the effects of programming algorithms on common data structures. These programs were designed to be used in classroom demonstrations and by individual students working in the computing laboratory. 1 A non-machine specific design of an algorithm teacher is proposed. It is a programmed environment to help students in a beginning computer science course learn problem solving skills. This paper provides an overview of the problem, a motivation and justification, followed by a brief description of what the program should provide the student.

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

help
use
motivation
design
data structures
object
teaching
graphics
virtual machine
paper
student
computer science
program
data
algorithm
laboratory

computation
model
computer graphics
object model
visualization
environments
abstraction
operability
demonstrate
skill
learning
connection
microcomputer
effect


Evaluation of restoration techniques incorporating optimal principle in WDM optical networks Numerous researchers have proposed restoration techniques incorporating the concept of shortest disjoint paths in Wavelength Division Multiplexing (WDM) optical networks. The concept of shortest disjoint paths that obeys the strong optimal principle and the weak optimal principle is very important because shorter wavelength mileage including optical fiber distances is a dominant factor for the design of a survival WDM optical network. Even if restoration techniques incorporating the concept of shortest disjoint paths are faster, simpler, and easier than any other restoration techniques, we need to evaluate how well the concept of shortest disjoint paths is incorporated for the design of a survivable WDM optical network. In this paper, topology dependencies related to the concept of shortest disjoint paths are first developed. Then, seven objective functions that yield objective goals significant to the optimal design of a survivable WDM optical network are proposed and mathematically formulated. Finally, we develop ASDP (Near-Optimally Annealed k-Shortest Disjoint Path Restoration) and BBD (Branch-and-Bound with Dynamic Programming Principle) restoration algorithms that examine the proposed objective functions. Numerical results by experimenting ASDP and BBD algorithms show that the concept of shortest disjoint paths yields the best performance in terms of total and average restoration time. However, the concept of shortest disjoint paths does not seem to be an optimal technique in terms of significant optimal objective goals: minimal wavelengths, minimal wavelength link distance, minimal wavelength mileage costs, and even distribution of traffic flows. (C) 2005 Elsevier B.V. All rights reserved.

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

restoration
wdm
shortest disjoint paths
optimal principle


a control theory approach to throughput optimization in multi-channel collection sensor networks Most currently deployed sensor networks use the same channel to communicate information among nodes. This is a source of great inefficiency as it poorly utilizes the available wireless spectrum. This paper takes advantage of radio capabilities of MicaZ motes that can communicate on multiple frequencies as specified in the 802.15.4 standard. We consider the case of a data collection sensor network where multiple base-stations are responsible for draining data from sensor nodes. A key question becomes how to assign nodes to wireless channels such that network throughput is maximized. The problem is reduced to one of load balancing. A control theoretical approach is used to design a self-regulating load-balancing algorithm that maximizes total network throughput. It is evaluated both in simulation and on an experimental testbed. The results demonstrate a significant performance improvement. It is shown that a control theory approach is indeed needed to guarantee stability in data collection networks and prevent undue oscillation of nodes among different wireless channels upon dynamic changes in load conditions.

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

network
sensor
use
simulation
performance
control theory
design
throughput
case
paper
control
wireless
stability
capabilities
data collection
dynamic
testbed
data
load balancing
demonstrate
algorithm

communication
collect
sensor networks
standardization
informal
change
multi-channel
wireless sensor networks
mac
experimentation
optimality


A lattice computing approach to Alzheimers disease computer assisted diagnosis based on MRI data We present a Computer Assisted Diagnosis (CAD) system for Alzheimers disease (AD). The proposed CAD system employs MRI data features and applies a Lattice Computing (LC) scheme. To this end feature extraction methods are adopted from the literature, toward distinguishing healthy people from Alzheimer diseased ones. Computer assisted diagnosis is pursued by a k-NN classifier in the LC context by handling this task from two different perspectives. First, it performs dimensionality reduction over the high dimensional feature vectors and, second it classifies the subjects inside the lattice space by generating adaptively class boundaries. Computational experiments using a benchmark MRI dataset regarding AD patients demonstrate that the proposed classifier performs well comparatively to state-of-the-art classification models.

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

alzheimers disease
lattice computing
mri
classification


ISITRA: A generalized way of signal decomposition and reconstruction A new generalized way of signal decomposition and reconstruction entitled ISITRA is proposed. It is similar to the 2-channel filter bank scheme. In ISITRA, all the filters are obtained from a real vector. ISITRA allows decomposition of a signal into (1) an approximation and a detail, (2) two details and (3) two approximations. The latter two cases are not generally possible in the filter bank scheme. The choice of filter coefficients in ISITRA is much simpler and more arbitrary compared to that in the existing schemes. This allows one to find better filter coefficients for different applications. One can straight achieve an image compression ratio of 8:1 without doing any coding by modifying the range of pixel values in the decomposed components. One can also find a better set of decomposition and reconstruction filters than the commonly used Daubechies' wavelet filters of length 4. ISITRA is simpler and computationally marginally better than even the computationally efficient polyphase filter bank scheme.

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

perfect reconstruction
polyphase scheme
convolution
filter banks
wavelets
multi-resolution analysis


Applying traits to the smalltalk collection classes Traits are a programming language technology that promote the reuse of methods between unrelated classes. This paper reports on a refactoring of the Smalltalk collections classes using traits. The original collection classes contained much duplication of code; traits let us remove all of it. We also found places where the protocols of the collections lacked uniformity; traits allowed us to correct these non-uniformities without code duplication. Traits also make it possible to reuse fragments of collection code outside of the existing hierarchy; for example, they make it easy to convert other collection-like things into true collections. Our refactoring reduced the number of methods in the collection classes by approximately 10 per cent. More importantly, understandability maintainability and reusability of the code were significantly improved.

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

design
languages
mixins
collection hierarchy
stream classes
inheritance
multiple inheritance


an application of eda and ga to dynamic pricing E-commerce has transformed the way firms develop their pricing strategies, producing shift away from fixed pricing to dynamic pricing. In this paper, we use two different Estimation of distribution algorithms (EDAs), a Genetic Algorithm (GA) and a Simulated Annealing (SA) algorithm for solving two different dynamic pricing models. Promising results were obtained for an EDA confirming its suitability for resource management in the proposed model. Our analysis gives interesting insights into the application of population based optimization techniques for dynamic pricing.

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

estimation of distribution algorithms
resource management
dynamic pricing


Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints ? In a recent paper, the author and Curry solved the multidimensional knapsack problem with generalized upper bound constraints by a critical-event tabu-search method which navigates both sides of the feasibility boundary with varied depth of oscillations. Efforts were made to explore the solution space near the feasibility boundary by using local swaps according to the objective function values (the resulting solutions are referred to as simple trial solutions). In this paper, a specialized tight-oscillation process is launched to intensify the search when the previous method finds good solutions or simple trial solutions near the feasibility boundary. Both feasibility changes and objective-function value changes are incorporated into the choice of moves process. This paper demonstrates the merits of using different choice rules at different stages of the heuristic. The balance of intensification and diversification is achieved by using two levels of strategic oscillation approaches together with tabu memory at the main heuristic stage and the trial solution stage. With the tight oscillation method, the heuristic is able to find high-quality solutions very efficiently.

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

tabu search
strategic oscillation
multidimensional knapsack
generalized upper bound


dynamic native optimization of interpreters For domain specific languages, "scripting languages", dynamic languages, and for virtual machine-based languages, the most straightforward implementation strategy is to write an interpreter. A simple interpreter consists of a loop that fetches the next bytecode, dispatches to the routine handling that bytecode, then loops. There are many ways to improve upon this simple mechanism, but as long as the execution of the program is driven by a representation of the program other than as a stream of native instructions, there will be some "interpretive overhead".There is a long history of approaches to removing interpretive overhead from programming language implementations. In practice, what often happens is that, once an interpreted language becomes popular, pressure builds to improve performance until eventually a project is undertaken to implement a native Just In Time (JIT) compiler for the language. Implementing a JIT is usually a large effort, affects a significant part of the existing language implementation, and adds a significant amount of code and complexity to the overall code base.In this paper, we present an innovative approach that dynamically removes much of the interpreted overhead from language implementations, with minimal instrumentation of the original interpreter. While it does not give the performance improvements of hand-crafted native compilers, our system provides an appealing point on the language implementation spectrum.

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

point performance bytecode project paper representation minimal language dynamic code implementation complexity

innovating
streams
affect
script languages
instrument
virtual machine
practical
writing
domain-specific language
strategies
histories
systems
dynamic language
optimality
interpretation
instruction
compilation
programming language


Design and implementation of a bistable microcantilever actuator for magnetostatic latching relay This paper presents the design, fabrication, and implementation of a microcantilever actuator with magnetostatic latching for performing low power bistable relay applications. This unique bistable feature consists of a low-stiffness torsion/cantilever beam system with circular-shaped support and a permanent magnet for holding the closed state with a permalloy soft magnetic circuit. The special circular support is designed to enhance the stiffness of the overhang beams. First, mechanical modeling of the leveraged torsion/cantilever beams was performed by Castiglianos theorem so as to deduce the spring stiffness of system. Then the device has been prepared by a laminated photoresist sacrificial layer process (LPSLP). Finally, mechanical performance was characterized by atomic force microscopy (AFM), combined with finite element simulation using ANSYS package and analysis model as well. Switching between two stable states of the microactuator was successfully validated with WYKO NT1100 optical profiling system.

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

bistable mechanism
magnetostatic laching
mems


A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming ? In this paper, a class of finely discretized Semi-Infinite Programming (SIP) problems is discussed. Combining the idea of the norm-relaxed Method of Feasible Directions (MFD) and the technique of updating discretization index set, we present a new algorithm for solving the Discretized Semi-Infinite (DSI) problems from SIP. At each iteration, the iteration point is feasible for the discretized problem and an improved search direction is computed by solving only one direction finding subproblem, i.e., a quadratic program, and some appropriate constraints are chosen to reduce the computational cost. A high-order correction direction can be obtained by solving another quadratic programming subproblem with only equality constraints. Under weak conditions such as MangasarianFromovitz Constraint Qualification (MFCQ), the proposed algorithm possesses weak global convergence. Moreover, the superlinear convergence is obtained under Linearly Independent Constraint Qualification (LICQ) and other assumptions. In the end, some elementary numerical experiments are reported.

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

global convergence
superlinear convergence


Ranking procedures for matched pairs with missing data - Asymptotic theory and a small sample approximation Nonparametric methods for matched pairs with data missing completely at random are considered. It is not assumed that the observations are coming from distribution functions belonging to a certain parametric or semi-parametric family. In particular, the distributions can have different shapes under the null hypothesis. Hence, the so-called nonparametric Behrens-Fisher problem for matched pairs with missing data is considered. Moreover, a new approach for confidence intervals for nonparametric effects is presented. In particular, no restriction on the ratio of the number of complete and incomplete cases is required to derive the asymptotic results. Simulations show that for arbitrary settings of complete data and missing values, the resulting confidence intervals maintain the pre-assigned coverage probability quite accurately. Regarding the power, none of the proposed tests is uniformly superior to the other. A real data set illustrates the application. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

behrens-fisher problem
rank test
nonparametric hypothesis
ordered categorical data
ties
repeated measures design


Strategical languages of infinite words We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory. We first show the existence of a minimal strategy for such languages, for which we give an explicit expression. Then we characterize the family of strategical languages as that of closed ones, in the topological space of infinite words. Finally, we give a definition of a Nash equilibrium for such languages, that we illustrate with a famous example. (C) 2009 Elsevier B.V. All rights reserved.

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

words
game theory
strategy
nash equilibrium

infinite words
formal languages
topology


Assessing the authority of free online scholarly information Authority generally relates to expertise, recognition of official status of a source, and the reputation of the author and publisher. As the Internet has become a ubiquitous tool in modern science and scholarly research, evaluating the authority of free online scholarly information is becoming crucial. However, few empirical studies have focused on this issue. Using a modified version of Jim Kapouns Five criteria for evaluating web pages as framework, this research selected 32 keywords from eight disciplines, inputted them into three search engines (Google, Yahoo and AltaVista) and used Analytic Hierarchy Process to determine the weights. The first batches of results (web pages) from keyword searching were selected as evaluation samples (in the two search phases, the first 50 and 10 results were chosen, respectively), and a total of 3,134 samples were evaluated for authority based on the evaluation framework. The results show that the average authority value for free online scholarly information is about 3.63 (out of five), which is in the fair level (3?Z<4) (Z is the value assigned to each sample). About 41% of all samples collected provide more authoritative scholarly information. Different domain names, resource types, and disciplines of free online scholarly information perform differently when scored in terms of authority. In conclusion, the authority of free online scholarly information has been unsatisfactory, and needs to be improved. Furthermore, the evaluation framework and its application developed herein could be a useful instrument for librarians, researchers, students, and the public to select Internet resources.

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

free online scholarly information
authority


Multicore implementation of a fixed-complexity tree-search detector for MIMO communications Multicore systems allow the efficient implementation of signal processing algorithms for communication systems due to their high parallel processing capabilities. In this paper, we present a high-throughput multicore implementation of a fixed-complexity tree-search-based detector interesting for MIMO wireless communication systems. Experimental results confirm that this implementation allows to accelerate the data detection stage for different constellation sizes and number of subcarriers.

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


Avoiding the Rush Hours: WiFi Energy Management via Traffic Isolation WiFi continues to be a prime source of energy consumption in mobile devices. This paper observes that, despite a rich body of research in WiFi energy management, there is room for improvement. Our key finding is that WiFi energy optimizations have conventionally been designed with a single AP in mind. However, network contention among different APs can dramatically increase a client's energy consumption. Each client may have to keep awake for long durations before its own AP gets a chance to send it packets to it. As AP density increases, the waiting time inflates, resulting in a proportional decrease in battery life. We design SleepWell, a system that achieves energy efficiency by evading network contention. The APs regulate the sleeping window of their clients in a way that different APs are active/inactive during nonoverlapping time windows. The solution is analogous to the common wisdom of going late to office and coming back late, thereby avoiding the rush hours. We implement SleepWell on a testbed of eight Laptops and nine Android phones, and evaluate it over a wide variety of scenarios and traffic patterns. Results show a median gain of up to 2x when WiFi links are strong; when links are weak and the network density is high, the gains can be even more.

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

mobile communication systems
wireless communication


A memetic algorithm for the Multi Trip Vehicle Routing Problem A split procedure for the mutli trip vehicle routing problem is proposed. A new tailored local search operator is introduced. Results outperform previous works with respect to solution quality.

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

multi trip vehicle routing problem
memetic algorithm


detailed cache simulation for detecting bottleneck, miss reason and optimization potentialities Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the side of programmers or compilers with code level optimization or at system level through appropriate schemes, like reconfigurable cache organization and adequate prefetching or replacement strategies. For the former users need to know the problem, the reason, and the solution, while for the latter a platform is required for evaluating proposed and novel approaches.As existing simulation systems do not provide such information and platforms, we implemented a cache simulator that models the complete cache hierarchy and associated techniques. More specifically, it analyzes the feature of cache miss and provides information about the runtime accesses to data structures and the cache access behavior. Together with a visualization tool, this information enables the user to detect access hotspots and optimization strategies for tackling them. For supporting the study of different techniques with respect to cache configuration and management, this simulator models a variety of cache line replacement and prefetching policies, and allows the user to specify any cache organization, including cache size, cache set size, block size, and associativity. The simulator hence forms a research platform for investigating the influence of these techniques on the execution behavior of applications.

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

code optimization
performance visualization


Aggressive incidents inside a Montreal barroom involving patrons, barmaids and bouncers: A micro level examination of routine activity theory This article further examines the phenomenon of aggression inside barrooms by relying on the bouncer-ethnographer methodology. The objective is to investigate variations in aggression through time and space according to the role and routine of the target in a Montreal barroom. Thus, it provides an examination of routine activity theory at the micro level: the barroom.

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

aggressive incidents
barroom
routine activity

aggressive incidents inside a montreal barroom involving patrons

barmaids and bouncers: a micro level examination of routine activity theory


visible or invisible links? This paper reports on experimental research that compares two interfaces in software designed for foreign language reading: one with visible and one with invisible links. The links lead to dictionary definitions and translations. The study focussed on differences in consulting behaviour, learning outcomes (vocabulary and comprehension) and on a possible interaction effect of condition and task. The results indicate that the two interfaces mainly differ in the users' willingness to consult the additional information. Differences in learning outcomes and a combined effect of condition and task could not be established.

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

signalling-mode of glosses
language learning
interface design
online reading


Cultural determinants of media choice for deception In todays business environment, deception is commonplace (Blumberg, 1989andRuane et al., 1994). Historically, individuals were limited in their media options, however recent technological advances have given individuals more ways in which to communicate and deceive. The use of these new media change the communication dynamic substantially. Previous studies have found that deception detection differs across media, as media vary in their ability to transmit cues, convey emotion and reversibility, among others. Researchers are beginning to understand the dynamics between media characteristics, individual characteristics and media choice in a deceptive communication context. Not only is deception commonplace in todays multicultural business environment, communication participants can come from a variety of cultural backgrounds. Taking this into account, the current study seeks to use media synchrony theory to derive a model of media choice based on an individuals espoused national culture. In this study a scenario-based media choice task was given to subjects in the United States and China, and the results indicate that espoused national culture does influence media choice for deception. Specifically, individuals who scored highly on collectivism preferred to lie using text-based media, individuals who scored high on power distance preferred to lie using audio media and individuals who scored high on masculinity preferred to lie using visual media. Implications for research and practitioners are discussed.

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

media synchrony
espoused national culture
deception


modeling search response time Modeling the response time of search engines is an important task for many applications such as resource selection in federated text search. Limited research has been conducted to address this task. Prior research calculated the search response time of all queries in the same way either with the average response time of several sample queries or with a single probability distribution, which is irrelevant to the characteristics of queries. However, the search response time may vary a lot for different types of queries. This paper proposes a novel query-specific and source-specific approach to model search response time. Some training data is acquired by measuring the search response time of some sample queries from a search engine. Then, a query-specific model is estimated with the training data and their corresponding response times by utilizing Ridge Regression. The obtained model can be used to predict search response times for new queries. A set of empirical studies are conducted to show the effectiveness of the proposed method.

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


The buffer tree: A technique for designing batched external data structures We present a technique for designing external memory data structures that support batched operations I/O efficiently. We show how the technique can be used to develop external versions,of a search tree, a priority queue, and a segment tree, and give examples of how these structures can be used to develop I/O-efficient algorithms. The developed algorithms are either extremely simple or straightforward generalizations of known internal memory algorithms-given the developed external data structures.

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

batched external data structures
buffer tree

i/o efficiency
internal memory algorithms


refining image annotation using contextual relations between words In this paper, we present a probabilistic approach to refine image annotations by incorporating semantic relations between annotation words. Our approach firstly predicts a candidate set of annotation words with confidence scores. This is achieved by the relevance vector machine (RVM), which is a kernel based probabilistic classifier in order to cope with nonlinear classification. Given the candidate annotations, we model semantic relationships between words using a conditional random field (CRF) model where each vertex indicates the final decision (true / false) on a candidate annotation word. The refined annotation is given by inferring the most likely states of these vertexes. In the CRF model, we consider the confidence scores given by the RVM classifiers as local evidences. In addition, we utilise Normalized Google distances (NGD's) between two words as their contextual potential. NGD is a distance function between two words obtained by searching a pair of words using the Google search engine. It has a simple mathematical formulation with a foundation in Kolmogorov theory. We also propose a learning algorithm to tune the weight parameters in the CRF model. These weight parameters control the balance between the local evidence of a single word and the contextual relation between words. Our experiments on the Corel images demonstrate the effect of our approach.

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

semantic relation
normalized google distance


Effects of Facial Similarity on User Responses to Embodied Agents We investigated the effects of facial similarity between users and embodied agents under different experimental conditions. Sixty-four undergraduates interacted with two different embodied agents: in one case the agent was designed to look somewhat similar to the user, and in the other case the agent was designed to look dissimilar. We varied between subjects how helpful the agent was for a given task. Results showed that the facial similarity manipulation sometimes affected participants' responses, even though they did not consciously detect the similarity. Specifically, when the agent was helpful, facial similarity increased participantsi ratings of involvement. However, when exposed to unhelpful agents, male participants had negative responses to the similar-looking agent compared to the dissimilar one. These results suggest that using facially similar embodied agents has a potential large downside if that embodied agent is perceived to be unhelpful.

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

engagement with embodied agents
use intentions
i-pefic model
3d morphing


a numeric-controlled formatter Most existing formatters in APL systems use a character vector control argument to achieve flexibility. A formatter is described which uses a numeric control argument for ease of use, and yet provides a high degree of flexibility.

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

flexibility character use systems argument control


Adaptive molecular docking method based on information entropy genetic algorithm We present a coefficient adaptive scoring function of molecular docking. This function improves the docking accuracy greatly. Genetic algorithm with the multi-population evolution and entropy-based. It is based on force-field scoring, using empirical-based and knowledge-based scoring as other scoring factors.

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

molecular docking
genetic algorithm
information entropy


IDOAKE: strongly secure ID-based one-pass authenticated key exchange protocol ID-based one-pass authenticated key exchange protocol allows the sender Alice to generate a session key without interacting with receiver Bob. As a result, it is better suitable for some application scenarios than the two-pass counterpart. However, currently there are few ID-based one-pass authenticated key exchange protocols with a security proof in a formal model. The paper investigates the ID-based one-pass authenticated key exchange protocol in the enhanced Canetti-Krawczyk (eCK) model. We propose a new ID-based one-pass authenticated key exchange protocol IDOAKE, which is shown secure under Bilinear Diffie-Hellman (BDH) assumption in the eCK model. To the best of our knowledge, our protocol is the first provably secure ID-based one-pass authenticated key exchange in the eCK model. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

id-based
one-pass authenticated key exchange
trapdoor test technique


Backup agreements with penalty scheme under supply disruptions This article considers a supply chain for a single product involving one retailer and two independent suppliers, when the main supplier might fail to supply the products, the backup supplier can always supply the products at a higher price. The retailer could use the backup supplier as a regular provider or a stand-by source by reserving some products at the supplier. A backup agreement with penalty scheme is constructed between the retailer and the backup supplier to mitigate the supply disruptions and the demand uncertainty. The expected profit functions and the optimal decisions of the two players are derived through a sequential optimisation process. Then, the sensitivity of two players' expected profits to various input factors is examined through numerical examples. The impacts of the disruption probability and the demand uncertainty on the backup agreement are also investigated, which could provide guideline for how to use each sourcing method.

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

backup agreements
penalty scheme
supply disruptions


The use of artificial neural network to predict exergetic performance of spray drying process: A preliminary study A feedforward artificial neural network (ANN) was applied to predict the exergetic performance of a microencapsulation process via spray drying. The exergetic data was obtained from drying experiments conducted at different inlet drying air temperatures, aspirator rates (drying air flow rates), peristaltic pump rates (mass flow rates), and spraying air flow rates as inputs for ANN. A multilayer perceptron (MLP) ANN was utilized to correlate the output parameters (inlet exergy, outlet exergy, lost exergy, destructed exergy, entropy generation, exergy efficiency, and improvement potential rate) to the four inputs parameters. Various error minimization algorithms, transfer functions, number of hidden neurons, and training epochs were investigated to find the optimum ANN model. The MLP ANN with Levenberg-Marquardt error minimization algorithm, logarithmic sigmoid transfer function, 20 hidden neurons, and 100 training iterations was selected as the best topology to map the exergetic performance of microencapsulation process according to statistical parameters and model simplicity. The model predicted exergetic parameters of spray drying process with R2 values greater than 0.98 indicating the fidelity of the selected network. Accordingly, the selected ANN model can be applied to determine the exergy efficient drying conditions to achieve a sustainable spray drying process.

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

exergetic performance
spray drying process

artificial neural network (ann)
multilayer perceptron (mlp)


Plattformen Eine Einfhrung Plattformen spielen in der IT eine immer wichtigere Rolle. Gleichzeitig ist das Verstndnis des Plattformbegriffs sehr heterogen undoftmals bedingt durch die Anwendungsdomne selbst vielschichtig. Plattformen sind Motor fr technische Innovationen, erleichtern strukturiertes Vorgehen in der Entwicklung und erffnen zahlreiche neue Mglichkeiten fr die Realisierung von Geschftsmodellen. Der Beitrag systematisiert zunchst den Plattformbegriff, indem er ein Ebenen-Modell einfhrt und auf dieser Basis Eigenschaften und mgliche Anwendungsszenarienerlutert. Die Tragfhigkeit des Modells wird abschlieend durch eine Literaturstudie berprft, die gleichzeitig auch einen Blick auf die in der Literatur hauptschlich beschriebenen Anwendungsfelder wirft.

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

plattform
plattformneutralitt
transparenz
embedded system
laufzeitumgebung
entwicklungsumgebung
anwendungssystem
geschftsmodell


Survival functions for the frailty models based on the discrete compound Poisson process Frailty models are often used to model heterogeneity in survival analysis. The distribution of the frailty is generally assumed to be continuous. In some circumstances, it is appropriate to consider discrete frailty distributions. Having zero frailty can be interpreted as being immune, and population heterogeneity may be analysed using discrete frailty models. In this paper, survival functions are derived for the frailty models based on the discrete compound Poisson process. Maximum likelihood estimation procedures for the parameters are studied. We examine the fit of the models to earthquake and the traffic accidents' data sets from Turkey.

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

infinitely divisible distributions
stable distributions
censored data models
compound poisson distribution


Fast algorithms for determining the linear complexity of sequences over GF (p(m)) with period 2(t)n We prove a result which reduces the computation of the linear complexity of a sequence over GF (p(m)) (p is an odd prime) with period 2n (n is a positive integer such that there exists an element b is an element of GF (p(m)), b(n) = -1) to the computation of the linear complexities of two sequences with period n. By combining with some known algorithms such as the Berlekamp-Massey algorithm and the Games-Chan algorithm we can determine the linear complexity of any sequence over GF (p(m)) with period 2(t)n (such that 2(t)vertical bar p(m) - 1 and gcd(n, p(m) - 1) = 1) more efficiently.

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

berlekamp-massey algorithm
cryptography
games-chan algorithm
stream cipher


An Algorithm to Form Balanced and Diverse Groups of Students We share the details of a simple algorithm which groups students based on diversity in gender and race while keeping the group average CGPA nearly equal. Application on simulated and actual class profiles gave multiple-feasible solutions within seconds, with a maximum absolute deviation in group average CGPA of 0.03/4.00 or lower. (C) 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 19: 582-590, 2011; View this article online at wileyonlinelibrary.com/journal/cae; DOI 10.1002/cae.20338

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

grouping algorithm
student grouping
balanced groups


enhanced wireless roaming security using three-party authentication and tunnels Many organizations and many home users have deployed WiFi networks permitting external users to connect to the Internet through their networks. Such WiFi sharing poses many security risks for the visited network as well as for the visiting user. In this paper, we focus on the recently introduced concept for tunneled WiFi roaming in which the infrastructure of the visited network is considered as part of the security architecture. A secure layer-2 tunneling between the user's device and his home network is performed by the visited network only after the successful authentication of all three parties. The authentication protocol provides the mobile device and its home network with a secret key that protects their end-to-end communication. Additionally, it provides another tunnel key, shared with the visited network, that protects the actual traffic exchanged between the visited and home networks and prevents diverse resource consumption attacks against the latter. This concept encourages users to provide roaming service in a more secure and privacy-friendly way. We show how to implement this concept using the IEEE802.11i/EAP framework, based on existing infrastructures and standard tunneling protocols.

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


A FORTRAN-90 Low-Energy Electron Diffraction program (LEED90 v1.1) We describe a FORTRAN-90 program to compute low-energy electron diffraction I(V) curves. Plane-waves and layer doubling are used to compute the inter-layer multiple-scattering, while the intra-layer multiple-scattering is computed in the standard way expanding the wavefield on a basis of spherical waves. The program is kept as general as possible, in order to allow testing different parts of multiple-scattering calculations. In particular, it can handle non-diagonal t-matrices describing the scattering of non-spherical potentials, anisotropic vibrations, anharmonicity, etc. The program does not use old FORTRAN flavours, and has been written keeping in mind the advantage for parallelism brought forward by FORTRAN-90.

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

low-energy electron diffraction
multiple-scattering
full dynamical theory
layer-doubting
molecular t-matrix
anisotropic/anharmonic vibrations
non-diagonal t-matrix


Discrete-time control for rectangular hybrid automata Rectangular hybrid automata model digital control programs of analog plant environments. We study rectangular hybrid automata where the plant state evolves continuously in real-numbered time, and the controller samples the plant state and changes the control state discretely, only at the integer points in time. We prove that rectangular hybrid automata have finite bisimilarity quotients when all control transitions happen at integer times, even if the constraints on the derivatives of the variables vary between control states. This is in contrast with the conventional model where control transitions may happen at any real time, and already the reachability problem is undecidable. Based on the finite bisimilarity quotients, we give an exponential algorithm for the symbolic sampling-controller synthesis of rectangular automata. We show our algorithm to be optimal by proving the problem to be EXPTIME-hard. We also show that rectangular automata form a maximal class of systems for which the sampling-controller synthesis problem can be solved algorithmically. (C) 1999 Published by Elsevier Science B.V. All rights reserved.

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

hybrid systems
computer-aided verification
controller synthesis


a high-level register optimization technique for minimizing leakage and dynamic power A large fraction of the total power dissipated in a digital circuit is consumed by the clocked elements in the data-path. Hence, savings in power usage of these components can be directly reflected in a circuit's overall power consumption. Reducing power through techniques that optimize power consumption in combinational elements has been extensively discussed in the existing literature. However, these techniques cannot be applied for reducing the power in sequential elements. In this work, we focus on this problem, and introduce a novel cluster-based register optimization technique that is employed in High-Level Synthesis (HLS) with Power Islands. Our experiments conducted on several synthesis benchmarks implemented at the transistor level using a 65 nm process technology showed anaverage reduction of 18\% in total power consumption due to our technique with no or little area overhead.

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

leakage
hls
register optimization
power islands


Periodic review, push inventory policies for remanufacturing Sustainability has become a major issue in most economies, causing many leading companies to focus on product recovery and reverse logistics. This research is focused on product recovery, and in particular on production control and inventory management in the remanufacturing context. We study a remanufacturing facility that receives a stream of returned products according to a Poisson process. Demand is uncertain and also follows a Poisson process. The decision problems for the remanufacturing facility are when to release returned products to the remanufacturing line and how many new products to manufacture. We assume that remanufactured products are as good as new. In this paper, we employ a push policy that combines these two decisions. It is well known that the optimal policy parameters are difficult to find analytically; therefore, we develop several heuristics based on traditional inventory models. We also investigate the performance of the system as a function of return rates, backorder costs and manufacturing and remanufacturing lead times; and we develop approximate lower and upper bounds on the optimal solution. We illustrate and explain some counter-intuitive results and we test the performance of the heuristics on a set of sample problems. We find that the average error of the heuristics is quite low.

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

inventory
remanufacturing
heuristics
reverse logistics


D-Separation and computation of probability distributions in Bayesian networks Consider a family (X(i))(i is an element of I) of random variables endowed with the structure of a Bayesian network, and a subset S of I. This paper examines the problem of computing the probability distribution of the subfamily (X(a))(a is an element of S) (respectively the probability distribution of (X(b))(b is an element of(S) over bar), where (S) over bar = I - S, conditional on (X(a))(a is an element of S)). This paper presents some theoretical results that makes it possible to compute joint and conditional probabilities over a subset of variables by computing over separate components. In other words, it is demonstrated that it is possible to decompose this task into several parallel computations, each related to a subset of S (respectively of (s) over bar); these partial results are then put together as a final product. In computing the probability distribution over (X(a))(a is an element of S), this procedure results in the production of a structure of level two Bayesian network structure for S.

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

level two bayesian networks
d-separation
close descendants


Blackboard architecture to integrate components and agents in heterogeneous distributed eLearning systems: An application for learning to program To build complete and complex eLearning systems, eLearning engineers are used to applying standards that facilitate sharing information as well as distributed service-oriented architectures that provide reuse and interoperability by means of component integration. These concepts lead us to a Component-based Development Process that will allow us to implement tools that give full support to the teaching/learning process, taking advantage of the synergy effect created by the integration of the different components. Thus, throughout this article we analyse the proposals from the most relevant consortia concerned with eLearning standards, showing their service oriented approaches and the middleware technologies which can be used to implement them. This analysis will demonstrate that the use of middleware technologies that use the definition of services interface can limit the reuse and interoperability requisites desired by the main standards consortia. Then, we will show a proposal which tries to solve this shortfall, using a blackboard-based architecture for integrating and communicating heterogeneous distributed components, as well as a user environment that also allows us to perform component integration. As an example, we will demonstrate how we have built an application for learning to program by applying our approach and following a Component-based Development Process to implement different components (services, agents, clients, etc.) that integrate it. Hence, we will argue that using blackboard architecture and a Component-based Development Process helps us to solve the identified shortcomings.

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

eclipse
tuple-spaces
component-based development


Conservative high-order finite-difference schemes for low-Mach number flows Three finite-difference algorithms are proposed to solve a low-Mach number approximation for the Navier-Stokes equations. These algorithms exhibit fourth-order spatial and second-order temporal accuracy. They are dissipation-free, and thus well suited for DNS and LES of turbulent flows. The key ingredient common to each of the methods presented is a Poisson equation with variable coefficient that is solved for the hydrodynamic pressure. This feature ensures that the velocity field is constrained correctly. It is shown that this approach is needed to avoid violation of the conservation of kinetic energy in the inviscid limit which would otherwise arise through the pressure term in the momentum equation. An existing set of finite-difference formulae for incompressible flow is generalized to handle arbitrary large density fluctuations with no violation of conservation through the non-linear convective terms. An algorithm which conserves mass, momentum, and kinetic energy fully is obtained when an approximate equation of state is used instead of the exact one. Results from a model problem are used to show both spatial and temporal convergence rates and several test cases are presented to illustrate the performance of the algorithms. (C) 2000 Academic Press.

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

low-mach number
finite difference
staggered mesh
density gradient
conservative scheme


Integrating transcriptional and protein interaction networks to prioritize condition-specific master regulators Genome-wide libraries of yeast deletion strains have been used to screen for genes that drive phenotypes such as stress response. A surprising observation emerging from these studies is that the genes with the largest changes in mRNA expression during a state transition are not those that drive that transition. Here, we show that integrating gene expression data with context-independent protein interaction networks can help prioritize master regulators that drive biological phenotypes.

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

network modeling
gene regulation
regulatory networks
cancer


An integrated algorithm for cutting stock problems in the thin-film transistor liquid crystal display industry The cutting stock problem (CSP) is a critical issue in the manufacturing of thin film transistor liquid crystal display (TFT-LCD) products. Two manufacturing processes are utilized in this industry: (1) various TFT-LCD plates are cut from a glass substrate based on cutting patterns, and (2) the number of glass substrates required to satisfy customer requirements is minimized. The current algorithm used to select the cutting pattern is defined as a mixed integer program (MIP). Although the current MIP method yields an optimal solution, but the computation time is unacceptable when the problem scale is large. To accelerate the computation and improve the current method, this study proposes an integrated algorithm that incorporates a genetic algorithm, a corner arrangement method, and a production plan model to solve CSPs in the TFT-LCD industry. The results of numerical experiments demonstrate that the proposed algorithm is significantly more efficient than the current method, especially when applied to large-scale problems. (C) 2013 Elsevier Ltd. All rights reserved.

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

cutting stock problem
mip
genetic algorithm
corner arrangement
production plan


A review of smart homesPresent state and future challenges In the era of information technology, the elderly and disabled can be monitored with numerous intelligent devices. Sensors can be implanted into their home for continuous mobility assistance and non-obtrusive disease prevention. Modern sensor-embedded houses, or smart houses, cannot only assist people with reduced physical functions but help resolve the social isolation they face. They are capable of providing assistance without limiting or disturbing the resident's daily routine, giving him or her greater comfort, pleasure, and well-being. This article presents an international selection of leading smart home projects, as well as the associated technologies of wearable/implantable monitoring systems and assistive robotics. The latter are often designed as components of the larger smart home environment. The paper will conclude by discussing future challenges of the domain.

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


TAIR: Testability analysis by implication reasoning To predict the difficulty of testing a wire stuck-at fault, testability analysis algorithms provide an estimated testability value by computing controllability and observability, In most common previous work such as COP and SCOAP, signal correlation between controllability and observability is not well handled. As a result, the estimated values can he quite inaccurate. On the other hand, some previous work can take into account signal correlation but may require more CPU time. This paper discusses an efficient method for testability analysis improvement. Our algorithm starts with results obtained from conventional testability analysis such as COP. For each stuck- at fault, we gradually refine these results by recursively applying some simple signal correlation rules. Experimental results show that, with reasonable run-time overhead, significant improvement for testability analysis can be achieved.

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

cop implication scoap testability testing


Research on social relations cognitive model of mobile nodes in Internet of Things Interaction and communication between humans with smart mobile devices are a new trend of development in Internet of Things (IoT). With the powerful sensing capability of smart device and human mobility, various services could be provided by building a trusted chain between service requesters and suppliers. The cognition of social relations between mobile nodes is the basis of final mobile-aware services. It involves many decision factors, such as time, space and activity patterns. Using social network theory, a new cognitive model for social relations of mobile nodes in IoT is proposed. Firstly, nodes' social relations are reasoned and quantified from multiple perspectives based on the summary of social characteristics of mobile nodes and the definition of different decision factors. Then the location factor, interconnection factor, service evaluation factor and feedback aggregation factor are defined to solve the shortcomings in existing quantitative models. Finally, the weight distribution is set up by information entropy and rough set theory for these decision factors; it can overcome the shortage of traditional methods, in which the weight is set up by subjective ways and hence their dynamic adaptability is poor. We compare our cognitive model to existing models using MIT dataset by defining a variety of test indicators, such as network overall density (NOD), the degree center potential (DCP), the network distribution index (EI), etc. Simulation results show that, the cognitive model has better internal structure and significant validity in network analysis, and thus can provide mobile-aware service effectively in dynamic environment.

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

internet of things
social relations
cognitive model
decision factors


An approach to implement data fusion techniques in wireless sensor networks using genetic machine learning algorithms Wireless Sensor Networks (WSNs) can be used to monitor hazardous and inaccessible areas. In these situations, the power supply (e.g. battery) of each node cannot be easily replaced. One solution to deal with the limited capacity of current power supplies is to deploy a large number of sensor nodes, since the lifetime and dependability of the network will increase through cooperation among nodes. Applications on WSN may also have other concerns, such as meeting temporal deadlines on message transmissions and maximizing the quality of information. Data fusion is a well-known technique that can be useful for the enhancement of data quality and for the maximization of WSN lifetime. In this paper, we propose an approach that allows the implementation of parallel data fusion techniques in IEEE 802.15.4 networks. One of the main advantages of the proposed approach is that it enables a trade-off between different user-defined metrics through the use of a genetic machine learning algorithm. Simulations and field experiments performed in different communication scenarios highlight significant improvements when compared with, for instance, the Gur Game approach or the implementation of conventional periodic communication techniques over IEEE 802.15.4 networks. (C) 2013 Elsevier B.V. All rights reserved.

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

partial data fusion
autonomic computing
classifier systems


Three-dimensional quantitative structure-activity relationship (3D QSAR) and pharmacophore elucidation of tetrahydropyran derivatives as serotonin and norepinephrine transporter inhibitors Three-dimensional quantitative structure-activity relationship (3D QSAR) using comparative molecular field analysis (CoMFA) was performed on a series of substituted tetrahydropyran (THP) derivatives possessing serotonin (SERT) and norepinephrine (NET) transporter inhibitory activities. The study aimed to rationalize the potency of these inhibitors for SERT and NET as well as the observed selectivity differences for NET over SERT. The dataset consisted of 29 molecules, of which 23 molecules were used as the training set for deriving CoMFA models for SERT and NET uptake inhibitory activities. Superimpositions were performed using atom-based fitting and 3-point pharmacophore-based alignment. Two charge calculation methods, Gasteiger-Hukel and semiempirical PM3, were tried. Both alignment methods were analyzed in terms of their predictive abilities and produced comparable results with high internal and external predictivities. The models obtained using the 3-point pharmacophore-based alignment outperformed the models with atom-based fitting in terms of relevant statistics and interpretability of the generated contour maps. Steric fields dominated electrostatic fields in terms of contribution. The selectivity analysis (NET over SERT), though yielded models with good internal predictivity, showed very poor external test set predictions. The analysis was repeated with 24 molecules after systematically excluding so-called outliers (5 out of 29) from the model derivation process. The resulting CoMFA model using the atom-based fitting exhibited good statistics and was able to explain most of the selectivity (NET over SERT)-discriminating factors. The presence of -OH substituent on the THP ring was found to be one of the most important factors governing the NET selectivity over SERT. Thus, a 4-point NET-selective pharmacophore, after introducing this newly found H-bond donor/acceptor feature in addition to the initial 3-point pharmacophore, was proposed.

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


organizing rushes video by visually similar setting Grouping shots recorded in front of the same or similar setting is a useful tool for organizing a collection of rushes video. We propose an approach that clusters key frames extracted from rushes by visual similarity of the setting shown in the shot. A region descriptor based on the covariance of selected features is used to estimate the dissimilarity of two key frames. The metric based on the generalized eigenvalues is used to determine the distance of two region covariance matrices. Integral images support efficient covariance computation of arbitrary rectangular regions. Based on the determined similarity of image regions, a dissimilarity matrix of all key frames is calculated. This dissimilarity matrix is used to build the clusters which reflect the different settings. The proposed algorithm is evaluated on a subset of the TRECVID BBC 2007 rushes data set.

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

content-based indexing
multidimensional scaling
k-means
setting detection
clustering


Mimetic finite difference methods for diffusion equations on non-orthogonal non-conformal meshes ? Mimetic discretizations based on the support-operators methodology are derived for non-orthogonal locally refined quadrilateral meshes. The second-order convergence rate on non-smooth meshes is verified with numerical examples.

O O O O O O O O O O O O O O O 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 Fragile Digital Image Authentication Scheme Inspired by Wet Paper Codes Image authentication is an important research topic of maintaining the integrity of digital image contents. Fragile image authentication is the technique for achieving the goal of image content integrity maintenance. This article presents a fragile image authentication scheme based on the concept of wet paper codes. The proposed scheme modifies dry pixels on an image to conceal an image signature. The proposed authentication scheme can exactly detect the tampered area on a tampered image. For saving computation cost of signature embedding, an exclusive-or operation is used in the proposed authentication scheme. The experimental results show that the proposed method not only has good visual quality of an authorized image but also successfully detects tampered areas on a tampered image.

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

image authentication
signature
wet paper codes


multiband rf-interconnect for reconfigurable network-on-chip communications One of the key benefits of the scaling of CMOS is that the switching speed of the transistor improves over each technology generation. According to ITRS, fT and fmax, will be 600GHz and 1 THz, respectively, in 16nm CMOS technology. With the advance in CMOS mm-wave circuits, hundreds of GHz bandwidth will be available in the near future. In addition, compared with CMOS repeaters charging and discharging the wire, EM waves travel in a guided medium at the speed of light which is about 10ps/mm on silicon substrate. The question here is: How can we utilize over hundreds of GHz of bandwidth in a future mobile system through RF-I while concurrently achieving ultra-low power operation and dynamic allocation in bandwidth to meet future Network-on-Chip needs?

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

rf-interconnect
network-on-chip
fdma
morfic
chip multiprocessor


on extending the functions of a relational database system Relational database systems are attracting great interest from potential users outside the traditional areas in which such systems have been employed. Features of modern relational systems such as powerful query facilities, data and device independence, concurrency control, and recovery are useful in applications such as engineering design, office automation, and graphics. However, such applications place demands on the system that it must be extended to handle. This paper identifies three of these demands: storing non-coded information of arbitrary length within the database, dealing with aggregate objects as a unit, and improving support for interactive access. Additions to System R, a prototypical relational system, are introduced to satisfy these demands: long fields, for storing non-coded data, and complex objects, which declare the semantic relationships among data items and provide a means for adequately supporting interactive access.

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

place
applications
recovery
relationships
systems
users
semantic
aggregate
concurrency control
design
data
support
graphics
access
paper
database
automation
query

interaction
engine
object
relation
feature
informal
relational database
device-independence


An EM algorithm for shape classification based on level sets ? In this paper, we propose an expectation-maximization (EM) approach to separate a shape database into different shape classes, while simultaneously estimating the shape contours that best exemplify each of the different shape classes. We begin our formulation by employing the level set function as the shape descriptor. Next, for each shape class we assume that there exists an unknown underlying level set function whose zero level set describes the contour that best represents the shapes within that shape class. The level set function for each example shape in the database is modeled as a noisy measurement of the appropriate shape classs unknown underlying level set function. Based on this measurement model and the judicious introduction of the class labels as the hidden data, our EM formulation calculates the labels for shape classification and estimates the shape contours that best typify the different shape classes. This resulting iterative algorithm is computationally efficient, simple, and accurate. We demonstrate the utility and performance of this algorithm by applying it to two medical applications.

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

shape estimation
level set methods
computer-aided diagnosis


Late 18th-Century French Encrypted Diplomatic "Letters of Recommendation"-Or, How to Unwittingly Carry Your Own Warrant This article presents a cryptographic method that Count Vergennes, Minister of the Interior of Louis XVI of France, used and refined in communication between the diplomatic representations abroad and Paris. After the visa applicants' initial interview (and secret investigation of their backgrounds), they were given an ingeniously encoded "Letter of Recommendation'' in the form of a personalized "Carte de Visite'' (calling card) when they picked up such permits, which were, in turn, decoded by the count himself upon presentation at the Ministry. Vergennes could then keep such visitors under surveillance during their sojourn in France.

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

late 18th-century french diplomatic service


How MIMO cross-layer design enables QoS while detecting non-cooperative nodes in wireless multi-hop networks Wireless Multi-hop Networks (WMNs) are based on the cooperation between nodes. The non-cooperative (selfish) nodes can affect the quality of services (QoS) delivered by the network. The solutions proposed in the literature are based on the monitoring mechanism to detect non-cooperative nodes. However, the monitoring mechanism has to tackle a significant false alarm rate. The origin of these issues is mainly related to the interferences and the costs of the monitoring mechanism. In WMNs based on Single-Input Single-Output (SISO) technology, the interferences at the monitor (detector) node can affect the assessment and the accuracy of the monitor node?s observation. In this paper, we use Multi-Input and Multi-Output (MIMO) technology to tackle these drawbacks and to perform the monitoring mechanism without affecting the QoS. We propose a new MAC protocol based on the well-known SPACE-MAC protocol, named MIMODog. The collision at the monitor node can be avoided by tuning the antennas? weights. Therefore, the signal coming from other nodes than the monitored one can be nullified. Thus, this solution allows an important improvement of the accuracy of the monitor node?s observation. Moreover, we propose a monitoring capacity analysis using graph theory particularly Conflict Graph (CG), and asymptotic study. We illustrate that the capacity consumed in the case of MIMODog is costly compared to SPACE-MAC, but the accuracy of the observation is better. We demonstrate that the number of monitor nodes is ? ( M / n ln n ) for a MIMO network with randomly located nodes n, each equipped with M antennas. Indeed, numerical results illustrate that by using MIMODog, the network can have a constant improvement M on an asymptotic number of monitor nodes compared to SISO 802.11 DCF MAC.

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

mimo
monitoring mechanism
conflict graph
qos

multi-hop wireless networks
non-cooperative nodes


The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs Let \(S(n,k)\) be the Stirling number of the second kind. In this paper, we prove that for any integer \(n\) at least three, there exists a 3-uniform \(\mathcal{C}\)-hypergraph \(\mathcal{H}\) with chromatic spectrum \(R(\mathcal{H})=(1,r_2,S(n,3),\ldots , S(n,n))\), which is the minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs with upper chromatic number n.

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

chromatic spectrum
stirling number of the second kind


extended probe method for linkage discovery over high-cardinality alphabets The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wright's work that restricts problem representation into the binary-string domain. Discrete Fourier transform is used to analyze underlying structure in high-cardinality alphabets space. Boolean operators are replaced with new operators such as ?, ?, ? and so on in high cardinality alphabets. The "probe" formulation is redesigned to determine epistatic properties of non-binary function. Theoretical analysis shows the close relationship between probe value and problem structure. A deterministic and a stochastic algorithm based on properties of probes are proposed to completely identify the linkage structure and rigourously compute all Fourier coefficients. Some discussion about linkage detection for continuous problems is given.

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