Some New Solutions of the (3+1)-Dimensional Jimbo-Miwa Equation via the Improved (G '/G)-Expansion Method The improved (G'/G)-expansion method is straightforward and effective mathematical tool for establishing exact traveling wave solutions of different nonlinear partial differential equations which arise in engineering sciences, applied mathematics and real time application fields. In this article, we have constructed some new traveling wave solutions of the nonlinear evolution equation, namely, the (3+1)-dimensional Jimbo-Miwa equation via the improved (G'/G)-expansion method. In this method, the general solution of the second order linear ordinary differential equation involving constants coefficients together with A(xi) = Sigma(m)(j = - m) p(j) (G'/G)(j) is employed, where p(j) (j = 0,+/-1,+/-2, ...,+/-m) are constants. Further, it is worth stating that the obtained solutions become in special functional forms for the particular values of the arbitrary constants. In addition, it is noteworthy declaring that, some of our solutions are in good agreement with already published results. Moreover, some of the solutions are described in the figures with the aid of commercial software Maple.

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

the improved (g '/g)-expansion method
the jimbo-miwa equation
nonlinear evolution equations


Efficient algorithms for distortion and blocking techniques in association rule hiding Data mining provides the opportunity to extract useful information from large databases. Various techniques have been proposed in this context in order to extract this information in the most efficient way. However, efficiency is not our only concern in this study. The security and privacy issues over the extracted knowledge must be seriously considered as well. By taking this into consideration, we study the procedure of hiding sensitive association rules in binary data sets by blocking some data values and we present an algorithm for solving this problem. We also provide a fuzzification of the support and the confidence of an association rule in order to accommodate for the existence of blocked/unknown values. In addition, we quantitatively compare the proposed algorithm with other already published algorithms by running experiments on binary data sets, and we also qualitatively compare the efficiency of the proposed algorithm in hiding association rules. We utilize the notion of border rules, by putting weights in each rule, and we use effective data structures for the representation of the rules so as (a) to minimize the side effects created by the hiding process and (b) to speed up the selection of the victim transactions. Finally, we study the overall security of the modified database, using the C4.5 decision tree algorithm of the WEKA data mining tool, and we discuss the advantages and the limitations of blocking.

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


TCP-Real: receiver-oriented congestion control We introduce a receiver-oriented approach to congestion control, demonstrated by an experimental protocol, TCP-Real. The protocol allows for a measurement-based transmission strategy, which complements the blind increase/decrease window adjustments. Owing to its design, the protocol displays an inherent property to produce comprehensive dynamics in heterogeneous environments with wired or wireless networks and delay-sensitive or -tolerant applications. TCP-Real controls congestion as standard TCP does. However, its receiver-oriented nature and its wave communication pattern allow for two amending mechanisms: (i) congestion avoidance, which reduces unnecessary transmission gaps that hurt the performance of time-constrained applications, and (ii) advanced error detection and classification, which designates recovery tactics responsive to the nature of the errors, thereby enhancing the protocol performance over wireless links or asymmetric paths. We detail the protocol mechanisms and specification and we report extensively on the comparative fairness and efficiency evaluation of standard TCP, TCP-Real, and TCP-friendly protocols for both delay-tolerant and -sensitive applications and in both wired and wireless networks.

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

tcp-friendly protocols
real-time protocols
mobile/wireless networks


Application of Dixon resultant to satellite trajectory control by pole placement Control system design process based on pole placement frequently requires to solve underdetermined multivariate polynomial systems. Since only the real solutions can be accepted for hardware implementation, we are looking for exclusively these roots. In this present study a symbolic-numeric approach is introduced to determine directly the real solutions. Employing Dixon resultant, a condition can be formulated for the free variables as parameters of the underdetermined system, which ensures only real solutions. Numerical examples illustrate the procedure and the effectiveness of the designed control. (C) 2012 Elsevier B.V. All rights reserved.

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

satellite control
symbolic-numeric computation
multivariate polynomial system


Bifurcation from a chaos generator including switched inductor with time delay This paper proposes a piecewise linear nonautonomous chaos generator that includes a switched inductor with time delay. The dynamics can be grasped by using piecewise exact solutions and one-dimensional return map can be derived rigorously. Using the return map, we formulate bifurcation equations and clarify tangent bifurcation route to chaos. Rough global bifurcation sets are given. Some of chaotic attractors are verified in the laboratory.

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

nonlinear inductor
mapping procedure
switching elements


local and global recency weighting approach to bug prediction Finding and fixing software bugs is a challenging maintenance task, and a significant amount of effort is invested by software development companies on this issue. In this paper, we use the Eclipse project's recorded software bug history to predict occurrence of future bugs. The history contains information on when bugs have been reported and subsequently fixed.

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

software task use maintenance eclipse paper future global predict bugs

histories
software development
project
informal
locality


ENDMal: An anti-obfuscation and collaborative malware detection system using syscall sequences Malware obfuscation obscures malware into different versions, making traditional syntactic nature based detection ineffective. Furthermore, with the huge and exponentially growing number of malware samples, existing malware detection systems are either evaded by malware obfuscation, or overwhelmed by numerous malware samples. This paper proposes an anti-obfuscation, scalable and collaborative malware detection system-ENDMal. ENDMal identifies the program that behaves suspiciously in end-hosts and similarly between a group of suspicious programs in a wide area as malicious. We present the Iterative Sequence Alignment (ISA) method to defeat malware obfuscation. Instead of using complex behavior graph, we propose the Handle dependences and Probabilistic Ordering Dependence (HPOD) technology to represent the program behaviors. In addition, we design a novel information sharing infrastructure, RENShare, to collaboratively congregate the group characteristics of programs spreading over different network areas. Our experimental results show that ENDMal can detect unknown malwares much faster than the centralized detection system and is more effective than the existing distributed detection system. (C) 2013 Elsevier Ltd. All rights reserved.

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

behavior-based malware detection
anti-obfuscation
program behavior presentation
end-network collaboration


A fuzzy-mixed-integer goal programming model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates This paper presents a new mixed-integer goal programming (MIGP) model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the complexity of the above model and uncertainty involved in real-world scheduling problems, it is sometimes unrealistic or even impossible to acquire exact input data. Hence, we consider the parallel-machine scheduling problem with sequence-dependent set-up times under the hypothesis of fuzzy processing time's knowledge and two fuzzy objectives as the MIGP model. In addition, a quite effective and applicable methodology for solving the above fuzzy model are presented. At the end, the effectiveness of the proposed model and the denoted methodology is demonstrated through some test problems.

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

parallel machine scheduling
mixed-integer goal programming
fuzzy theory
sequence-dependent setup time
release date


dbVOR: a database system for importing pedigree, phenotype and genotype data and exporting selected subsets When studying the genetics of a human trait, we typically have to manage both genome-wide and targeted genotype data. There can be overlap of both people and markers from different genotyping experiments; the overlap can introduce several kinds of problems. Most times the overlapping genotypes are the same, but sometimes they are different. Occasionally, the lab will return genotypes using a different allele labeling scheme (for example 1/2 vs A/C). Sometimes, the genotype for a person/marker index is unreliable or missing. Further, over time some markers are merged and bad samples are re-run under a different sample name. We need a consistent picture of the subset of data we have chosen to work with even though there might possibly be conflicting measurements from multiple data sources.

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

association studies
genome-wide association studies
linkage
mega2
mysql
phenotypes
plink
python


Inter-agent communication in a FIPA compliant intelligent distributed dynamic-information system This paper describes a traffic surveillance system as a particular case of the class of intelligent distributed dynamic-information systems (IDDIS). The Traffic Surveillance System is a vision-based FIPA compliant multi-agent system that uses the FIPA Agent Communication Language (ACL) and the FIPA Semantic Language (SL). The focus of the work is inter-agent communication and coordination. We have extended the SL expressiveness with respect to the representation of uncertainty and to the representation of ad hoc MPEG7 descriptions. We propose a transport encoding format more suitable for time-constrained systems than the original textual format proposed in the FIPA specifications. We show that, within the scope of the FIPA platform, the FIPA ACL is a communication language powerful enough to achieve multi-agent coordination through communication. This work also suggests that the FIPA platform is suitable for building surveillance based applications.

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

iddis
traffic surveillance system
fipa
agent communication language
acl
semantic language
sl

multi-agent communication and coordination


A particle-based method for granular flow simulation We present a new particle-based method for granular flow simulation. In the method, a new elastic stress term, which is derived from a modified form of the Hooke's law, is included in the momentum governing equation to handle the friction of granular materials. Viscosity force is also added to simulate the dynamic friction for the purpose of smoothing the velocity field and further maintaining the simulation stability. Benefiting from the Lagrangian nature of the SPH method, large flow deformation can be well handled easily and naturally. In addition, a signed distance field is also employed to enforce the solid boundary condition. The experimental results show that the proposed method is effective and efficient for handling the flow of granular materials, and different kinds of granular behaviors can be well simulated by adjusting just one parameter.

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

sand
smoothed particle hydrodynamics
hooke's law
animation


Job shop scheduling with beam search Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are kept for further branching and remaining nodes are pruned off permanently. In this paper, we develop a beam search based scheduling algorithm for the job shop problem. Both the makespan and mean tardiness are used as the performance measures. The proposed algorithm is also compared with other well known search methods and dispatching rules for a wide variety of problems. The results indicate that the beam search technique is a very competitive and promising tool which deserves further research in the scheduling literature.

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


Semantic image interpretation of gamma ray profiles in petroleum exploration This paper presents the S-Chart framework, an approach for semantic image interpretation of line charts; and the InteliStrata system, an application for semantic interpretation of gamma ray profiles. The S-Chart framework is structured as a set of knowledge models and algorithms that can be instantiated to accomplish chart interpretation in all sorts of domains. The knowledge models are represented in three semantic levels and apply the concept of symbol grounding in order to map the representation primitives between the levels. The interpretation algorithms carry out the interaction between the high-level symbolic reasoning, and the low-level signal processing. In order to demonstrate the applicability of the S-Chart framework, we developed the InteliStrata system, an application in Geology for the semantic interpretation of gamma ray profiles. Using the developed application, we have interpreted the charts of two gamma ray profiles captured in petroleum exploration wells, indicating the position of stratigraphic sequences and maximum flooding surfaces. The results were compared with the interpretation produced by an experienced geologist using the same data input. The system carried out interpretation that were compatible with the geologist interpretation over the data. Our framework has the advantage of allowing the integration of existing domain ontologies with domain independent visual knowledge models and also the ability of grounding domain concepts in low-level data.

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

semantic image interpretation
visual knowledge

symbol grounding problem
ontology
stratigraphy
gamma ray well log


Minimal feedback vertex sets in directed split-stars In a graph G = (V,E), a subset F c V(G) is a feed-back vertex set of G if the subgraph induced by V(G)\F Is acyclic. In this article, we propose an algorithm for finding minimal feedback vertex sets of directed split-stars. Indeed, our algorithm can derive an upper bound on the size of the minimum feedback vertex set in directed split-stars. Moreover, a simple distributed algorithm is presented for obtaining such sets. (c) 2005 Wiley Periodicals, Inc.

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

interconnection networks
split-stars
distributed algorithms


Feature selection in bankruptcy prediction For many corporations, assessing the credit of investment targets and the possibility of bankruptcy is a vital issue before investment. Data mining and machine learning techniques have been applied to solve the bankruptcy prediction and credit scoring problems. As feature selection is an important step to select more representative data from a given dataset in data mining to improve the final prediction performance, it is unknown that which feature selection method is better. Therefore, this paper aims at comparing five well-known feature selection methods used in bankruptcy prediction, which are t-test, correlation matrix, stepwise regression, principle component analysis (PCA) and factor analysis (FA) to examine their prediction performance. Multi-layer perceptron (MLP) neural networks are used as the prediction model. Five related datasets are used in order to provide a reliable conclusion. Regarding the experimental results, the t-test feature selection method outperforms the other ones by the two performance measurements.

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

feature selection
data mining
bankruptcy prediction
neural networks


Passengers information in public transport and privacy: Can anonymous tickets prevent tracking? The paper focuses on the privacy issues related to the management of sensitive information gathered by transportation companies. We discuss the use of e-tickets, with a focus on customers privacy. We provide a case study based on anonymous 10-ride tickets. We propose a number of recommendations for the design and management of public transport information systems, aimed at preserving the users privacy.

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

sensitive data management
privacy preserving technology


Security Analysis of a Single Sign-On Mechanism for Distributed Computer Networks Single sign-on (SSO) is a new authentication mechanism that enables a legal user with a single credential to be authenticated by multiple service providers in a distributed computer network. Recently, Chang and Lee proposed a new SSO scheme and claimed its security by providing well-organized security arguments. In this paper, however, we demonstrative that their scheme is actually insecure as it fails to meet credential privacy and soundness of authentication. Specifically, we present two impersonation attacks. The first attack allows a malicious service provider, who has successfully communicated with a legal user twice, to recover the user's credential and then to impersonate the user to access resources and services offered by other service providers. In another attack, an outsider without any credential may be able to enjoy network services freely by impersonating any legal user or a nonexistent user. We identify the flaws in their security arguments to explain why attacks are possible against their SSO scheme. Our attacks also apply to another SSO scheme proposed by Hsu and Chuang, which inspired the design of the Chang-Lee scheme. Moreover, by employing an efficient verifiable encryption of RSA signatures proposed by Ateniese, we propose an improvement for repairing the Chang-Lee scheme. We promote the formal study of the soundness of authentication as one open problem.

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

authentication
distributed computer networks
security analysis

information security
single sign-on (sso)


A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks Wireless ad hoc networks are envisioned to be randomly deployed in versatile and potentially hostile environments. Hence, providing secure and uninterrupted communication between the un-tethered network nodes becomes a critical problem. In this paper, we investigate the wormhole attack in wireless ad hoc networks, an attack that can disrupt vital network functions such as routing. In the wormhole attack, the adversary establishes a low-latency unidirectional or bi-directional link, such as a wired or long-range wireless link, between two points in the network that are not within communication range of each other. The attacker then records one or more messages at one end of the link, tunnels them via the link to the other end, and replays them into the network in a timely manner. The wormhole attack is easily implemented and particularly challenging to detect, since it does not require breach of the authenticity and confidentiality of communication, or the compromise of any host. We present a graph theoretic framework for modeling wormhole links and derive the necessary and sufficient conditions for detecting and defending against wormhole attacks. Based on our framework, we show that any candidate solution preventing wormholes should construct a communication graph that is a subgraph of the geometric graph defined by the radio range of the network nodes. Making use of our framework, we propose a cryptographic mechanism based on local broadcast keys in order to prevent wormholes. Our solution does not need time synchronization or time measurement, requires only a small fraction of the nodes to know their location, and is decentralized. Hence, it is suitable for networks with the most stringent constraints such as sensor networks. Finally, we believe our work is the first to provide an analytical evaluation in terms of probabilities of the extent to which a method prevents wormholes.

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

wormhole attack
wireless ad hoc networks


The Life and Work of Shoichiro Tsukita We dedicate the 2008 Berlin conference and this collection of scientific manuscripts to the memory of our colleague Shoichiro Tsukita. His seminal scientific contributions and impact on the field of tight junctions is substantial. Shoichiro was a professor at Kyoto University and one the world's most influential biologists when he passed away on December 11, 2005 at the age of 52 from complications of pancreatic cancer. He was a pioneer in several areas of cell biology; most particularly he will be remembered as the founding father of the molecular study of tight junctions.

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


An expert system approach to improving stability and reliability of web service In recent years, Internet service has become an important issue that attracts the researchers from both computer science and communication fields. Although many systems were proposed to support network-based e-activities, e.g., e-learning and e-commerce, few of them took into consideration web server management issues that are critical to the stability and reliability for providing Internet service. To cope with these problems, this study proposes a novel approach to eliciting and integrating system management knowledge from experienced system managers. An expert system for monitoring web servers has been implemented based on the novel approach; moreover, an experiment on an educational system has shown the superiority of the expert system in predicting and handling possible malfunctions or anomalies of web service systems.

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

knowledge engineering
educational systems


A comparison of interest point and region detectors on structured, range and texture images ? Introduced a new edge shape detector. Evaluated and compared with affine region detectors. Performs poor on structured scenes and comparable on textured scenes. Advantage: easily parallelizable. Suitable for deformable objects such as plant leaves.

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

affine invariant regions
edge shapes
local features
descriptors
image retrieval
harris corners
hessian
sift
surf


on the security of wireless network access with enhancements The security of the current 3G wireless protocols addresses the problems faced by the 2G systems, in addition to fulfilling the higher 3G security requirements mandated from operating in IP networks as well as voice networks. However, the approach adopted by the two most popular 3G mobile system forerunners, UMTS and cdma2000, leaves many areas for improvement. In this paper, we improve the security of the 3G protocols in network access by providing strong periodically mutual authentication, strong key agreement, and non-repudiation service in a simple and elegant way.

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


A method for predicting the probability of business network profitability In the design phase of business collaboration, it is desirable to be able to predict the profitability of the business-to-be. Therefore, techniques to assess qualities such as costs, revenues, risks, and profitability have been previously proposed. However, they do not allow the modeler to properly manage uncertainty with respect to the design of the considered business collaboration. In many real collaboration projects today, uncertainty regarding the business present or future characteristics is so significant that ignoring it becomes problematic. In this paper, we propose an approach based on the predictive, probabilistic architecture modeling framework (P2AMF), capable of advanced and probabilistically sound reasoning about profitability risks. The P2AMF-based approach for profitability risk prediction is also based on the e3-value modeling language and on the object constraint language. The paper introduces the prediction and modeling approach, and a supporting software tool. The use of the approach is illustrated by means of a case study originated from the Stockholm Royal Seaport smart city project.

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

value networks
risk analysis
probabilistic inference
goal interoperability


Optimised Batch Patching with Classes of Service In this paper we present a new technique called Optimised Batch Patching with Classes of Service(OBP with CoS) which can be used to leverage the benefits of multicast within the context of 'near' video-on-demand systems in IP networks. OBP with CoS builds on an earlier scheme, known as Optimised Patching, but is different in two respects. Firstly, in OBP with CoS, the server artificially delays requests in order to increase the probability of accumulating duplicates, thereby allowing greater exploitation of multicast compared to Optimised Patching albeit at the expense of higher latency until commencement of service. Secondly, the client is able to request a latency class of service which reflects how long the client is prepared to wait until playout of the video. The server scheduling algorithm attempts to minimise network bandwidth consumption within the constraints imposed by the class of each request. We present analysis and simulations of our scheme in order to validate its effectiveness.

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


In-home online support for caregivers of survivors of stroke: A feasibility study The primary aim of this feasibility study was to determine if caregivers (n = 5) were willing and able to use Caringsimilar toWeb((C)), a Web-based intervention for support, from their home Internet connection for 3 months. The caregivers',perceived health and satisfaction with caring, as well as the care recipients' use of healthcare services, were recorded. The experience of caring (problems and successes) was examined. Data were collected via weekly online surveys and e-mail discussions. Descriptive analyses revealed that the 3 caregivers who completed the study were satisfied with Caring-Web. Caregivers rated their health as average to excellent and their satisfaction with caring as good. Care recipients averaged 6 calls/visits to a medical office with one emergency room, visit and subsequent hospitalization Major problems for the caregivers included dealing with medical conditions about which they lacked g survivor of the stroke. Major successes for the caregivers involved communicating effectively with the care recipient and returning to everyday life with family and friends. knowledge. Content analysis of the e-mail discussions revealed that subjects sought information about medical conditions related to caring for the survivor of the stroke. Major successes for the caregivers involved communicating effectively with the care recipient and returning to everyday life with family and friends.

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


Silk Moth Neuropeptide Hormones: Prothoracicotropic Hormone and Others Abstract: The silkworm, Bombyx mori, is a very useful model species, especially in genetics, biochemistry, physiology, and molecular biology, helping researchers unravel the many mysteries involved in the insect life process. The present review describes our early contributions as chemists to the study of the molting and metamorphosis of B. mori. We also present research by Japanese scientists that contributed to the isolation and characterization of peptide hormones from B. mori.

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

bombyx mori
silk moth
silkworm
neuropeptide hormones
molting
metamorphosis

ptth
sericulture
ecdysone
prothoracic gland


Interpretable dimension reduction for classifying functional data Classification problems involving a categorical class label Y Y and a functional predictor X(t) X ( t ) are becoming increasingly common. Since X(t) X ( t ) is infinite dimensional, some form of dimension reduction is essential in these problems. Conventional dimension reduction techniques for functional data usually suffer from one or both of the following problems. First, they do not take the categorical response into consideration, and second, the resulting reduced subspace may have a complicated relationship with the original functional data. In this paper we propose a dimension reduction method, Functional Adaptive Classification (FAC), specifically designed for functional classification problems. FAC uses certain complexity constraints to ensure that the reduced subspace has an easily interpretable relationship to the original functional predictor. Extensive simulation studies and an fMRI (functional Magnetic Resonance Imaging) study show that FAC is extremely competitive in comparison to other potential approaches in terms of both classification accuracy and model interpretability.

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

functional data
classification
dimension reduction


A fast and accurate method to register medical images using wavelet Modulus Maxima This paper presents a fast, accurate and automatic method to register images of rigid bodies. It uses wavelets to obtain control points. Wavelets are not shift invariant but the structures determined by the wavelet high pass image, the Modulus Maxima Image, provide the information necessary for a fast-rough convergence. These structures represent shapes from which we segment the invariant shapes for the images being registered, For example, the MRI and CT images of the brain can be considered as rigid bodies that do not undergo a change in shape over reasonable periods of time. By using a convex hull, we make the procedure insensitive to the internal changes in the object. Hence, even with the growth of tumors, the procedure registers brain images very accurately. The method uses the correlation coefficient to measure the similarity between images and to determine how well the images are registered. The method has been extensively tested with various types of images and in all cases the registration accuracy is very high. The correlation coefficient used to validate the registrations has deficiencies that occasionally required a visual inspection to terminate the algorithm after a point of marginal improvement. (C) 2000 Elsevier Science B.V. All rights reserved.

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

registration
modulus maxima
mri
ct
brain images
correlation coefficient

wavelet transform
splines
image processing


A system to diagnose atherosclerosis via wavelet transforms, principal component analysis and artificial neural networks In this study, Doppler ultrasound signals were acquired from carotid arteries of 82 patients with atherosclerosis and 95 healthy volunteers. We have employed discrete wave transform (DWT) of Doppler signals and power spectral density graphics of these decomposed signals using Welch method. After that, we have performed Principal component analysis (PCA) for data reduction and ANN in order to distinguish between atherosclerosis and healthy subjects. After the training phase, testing of the artificial neural network (ANN) was established. The overall results show that 97.9% correct classification was achieved, whereas two false classifications have been observed for the test group of 97 people. In conclusion we are proposing a complimentary expert system that can be coupled to software of the ultrasonic Doppler devices. The diagnosis performances of this study show the advantages of this system: it is rapid, easy to operate, noninvasive, inexpensive and making a decision without hesitation.

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

atherosclerosis
power spectral density
principal component analysis
artificial neural network


Detecting and representing relevant Web deltas in WHOWEDA In this paper, we present a mechanism for detecting and representing changes, given the old and new versions of a set of interlinked Web documents, retrieved in response to a user's query. In particular, we show how to detect and represent Web deltas, i.e., changes in the Web documents that are relevant to a user's query in the context of our Web warehousing system called WHOWEDA (Warehouse of Web Data). In WHOWEDA, Web information is materialized views stored in Web tables in the form of Web tuples. These Web tuples, represented as directed graphs, can be manipulated using a set of Web algebraic operators, In this paper, we present a mechanism to detect relevant Web deltas using Web algebraic operators such as the Web join and the outer Web join. Web join is used to detect identical documents residing in two Web tables, whereas, outer Web join, a derivative of Web join, is used to identify dangling Web tuples. We show how to represent these changes using delta Web tables. We develop formal algorithms for the generation of delta Web tables identifying Web documents which have been added, deleted, or modified since the last query.

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


Idempotent and co-idempotent stack filters and min-max operators Viewing the elements of R-S as images f with pixels i is an element of S of grey-scale value f(i) motivates the study of certain nonlinear operators Phi : R-S --> R-S. For translation invariant Phi (called stack filters in the signal processing literature) we derive the first necessary and sufficient condition for idempotency which can be tested in polynomial time. Various related properties can be tested in polynomial time as well, and many results still apply when the linear lattice (R, less than or equal to) is replaced by an arbitrary distributive lattice (R, less than or equal to), or when the condition of translation invariance is dropped. Although the main application is in nonlinear image processing several other fields will be touched upon. (C) 2002 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 B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I 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

nonlinear image processing
idempotency
distributive lattice


Fluid-structural interactions in the inner ear This paper presents a finite element fluid-structural interaction model for the lateral semicircular canal system of the inner ear. The endolymph is modeled as a slightly compressible Newtonian fluid and the cupula partition is represented by a linearly elastic solid. The fluid-structural interaction problem is treated rigorously with a strong coupling between the fluid flow and the structural displacements. The time evolution of the endolymphatic velocity and pressure fields and cupular displacement and stress fields are closely examined to reveal the intricate dynamics that takes place in the vestibular system during the caloric irrigation test. (C) 2004 Elsevier Ltd. All rights reserved.

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

caloric test
cfd
fluid structural interaction


An overview of quantization in JPEG 2000 Quantization is instrumental in enabling the rich feature set of JPEG 2000. Several quantization options are provided within JPEG 2000. Part I of the standard includes only uniform scalar dead-zone quantization, while Part II allows both generalized uniform scalar dead-zone quantization and trellis coded quantization (TCQ). In this paper, an overview of these quantization methods is provided. Issues that arise when each of these methods are employed are discussed as well.

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

uniform quantization
dead-zone quantization
trellis coded quantization (tcq)


Normal forms for spiking neural P systems The spiking neural P systems are a class of computing devices recently introduced as a bridge between spiking neural nets and membrane computing. In this paper we prove a series of normal forms for spiking neural P systems, concerning the regular expressions used in the firing rules, the delay between firing and spiking, the forgetting rules used, and the outdegree of the graph of synapses. In all cases, surprising simplifications are found, without losing the computational completeness - sometimes at the price of (slightly) increasing other parameters which describe the complexity of these systems. (c) 2006 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 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

spiking neural p system
universality
normal form


Writing from the archive: Henry Garnets powder-plot letters and archival communication Through a reading of the archived letters of Henry Garnet (15551606), Superior of the Jesuit order in England and suspected Gunpowder plotter, this article investigates the nature of the archive in relation to narrative theory. Figuring the archive as one of the number of narrating voices accrued by the individual record, I argue that models of communication such as those put forward by Roman Jakobson, Wayne C. Booth and Seymour Chatman afford useful insights into the ways in which power is inscribed and reinscribed in the record through successive acts of reading and rewriting.

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

henry garnet (15551606)
gunpowder plot
narratology


Fuzzy unidirectional force control of constrained robotic manipulators The end effector of a robotic arm is required to keep a contact on the contour of the constraint surface in tasks such as deburring and grinding. Being different from contacts resulted from general mechanical pairs, such a contact is unidirectional, or equivalently, the contact force can only act along the outward normal of the constraint surface at the contact point. How to achieve this specification was not addressed explicitly in many position/force control schemes developed so far, instead it was assumed in the development of controllers. In this paper, the unidirectionality of the contact force is explicitly included in modeling and control of constrained robot system. A fuzzy tuning mechanism is developed to generate the impedance model resulted from the continuous contact made by the end effector of the robotic manipulator on the constraint surface while it is in motion. A controller is then developed based on the fuzzy rule bases and the nonlinear feedback technique. The simulation is carried out to verify the effectiveness of the approach. (C) 2002 Elsevier Science B.V. All rights reserved.

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


Extracting physical homogeneous regions out of irrigation networks using fuzzy clustering method: a case study for the Ghazvin canal irrigation network Improving the current operation and maintenance activities is one of the main steps in achieving higher performance of irrigation networks. Improving the irrigation network management, influenced by different spatial and temporal parameters, is confronted with special difficulties. One of the controversial issues often faced by decision-makers is how to cope with the spatial diversity of irrigation systems. Homogeneous area detection out of the irrigation networks could improve the current management of networks. The idea behind this research is to present a quantitative benchmark for exploring the homogeneous areas with similar physical attributes out of the network region. Five physical attributes, such as length, capacity, number of intakes, number of conveyance structures and the covered irrigated area for each canal reach, are used for spatial clustering. Two fuzzy clustering algorithms, namely FCM and GK, are applied to the Ghazvin irrigation network. Using a clustering validity index, SC, shows that the GK algorithm is the more appropriate tool for clustering of the considered dataset. According to the results the optimal number of clusters for the Ghazvin irrigation project is derived as nine clusters and the irrigated district is classified into nine homogeneous areas. Physical homogeneous regions provide a context for better and easier decision-making.

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


Optimizing differentiation and commonality levels among models in car line-ups: An empirical application of a nature-inspired heuristic mechanism We implement a swarm intelligence mechanism to design optimal car lines. We aim to optimize differentiation and commonality levels among models in the line. Our mechanism utilizes stated preference data derived from a conjoint experiment. A prototype system is also developed to facilitate managerial decision making. Insights are provided into how new and existing car models must be combined.

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

differentiation
commonality
swarm intelligence
prototype system


Variations in use of meta tag descriptions by Web pages in different languages ? Sets of top-ranking pages in 20 languages returned by the Google search engine were downloaded and analyzed for presence of meta tag descriptions and lengths of descriptions. Results showed significant differences in proportion of pages with descriptions and in lengths of descriptions depending on language; specifically, pages in major Western European languages showed higher proportions with descriptions, while pages in Chinese showed the lowest proportions. Descriptions were mostly in the languages of the pages, though English descriptions were provided on some non-English pages. With few exceptions, coding schemes adopted for diacritics and non-Roman characters were standard.

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

metadata
foreign languages
html
summarization
character sets


Connecting GEON: Making sense of the myriad resources, researchers and concepts that comprise a geoscience cyberinfrastructure Simply placing electronic geoscience resources such as datasets, methods, ontologies, workflows and articles in a digital library or cyberinfrastructure does not mean that they will be used successfully by other researchers or educators. It is also necessary to provide the means to locate potentially useful content, and to understand it. Without suitable provision for these needs, many useful resources will go undiscovered, or else will be found but used inappropriately. In this article, we describe an approach to discovering, describing and understanding e-resources based on the notion that meaning is carried in the interconnections between resources and the actors in the cyberinfrastructure (including individuals, groups, organizations), as well as by ontologies and conventional metadata. Navigation around this universe is achieved by implementing the idea of perspectives as dynamic, conceptual views (defined by SPARQL-like queries against an OWL schema) that not only act as filters, but also dynamically promote and demote concepts, relationships and properties according to their immediate relevance. We describe a means to represent a wide variety of interactions between resources using the notion of a knowledge nexus, and we illustrate its use with resources and actors from the Geosciences Network (GEON) cyberinfrastructure community. We also closely link browsing and visualizing strategies to our nexus, drawing on ideas from semiotics to move resources and connections not currently of interest from the foreground to the background, and vice versa, using a new form of adaptive perspective. We illustrate our ideas via ConceptVista, an open-source concept mapping application that provides rich, visual depictions of the resources, cyber-community and myriad connections between them. Examples are presented that show how geoscientific knowledge can be explored not only via ontological structure, but also by use cases, social networks, citation graphs and organization charts; all of which may carry some aspects of meaning for the user.

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


Interpretable Numerical Descriptors of Amino Acid Space Informative numerical representations of amino acid residues are essential for successful in silico modeling or establishing the structure-activity relationships of proteins. A straightforward approach is adopted here for representing more than 500 amino acid indices from the AAindex database by a set of uncorrelated scales, satisfying the VARIMAX criterion. Different measures are considered in order to demonstrate the improved interpretability of the current scales as compared to previously published ones. Performance is also addressed in a classification problem of G-protein coupled receptors, and is found to be similar or higher than the performance achieved by six other scale sets. Finally, a unique correspondence between numerical indices and mutation matrices is derived and discussed in light of the evolutionary conservation of amino acid properties. Conclusions from this study highlight the discord between ease of interpretation of amino acid scales and their relevance to protein structure conservation, as well as general considerations for designing custom scale sets.

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

algorithms
linear algebra
sequence analysis


Virus Spread in Networks The influence of the network characteristics on the virus spread is analyzed in a new-the N-intertwined Markov chain-model, whose only approximation lies in the application of mean field theory. The mean field approximation is quantified in detail. The N-intertwined model has been compared with the exact 2(N)-state Markov model and with previously proposed "homogeneous" or "local" models. The sharp epidemic threshold tau(c), which is a consequence of mean field theory, is rigorously shown to be equal to tau(c) = 1/(lambda(max) (A)), where lambda(max) (A) is the largest eigenvalue-the spectral radius-of the adjacency matrix A. A continued fraction expansion of the steady-state infection probability at node j is presented as well as several upper bounds.

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

epidemic threshold
mean field theory
virus spread


a model and temporal proof system for networks of processes A model and a sound and complete proof system for networks of processes in which component processes communicate exclusively through messages is given. The model, an extension of the trace model, can describe both synchronous and asynchronous networks. The proof system uses temporal-logic assertions on sequences of observations a generalization of traces. The use of observations (traces) makes the proof system simple, compositional and modular, since internal details can be hidden. The expressive power of temporal logic makes it possible to prove temporal properties (safety, liveness, precedence, etc.) in the system. The proof system is language-independent and works for both synchronous and asynchronous networks.

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

traces use temporal modular model component sound power logic

communication network synchronization intern express extensibility general observability systems asynchronicity language message process assert sequence completeness


Development and hardware implementation of a reliable protective relay data acquisition system This paper proposes an intelligence based protective relay data acquisition system to correct current transformers and capacitive voltage transformers secondary waveform distortions. The protective relay data acquisition system receives voltage and current signals from current transformers and capacitive voltage transformers and prepares the inputs to the main board after some pre-processing. Current transformers and capacitive voltage transformers provide instrument level current and voltage signals to meters and protective relays in high voltage and extra high voltage systems. The accuracy and performance of protective relays in high voltage and extra high voltage systems are directly related to steady state and transient performance of current transformers and capacitive voltage transformers. Current transformers saturation and capacitive voltage transformers transient could lead to protective relay mal-operation or even prevent tripping. The key of the proposed scheme is to use artificial neural network to achieve the inverse transfer functions of current transformers and capacitive voltage transformers. Simulation studies are preformed and the impacts of changing different parameters are studied. Performance study results show that the proposed scheme is accurate and reliable. The proposed algorithm has also been implemented and tested on a digital signal processor board. Details of the implementation and experimental studies are provided in the paper.

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

artificial neural network
protective relay

current transformer
capacitive voltage transformer


Macrophages of the Adrenal Cortex: A Morphological Study of the Effects of Aging and Dexamethasone Administration Macrophages are present throughout the adrenal cortex, particularly in the deeper layers. They locate next to parenchyma cells, which secrete glucocorticoids under the regulation of the pituitary adrenocorticotropic hormone (ACTH). Blockade of ACTH secretion is followed by adrenocortical cell atrophy and apoptosis, an effect likely to cause an increase in local macrophage number and phagocytic activity. The purpose of the current study was to verify this effect and ascertain its age-related variation after ACTH blockade. Male rats at five different ages ranging from 2 to 24 months were divided into two groups, which were injected with dexamethasone phosphate or saline for 3 days. The adrenals were processed for morphological and morphometric study. The age-related increase in macrophage number seen in a survey of the sections was confirmed in the quantitative study

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

adrenal macrophage dexamethasone apoptosis


Co-occurrence network of reuters news Networks describe various complex natural systems including social systems. We investigate the social network of co-occurrence in Reuters-21578 corpus, which consists of news articles that appeared in the Reuters newswire in 1987. People are represented as vertices and two persons are connected if they co-occur in the same article. The network has small-world features with power-law degree distribution. The network is disconnected and the component size distribution has power-law characteristics. Community detection on a degree-reduced network provides meaningful communities. An edge-reduced network, which contains only the strong ties has a star topology. "Importance" of persons are investigated. The network is the situation in 1987. After 20 years, a better judgment on the importance of the people can be done. A number of ranking algorithms, including Citation count and PageRank, are used to assign ranks to vertices. The ranks given by the algorithms are compared against how well a person is represented in Wikipedia. We find up to medium level Spearman's rank correlations. A noteworthy finding is that PageRank consistently

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


Computation of through-space NMR shielding effects by small-ring aromatic and antiaromatic hydrocarbons The GIAO-HF method in Gaussian 03 was employed to calculate the isotropic NMR shielding values of a diatomic hydrogen probe above simple small-ring aromatic and antiaromatic hydrocarbons, including neutral and ionic examples. Subtraction of the isotropic shielding of diatomic hydrogen by itself allowed the prediction of through-space proton NMR shielding increment surfaces for these systems. Substantial shielding was observed above the center of aromatic rings, regardless of whether the ring was ?-aromatic or ?-aromatic, and also regardless of the charge. In sharp contrast, deshielding was observed above the center of antiaromatic rings, regardless of whether the ring was ?-aromatic or ?-aromatic, and also regardless of the charge. Shielding increment values at 2.5 above the ring centers were compared to NICS values at the same position. The shielding effects predicted by using diatomic hydrogen as a computational probe are diagnostic of whether a structure possesses aromaticity or antiaromaticity.

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

through-space shielding effects
giao
hydrocarbon


Fixed-priority allocation and scheduling for energy-efficient fault tolerance in hard real-time multiprocessor systems Energy-efficient task allocation and scheduling schemes with deterministic fault-tolerant capabilities are proposed for symmetric multiprocessor systems executing tasks with hard real-time constraints. The proposed heuristic achieves energy savings by optimally balancing the application workload among processors in a system. Based on the observation that a fault-free operation is expected to remain dominant in the near future and the probability of the worst case faults is low, an optimistic fault-tolerant heuristic is then proposed to achieve optimum energy savings in the absence of faults and meet application timing requirements in the worst case faults at the cost of energy inefficiency. Extensive simulation experiment results show that when compared to the state-of-art schemes, the proposed optimistic heuristic achieves average energy savings of up to 70 percent and exhibits higher tolerance to variations in application utilizations and more resilience to fault occurrences beyond system specification.

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

energy-aware systems
real-time and embedded systems
scheduling and task partitioning


The minimal deceptive problem revisited: The role of genetic waste Genetic algorithm (GA) is used in a number of fields for effective search of complex spaces, or as a learning algorithm. Based on natural genetics, it feeds on its ability to process large amounts of information very quickly. The performance of a GA is satisfactory in most cases, in that it finds solutions in the neighborhood of the global optimum. Some problems, however, are known to be GA-hard and deceive the GA to converge to sub-optimal solutions. We devise a version of GA through the addition of the genetic waste, based on the perceived role of nonsense codons (or noncoding segments), which alleviates the problem by allowing sufficient diversity in the population. This modification allows the algorithm to change the parameters in each run without external interference. Furthermore, the parameters are independent of the fitness values and are thereby applicable to a wide class of problems. Using Goldberg's[10] minimal deceptive problem, we devise a simple method for setting the initial parameters of a genetic algorithm based on the role of nonsense codons in natural genetics. Genetic waste provides random parameters throughout the simulations, enabling the abandonment of trial and error search for the optimal combination of initial parameters and thereby adding credibility to the genetic algorithm as a tool of adaptive search.

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

genetic algorithm
minimal deceptive problem


Automatic inversion of magnetic anomalies of faults ? An automatic inversion scheme and the related computer program in FORTRAN 77 to invert the magnetic anomalies of faults magnetized in an unknown direction are presented. The inversion scheme finds the initial values of the model parameters and improves them iteratively using Marquardt's optimization technique. The program is generalized in the sense that it can be used for any component of the magnetic anomaly, viz., total, horizontal and vertical. The positions of the dominant minimum and maximum anomaly values are used to estimate the initial values of the depths to top and bottom of the fault model, while the ratio of their anomaly values is used to initialize the value of the direction of magnetization. The position of the fault is located at the point where the anomaly equals to the sum of the maximum and minimum anomaly values. The input to the inversion program consists of the anomalies measured at given distances from an arbitrary reference point on the profile, besides the geological strike of the body and the direction of measurement. The output consists of observed and calculated anomalies, the model parameters, besides the location of the origin of the fault measured from the chosen reference point and the coefficients of linear regional anomaly that may be present in the data.

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


An efficient quality-of-service MAC protocol for infrastructure WLANs In this paper, we propose a new efficient MAC protocol, named quality-of-service MAC (QMAC), which is an integrated solution for providing QoS guarantees to real-time multimedia applications in infrastructure WLANs. In addition, QMAC has the following attractive features: (i) its reservation scheme ensures that real-time stations enter the polling list in bounded time, (ii) it supports multiple priority levels and guarantees that high-priority stations always join the polling list earlier than low-priority stations, (iii) it employs the distributed pre-check technique such that the access point can admit as many newly flows as possible, while not violating admitted flows' guarantees, (iv) its dynamic bandwidth allocation, scheme provides real-time traffic transmission with per-flow probabilistic bandwidth assurances, and (v) it uses a, multipoll frame to poll all stations on the polling list at a time, therefore, the bandwidth can be utilized more efficient. Through simulations, we demonstrate the advantage of our QMAC. (C) 2005 Elsevier Ltd. All rights reserved.

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

ieee 802.11
medium access control (mac)
quality of service (qos)
real-time
multi-priority
wireless local area network (wlan)


Location privacy: going beyond K-anonymity, cloaking and anonymizers With many location-based services, it is implicitly assumed that the location server receives actual users locations to respond to their spatial queries. Consequently, information customized to their locations, such as nearest points of interest can be provided. However, there is a major privacy concern over sharing such sensitive information with potentially malicious servers, jeopardizing users' private information. The anonymity- and cloaking-based approaches proposed to address this problem cannot provide stringent privacy guarantees without incurring costly computation and communication overhead. Furthermore, they require a trusted intermediate anonymizer to protect user locations during query processing. This paper proposes a fundamental approach based on private information retrieval to process range and K-nearest neighbor queries, the prevalent queries used in many location-based services, with stronger privacy guarantees compared to those of the cloaking and anonymity approaches. We performed extensive experiments on both real-world and synthetic datasets to confirm the effectiveness of our approaches.

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

location privacy
private information retrieval

spatial databases
location-based services


StarPU: a unified platform for task scheduling on heterogeneous multicore architectures In the field of HPC, the current hardware trend is to design multiprocessor architectures featuring heterogeneous technologies such as specialized coprocessors (e.g. Cell/BE) or data-parallel accelerators (e.g. GPUs). Approaching the theoretical performance of these architectures is a complex issue. Indeed, substantial efforts have already been devoted to efficiently offload parts of the computations. However, designing an execution model that unifies all computing units and associated embedded memory remains a main challenge. We therefore designed StarPU, an original runtime system providing a high-level, unified execution model tightly coupled with an expressive data management library. The main goal of StarPU is to provide numerical kernel designers with a convenient way to generate parallel tasks over heterogeneous hardware on the one hand, and easily develop and tune powerful scheduling algorithms on the other hand. We have developed several strategies that can be selected seamlessly at run-time, and we have analyzed their efficiency on several algorithms running simultaneously over multiple cores and a GPU. In addition to substantial improvements regarding execution times, we have obtained consistent superlinear parallelism by actually exploiting the heterogeneous nature of the machine. We eventually show that our dynamic approach competes with the highly optimized MAGMA library and overcomes the limitations of the corresponding static scheduling in a portable way. Copyright (C) 2010 John Wiley & Sons, Ltd.

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


Separating sublinear time computations by approximate diameter We study the problem of separating sublinear time computations via approximating the diameter for a sequence S=p (1) p (2) a <...a <...a <... p (n) of points in a metric space, in which any two consecutive points have the same distance. The computation is considered respectively under deterministic, zero error randomized, and bounded error randomized models. We obtain a class of separations using various versions of the approximate diameter problem based on restrictions on input data. We derive tight sublinear time separations for each of the three computation models via proving that computation with O(n (r) ) time is strictly more powerful than that with O(n (r-epsilon) ) time, where r and epsilon are arbitrary parameters in (0,1) and (0,r) respectively. We show that, for any parameter ra(0,1), the bounded error randomized sublinear time computation in time O(n (r) ) cannot be simulated by any zero error randomized sublinear time algorithm in o(n) time or queries; and the same is true for zero error randomized computation versus deterministic computation.

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

randomization
separation of complexity classes


Polling Models with Unequal Service Rates under Limited Service Policies - Sharp Asymptotics We derive asymptotic expressions for the distribution of the total queue length in a polling model with two classes of customers and unequal service rates. The server employs a scheduling policy that alternately visits each queue, with the maximum number served in each visit potentially being different for each queue. We provide sufficient conditions for the behaviour to lie in one of two regimes, depending on the system parameters. The first regime, called codominant, has both queues tending to grow as the total system size grows. The single-class dominant regime has only one queue tending to grow as the total system size grows. Finally, we present numerical results that demonstrate that the developed conditions are only sufficient and comment on the implications of this observation.

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


Present and future of 193nm lithography Currently 193nm lithography is becoming the workhorse for state of the art IC technologies. To get there a lot of challenges had to be dealt with like defect density, line edge roughness, crystal growth on photo masks and others, of which some are closely connected to the new wavelength. Also from a manufacturing standpoint some progress had to be achieved. These different aspects of todays 193nm lithography will be discussed. After the demise of 157nm lithography and the birth of immersion lithography near term there is no new wavelength visible and 193nm lithography will be with us for the coming years and has to support the shrink roadmap of the IC industry for quite some time. Though by name dealing with the same technology a lot of new process options need to be introduced down the road like polarization and immersion itself with its challenges in process and hardware. An outlook will be given of what lies ahead of us.

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

193nm lithography
polarization
immersion


An abstract data type for real numbers We present a calculus having real numbers as a basic data type. The calculus is defined by its denotational semantics. We prove the universality of the calculus. We show how the definition of an operational semantics is problematic. We discuss this problem and present a possible solution. (C) 1999 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

real number computability
domain theory
denotational and operational semantics
abstract data types


Key issues in the design of an asynchronous system to support meeting preparation A review is made of the most important decisions in the design of asynchronous systems to support the preparation of business decision meetings. These decisions are illustrated with the choices made for the development of SISCO, a system of this type. The presentation considers issues in the discussion model, the group memory, the communication and visualization mechanisms, and the development of a meeting preparation sequence: how to start a session, carry it out and close it. Issues concerning coordination, participation and awareness in meeting preparation sessions are also discussed.

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

pre-meeting
asynchronous distributed systems
structured discussions


Dual Carrier Probing for Spaceborne SAR Imaging Spaceborne imaging of the Earth's surface by synthetic aperture radar (SAR) may be adversely affected by the ionosphere that causes distortions of the signals emitted and received by the radar antenna. In our previous publication on the subject [SIAM J. Imaging Sci., 2 (2009) pp. 140-182], we have analyzed those distortions for the inhomogeneous ionosphere described by the cold plasma model. Based on the analysis, we have concluded that the deterioration of SAR images was due to the mismatch between certain parameters of the actual received signal, which is slowed down by the temporal dispersion in the ionosphere, and the corresponding parameters of the matched filter, which is taken as if the propagation were unobstructed. Consequently, to improve the quality of the images, the filter must be corrected. However, to get the appropriate correction, one needs to know some key characteristics of the ionosphere precisely at the time and place the image is taken. To obtain those characteristics, we currently propose probing the terrain, and hence the ionosphere, on two distinct carrier frequencies. We also investigate the performance of the matched filters that were corrected this way and show that the final quality of the images, i.e., their resolution and sharpness evaluated using the SAR ambiguity theory, indeed improves.

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

synthetic aperture radar
cold plasma
matched filter

earth's ionosphere
dispersion of radio waves
image distortions
multicarrier probing
correction of the filter
range and azimuthal resolution
image sharpness


secure rural supply chain management using low cost paper watermarking Supply chain systems in rural developing regions are extremely fragile and are vulnerable to a wide range of security threats including theft, fraud and counterfeit goods. In this paper, we propose the design of a secure, low cost supply chain management system that leverages cheap cellphones and a low-cost paper watermarking system that can authenticate and verify the integrity of goods in a supply chain. Unlike many sophisticated solutions which have deployment problems due to the harsh ground realities in rural regions, our system is easy to use, deploy and does not require significant changes to the existing operational model. In addition, our system relies only on paper and cellphones, both of which are ubiquitously used in rural developing regions.

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


Technological scope: diversified or specialized Although the topic of technological diversification has been a major source of research, only a few studies have explored the determinant variables of technological scope decisions. The present study enhances our understanding of the determinants of a firms technological scope strategy. After reviewing the related literatures, we proposed and empirically tested a conceptual model from the perspective of the firms environment, strategic orientation, and resources. The results suggest that the coherence between technological scope decisions and proposed model is significantly related to performance.

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

technological scope
technological diversification


Selective Cu2+/Ascorbate-Dependent Oxidation of Alzheimer's Disease ?-Amyloid Peptides This review summarizes tandem mass spectrometric investigations on the selectivity of metal-catalyzed oxidation of ?-amyloid peptide (?AP) and related sequences. A remarkable feature of the Cu2+/ascorbate-dependent oxidation of these peptides is the switch from predominantly His oxidation in the neurotoxic peptide ?AP1-40 to predominantly Tyr oxidation in the nonneurotoxic reverse sequence ?AP40-1. Within ?AP1-40, His13 and His14 of the high-affinity Cu2+-binding site are most sensitive to oxidation. Eventually, the oxidation of one or both of these His residues could result in a less redox-active ?AP-Cu2+ complex, lowering the incidence of ?AP-Cu2+-dependent Fenton-type reactions for the benefit of surrounding biological tissue.

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

alzheimer's disease
ascorbate
?-amyloid peptide (?ap)
cu2+


A utility-based algorithm for joint uplink/downlink scheduling in wireless cellular networks ? The major driver for deploying next generation wireless cellular systems is their ability to efficiently deliver resource-demanding services, many of which require symmetric communication between an uplink mobile user and a downlink mobile user that belong to the same network. In this work, we propose a utility-based joint uplink/downlink scheduling algorithm suitable for wireless services involving pairwise communication among mobile users. While most existing literature focuses on downlink-only or uplink-only scheduling algorithms, the proposed algorithm aims at ensuring a utility function that jointly captures the quality of service in terms of delay and channel quality on both links. By jointly considering the time varying channel conditions in both the uplink and the downlink directions, the proposed algorithm avoids wasting of resources and achieves notable performance gains in terms of increased number of active connections, lower packet drop rate, and increased network throughput. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction in practical scenarios, we propose an implementation over clusters within the network.

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

wireless cellular networks
scheduling algorithms

resource allocation
quality of service guarantees


An efficient algorithm to extract an optimal sub-circuit by the minimum cut We improve the algorithm to obtain the min-cut graph of a hyper-graph and show an application to the subnetwork extraction problem. The min-cut graph is a directed acyclic graph whose directed cuts correspond one-to-one to the min-cuts of the hyper-graph. While the known approach trades the exactness of the min-cut graph for some speed improvement, our proposed algorithm gives an exact one without substantial computation overhead. By using the exact min-cut graph: an exhaustive algorithm finds an optimal sub-circuit that is extracted by a min-cut from the circuit. By experiments with the industrial data, the proposing method showed a performance enough for practical use.

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

circuit partition
hyper-graph partition
network flow
min-cut
integrated circuit design


Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity In this paper, we show how to obtain causal semantics distinguishing "earlier than" and "not later than" causality between events from algebraic semantics of Petri nets. Janicki and Koutny introduced so called stratified order structures (so-structures) to describe such causal semantics. To obtain algebraic semantics, we redefine our own algebraic approach generating rewrite terms via partial operations of synchronous composition, concurrent composition and sequential composition. These terms are used to produce so-structures which define causal behavior consistent with the (operational) step semantics. For concrete Petri net classes with causal semantics derived from processes minimal so-structures obtained from rewrite terms coincide with minimal so-structures given by processes. This is demonstrated for elementary nets with inhibitor arcs.

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

algebraic petri nets
causal semantics
inhibitor arcs
synchronicity


Spatial defect pattern recognition on semiconductor wafers using model-based clustering and Bayesian inference Defects on semiconductor wafers tend to cluster and the spatial defect patterns contain useful information about potential problems in the manufacturing process. This study proposes to use model-based clustering algorithms via Bayesian inferences for spatial defect pattern recognition on semiconductor wafers. These new algorithms can find the number of defect clusters as well as identify the pattern of each cluster automatically. They are capable of detecting curvilinear patterns, ellipsoidal patterns and nonuniform global defect patterns. Promising results have been obtained from simulation studies.

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

quality control
stochastic processes
semiconductor manufacturing


Displacement residual based DDM matching algorithm High level architecture (HLA) is the prevailing standard for modeling and simulation. The data distribution management (DDM) service of HLA is defined for reducing the delivery of irrelevant data. The key in DDM implementation is the region overlap computation, i.e. the matching between update and subscription regions. Existing algorithms usually make a compromise between region fidelity and network payload. This paper takes both the matching algorithm efficiency and bandwidth cost into account. The main contributions are: 1) illustrating the relationship between region changes and overlap changes, as helps reduce the number of region matching and then improves the total matching efficiency; 2) classifying region updates into two types of data expression, snapshot and residual. The network traffic will be reduced by transmitting only residual data instead of full region representations occasionally. Consequently, a region matching algorithm called displacement residual-based DDM matching (DRBM) is proposed in the paper. Theoretical analysis, algorithm implementation and experiment evaluation are presented. Experiment results show that DRBM provides better matching performance and significant network payload reductions especially when there is a large number of changing regions.

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

high level architecture
data distribution management

distributed simulation
region snapshot
region residual


Automating Object Transformations for Dynamic Software Updating Dynamic software updating (DSU) systems eliminate costly downtime by dynamically fixing bugs and adding features to executing programs. Given a static code patch, most DSU systems construct runtime code changes automatically. However, a dynamic update must also specify how to change the running program's execution state, e. g., the stack and heap, to make it compatible with the new code. Constructing such state transformations correctly and automatically remains an open problem. This paper presents a solution called Targeted Object Synthesis (TOS). TOS first executes the same tests on the old and new program versions separately, observing the program heap state at a few corresponding points. Given two corresponding heap states, TOS matches objects in the two versions using key fields that uniquely identify objects and correlate old and new-version objects. Given example object pairs, TOS then synthesizes the simplest-possible function that transforms an old-version object to its new-version counterpart. We show that TOS is effective on updates to four open-source server programs for which it generates non-trivial transformation functions that use conditionals, operate on collections, and fix memory leaks. These transformations help programmers understand their changes and apply dynamic software updates.

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

algorithms
languages
theory
dynamic software update
hot-swapping
program synthesis
state transformation
object correlation
object matching


Automatic generation of FFT for translations of multipole expansions in spherical harmonics The fast multipole method (FMM) is an efficient algorithm for calculating electrostatic interactions in molecular simulations and a promising alternative to Ewald summation methods. Translation of multipole expansion in spherical harmonics is the most important operation of the fast multipole method and the fast Fourier transform (FFT) acceleration of this operation is among the fastest methods of improving its performance. The technique relies on highly optimized implementation of fast Fourier transform routines for the desired expansion sizes, which need to incorporate the knowledge of symmetries and zero elements in the input arrays. Here a method is presented for automatic generation of such, highly optimized, routines.

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

fast multipole method
spherical harmonics
fast fourier transform

particle dynamics
automatic code generation


checking threat modeling data flow diagrams for implementation conformance and security Threat modeling is a lightweight approach to reason about application security and uses Data Flow Diagrams (DFDs) with security annotations. We extended Reflexion Models to check the conformance of an as-designed DFD with an approximation of the as-built DFD obtained from the implementation. We also designed a set of properties and an analysis to help novice designers think about security threats such as spoofing, tampering and information disclosure.

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

tampering
threat modeling
reflexion models
spoofing
data flow diagrams
information disclosure


Design of fuzzy gain-scheduled robust controllers using Kharitonov's extremal gain margin theorem In this paper a novel fuzzy gain-scheduler is applied to linear plants the transfer functions of which consist of interval polynomials. The gain-scheduler performs an incremental tuning of the controller parameters employing a sliding-mode fuzzy control algorithm. The allowed ranges of variation of the controller gains are determined by using Kharitonov's Extremal Gain Margin Theorem. Sufficient conditions for the asymptotic stability of the closed-loop system are given. The validity of the method is verified via simulation tests.

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

fuzzy gain scheduling
sliding-mode fuzzy logic control
kharitonov's extremal gain theorem
lyapunov stability


Social signals: from theory to applications The Special Issue Editorial introduces the research milieu in which Social Signal Processing originates, by merging computer scientists and social scientists and giving rise to this field in parallel with HumanComputer Interaction, Affective Computing, and Embodied Conversational Agents, all similarly characterized by high interdisciplinarity, stress on multimodality of communication, and the continuous loop from theory to simulation and application. Some frameworks of the cognitive and social processes underlying social signals are identified as reference points (Theory of Mind and Intersubjectivity, mirror neurons, and the ontogenesis and phylogenesis of communication), while three dichotomies (automatic vs. controlled, individualistic vs. intersubjective, and meaning vs. influence) are singled out as leads to navigate within the theoretical and applicative studies presented in the Special Issue.

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