ppxscal/embedding_network huggingface dataset:
An approach to the RF-LSI design for ubiquitous communication appliances
Authors: Yuichi Kado, Mitsuru Harada
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

We propose a "wide area ubiquitous network" as a highly economical and convenient wireless system for providing a wide variety of services. Its basic feature is "wide coverage using ultra low power consumption terminals," and its specific target is a "5-km cell radius using 10-mW transmission power terminals run on ten--year life batteries." In this paper we explain the wireless specifications and the low power consumption performance required of wireless terminals used in these ubiquitous networks. We then introduce a design method that harmonizes RF and digital components and an ultra low power consumption LSI design that make it possible to satisfy these requirements.
Decision Tree Based Simulation Research of Specific Reheating Furnaces
Authors: Helan Liang, Sujian Li, Mugang Liu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

The Specific Reheating Furnaces Mode (SRF) has multi-styles and the interrelations between production cells of SRF are complex. Focusing on these characters, a decision tree based method for production strategies research of SRF is proposed. Firstly, training samples are obtained by execution of the simulation model of SRF. Secondly, decision rules are mined out with the acquired simulation samples base on decision tree algorithm. Finally, the production strategies of SRF are established by the decision rules analysis.
Wireless sensor networks in intelligent transportation systems
Authors: Malik Tubaishat, Peng Zhuang, Qi Qi, Yi Shang
Venue: Wireless Communications Mobile Computing (2009)

Wireless sensor networks (WSNs) offer the potential to significantly improve the efficiency of existing transportation systems. Currently, collecting traffic data for traffic planning and management is achieved mostly through wired sensors. The equipment and maintenance cost and time-consuming installations of existing sensing systems prevent large-scale deployment of real-time traffic monitoring and control. Small wireless sensors with integrated sensing, computing, and wireless communication capabilities offer tremendous advantages in low cost and easy installation. In this paper, we first survey existing WSN technologies for intelligent transportation systems (ITSs), including sensor technologies, energy-efficient networking protocols, and applications of sensor networks for parking lot monitoring, traffic monitoring, and traffic control. Then, we present new methods on applying WSNs in traffic modeling and estimation and traffic control, and show their improved performance over existing solutions. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Automated analysis of security-design models
Authors: David Basin, Manuel Clavel, Jürgen Doser, Marina Egea
Venue: Information and Software Technology (2009)

We have previously proposed SecureUML, an expressive UML-based language for constructing security-design models, which are models that combine design specifications for distributed systems with specifications of their security policies. Here, we show how to automate the analysis of such models in a semantically precise and meaningful way. In our approach, models are formalized together with scenarios that represent possible run-time instances. Queries about properties of the security policy modeled are expressed as formulas in UML's Object Constraint Language. The policy may include both declarative aspects, i.e., static access-control information such as the assignment of users and permissions to roles, and programmatic aspects, which depend on dynamic information, namely the satisfaction of authorization constraints in a given scenario. We show how such properties can be evaluated, completely automatically, in the context of the metamodel of the security-design language. We demonstrate, through examples, that this approach can be used to formalize and check non-trivial security properties. The approach has been implemented in the SecureMOVA tool and all of the examples presented have been checked using this tool.
A Self-governing Hybrid Model for Noise Removal
Authors: Mohammad Reza Hajiaboli
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Denoising methods based on using fourth-order partial deferential equations (PDEs) are providing a good combination of the noise smoothing and the edge preservation without creating blocky effects on the smooth regions of the image. However, finding an optimal choice of model parameters for numerical solver of these techniques is a challenging problem and generally, these model parameters are image-content dependent. In this paper, a hybrid fourth-order PDE-based filter is proposed so that it does not need a manual adjustment of the model parameters. It is shown that by setting the numerical solver of proposed filter for operation at a minor time step-size derived under a data-independent stability condition, the filter can still provide a significantly fast convergence rate. Therefore, the model parameters are reduced to one parameter estimated by using a well-studied mechanism applying in the second-order nonlinear diffusion denoising techniques. Simulation results show that the proposed method can provide a denoised image with higher quality in comparison with that of the existing methods.
Fast communication: Constrained Tucker-3 model for blind beamforming
Authors: André L. F. de Almeida, Gérard Favier, João C. M. Mota
Venue: Signal Processing (2009)

This paper presents a constrained Tucker-3 model for blind beamforming. The constrained structure of this model is parameterized by two constraint matrices that capture the spatial and temporal structure of the channel. We first present a generalized Tucker-3 model that considers a multipath propagation scenario with large delay spread and different number of paths per source. This tensor model generalizes the models of [N.D. Sidiropoulos, G.Z. Dimic, Blind multiuser detection in WCDMA systems with large delay spread, IEEE Signal Process. Lett. 8 (3) (2001) 87-89] and [A. de Baynast, L. De Lathauwer, Detection autodidacte pour des systemes a acces multiple basee sur l'analyse PARAFAC, in: Proceedings of XIX GRETSI Symposium on Signal and Image Processing, Paris, France, 2003] by considering a more general multipath propagation scenario. From this general model, two particular cases can be derived by adjusting the constrained structure of the Tucker-3 core tensor. Identifiability of the proposed tensor model is studied and some simulation results are presented to illustrate the application of this model to blind beamforming.
Back-of-device interaction allows creating very small touch devices
Authors: Patrick Baudisch, Gerry Chu
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper, we explore how to add pointing input capabilities to very small screen devices. On first sight, touchscreens seem to allow for particular compactness, because they integrate input and screen into the same physical space. The opposite is true, however, because the user's fingers occlude contents and prevent precision. We argue that the key to touch-enabling very small devices is to use touch on the device backside. In order to study this, we have created a 2.4" prototype device; we simulate screens smaller than that by masking the screen. We present a user study in which participants completed a pointing task successfully across display sizes when using a back-of device interface. The touchscreen-based control condition (enhanced with the shift technique), in contrast, failed for screen diagonals below 1 inch. We present four form factor concepts based on back-of-device interaction and provide design guidelines extracted from a second user study.
Multivariate limited translation hierarchical Bayes estimators
Authors: Malay Ghosh, Georgios Papageorgiou, Janet Forrester
Venue: Journal of Multivariate Analysis (2009)

Based on the notion of predictive influence functions, the paper develops multivariate limited translation hierarchical Bayes estimators of the normal mean vector which serve as a compromise between the hierarchical Bayes and maximum likelihood estimators. The paper demonstrates the superiority of the limited translation estimators over the usual hierarchical Bayes estimators in terms of the frequentist risks when the true parameter to be estimated departs widely from the grand average of all the parameters.
A Performance Optimized Architecture of Deblocking Filter in H.264/AVC
Authors: Kyeong-Yuk Min, Jong-Wha Chong
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we propose memory and performance optimized architecture to accelerate the operation speed of adaptive deblocking filter for H.264/JVT/AVC video coding. The proposed deblocking filter executes loading/storing and filtering operations with only 192 cycles for 1 macroblock. Only 2×4×4 internal buffers and 32×16 internal SRAM are adopted for the buffering operation of deblocking filter with I/O bandwidth of 32 bit. The proposed architecture can process the filtering operation for 1 macroblock with less filtering cycles and lower memory sizes than some conventional approaches of realizing deblocking filter. The efficient hardware architecture is implemented with novel data arrangement, hybrid filter scheduling and minimum number of buffer. The proposed architecture is suitable for low cost and real-time applications, and the real-time decoding with 1080HD (1920×1088@30 fps) can be easily achieved when working frequency is 70 MHz.
Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services
Venue: PST; Vol. 380 (2006)

It is my great pleasure as general chair of the PST2006 conference to welcome you to this year's privacy, security and trust (PST) conference being hosted by the University of Ontario Institute of Technology (UOIT) at the Hilton Suites Toronto/Markham Conference Centre, Markham, Ontario, Canada. Thank you for making time in your busy schedule to participate in PST2006. The annual PST conference provides an international forum for researchers and information and communications technology (ICT) professionals from industry, the public sector and academe to collaboratively explore ways to make cyberspace a safer and more private place to do business, conduct scientific research, deliver services, provide teaching and learning opportunities, and facilitate global communication and understanding. It is vitally important that we promote multidisciplinary research to solve the technical, legal and social problems facing government, the private sector and citizens at home. Without a trusted ICT environment we will never come close to realizing the full potential of technology to make the world a better place.
A hybrid classification algorithm based on coevolutionary EBFNN and domain covering method
Authors: Jin Tian, Minqiang Li, Fuzan Chen
Venue: Neural Computing and Applications (2009)

A new hybrid scheme of the elliptical basis function neural network (EBFNN) model combined with the cooperative coevolutionary algorithm (Co-CEA) and domain covering method is presented for multiclass classification tasks. This combination of the Co-CEA EBFNN (CC-EBFNN) and the domain covering method is proposed to enhance the predictive capability of the estimated model. The whole training process is divided into two stages: the evolutionary process, and the heuristic structure refining process. First, the initial hidden nodes of the EBFNN model are selected randomly in the training samples, which are further partitioned into modules of hidden nodes with respect to their class labels. Subpopulations are initialized on modules, and the Co-CEA evolves all subpopulations to find the optimal EBFNN structural parameters. Then the heuristic structure refining process is performed on the individual in the elite pool with the special designed constructing and pruning operators. Finally, the CC-EBFNN model is tested on six real-world classification problems from the UCI machine learning repository, and experimental results illustrate that the EBFNN model can be estimated in fewer evolutionary trials, and is able to produce higher prediction accuracies with much simpler network structures when compared with conventional learning algorithms.
Plenary lecture I: managing trust in services oriented architectures
Authors: Denis Trcek
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

Trust management is turning out as one of essential issues for supporting users in contemporary services oriented architectures. Some of approaches address trust by actually focusing on related issues, typically security, while the rest of approaches do address trust in its core. However, there are still quite some open issues that need to be resolved. This lecture will present main methodologies in this area, their strong and weak points, current trends, and the latest discoveries that are essential for computerized trust management, which should be threated through a socio-cognitive perspective.
The Musical Archive Information System at Teatro alla Scala
Authors: Elena Ferrari, Goffredo Haus
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this puper we illustrate the peculiar characteristics of music archives by describing a representative case study: the Multimedia Object-Relational Architecture of the Musical Archive Information System (MAIS) at Teutro alla Scala. We summarize the music contents of the archive and we describe the methods we use to represent them within MAIS. Finally, we present the innovative ,features our system provides to query and retrieve musical information.
A route set construction algorithm for the transit network design problem
Authors: Antonio Mauttone, María E. Urquhart
Venue: Computers and Operations Research (2009)

The transit network design problem (TNDP) aims to determine a set of bus routes for a public transportation system, which must be convenient from the viewpoints of both users (people who use public transportation) and operators (companies who own the resources to give the service). This article presents a constructive algorithm for the TNDP. It is specially designed to produce a set of routes that fulfils demand covering constraints, while taking into account the interests of both users and operators. Its general structure is inspired in the Route Generation Algorithm (RGA) of Baaj and Mahmassani, where its original expansion of routes by inserting individual vertices is replaced by a strategy of insertion of pairs of vertices. The algorithm proposed, called Pair Insertion Algorithm (PIA) can be used to generate initial solutions for a local improvement or evolutionary algorithm, as well as to complete an unfeasible solution with respect to demand covering constraints. Numerical results comparing PIA with RGA over a real test case show that both algorithms produce solutions with similar quality from the users viewpoint (in terms of in-vehicle travel time), while the former produces better solutions from the operators viewpoint (in terms of number of routes and total route duration) and requires a higher execution time. Since the TNDP arises in a context of strategic planning, a solution that reduces the operation cost of the system is highly desirable, even though it takes more time to be computed. The experimental study of the proposed algorithm also shows its ability to produce diverse solutions in both decision and objective spaces; this is a useful property when looking at the use of PIA as a subroutine in the context of another algorithm such as metaheuristics, in particular for a multi-objective problem like TNDP.
Some results related to the tenacity and existence of k-trees
Authors: Dara Moazzami, Behzad Salehian
Venue: Discrete Applied Mathematics (2009)

The tenacity of a graph G, T(G), is defined by T(G)=min{|S|+@t(G-S)@w(G-S)}, where the minimum is taken over all vertex cutsets S of V(G), @w(G-S) be the number of components of G-S and @t(G-S) be the number of vertices in the largest component of the graph induced by G-S. A k-tree of a connected graph G is a spanning tree with maximum degree at most k. In this paper we show that if T(G)>=@t(G-S)@w(G-S)+1k-2, for any subset S of V(G), with k>=3, then G has a k-tree.
An online pruning strategy for supervised ARTMAP-based neural networks
Authors: Shing Chiang Tan, M. V. C. Rao, Chee Peng Lim
Venue: Neural Computing and Applications (2009)

Identifying an appropriate architecture of an artificial neural network (ANN) for a given task is important because learning and generalisation of an ANN is affected by its structure. In this paper, an online pruning strategy is proposed to participate in the learning process of two constructive networks, i.e. fuzzy ARTMAP (FAM) and fuzzy ARTMAP with dynamic decay adjustment (FAMDDA), and the resulting hybrid networks are called FAM/FAMDDA with temporary nodes (i.e. FAM-T and FAMDDA-T, respectively). FAM-T and FAMDDA-T possess a capability of reducing the network complexity online by removing unrepresentative neurons. The performances of FAM-T and FAMDDA-T are evaluated and compared with those of FAM and FAMDDA using a total of 13 benchmark data sets. To demonstrate the applicability of FAM-T and FAMDDA-T, a real fault detection and diagnosis task in a power plant is tested. The results from both benchmark studies and real-world application show that FAMDDA-T and FAM-T are able to yield satisfactory classification performances, with the advantage of having parsimonious network structures.
SilentKnock: practical, provably undetectable authentication
Authors: Eugene Y. Vasserman, Nicholas Hopper, James Tyra
Venue: International Journal of Information Security (2009)

Port knocking is a technique to prevent attackers from discovering and exploiting vulnerable network services, while allowing access for authenticated users. Unfortunately, most work in this area suffers from a lack of a clear threat model or motivation. To remedy this, we introduce a formal security model for port knocking, show how previous schemes fail to meet our definition, and give a provably secure scheme. We also present SilentKnock, an implementation of this protocol that is provably secure under the assumption that AES and a modified version of MD4 are pseudorandom functions, and integrates seamlessly with existing applications.
Developing a long-range information architecture
Authors: James C. Wetherbe, Gordon B. Davis
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

A methodology is presented for eliciting enterprise information requirements and developing a long-range information architecture. The methodology is based on a combination of business system planning, critical success factors, and ends/means analysis. The methodology is independent of organizational structure, personnel, and hardware and software; and it has been successfully implemented in a variety of organizational settings.
Using hydro mathematical model in simulating dynamic behaviour of hydromechanical equipment of hydro power plant Raul Mare-Retezat, Romania
Authors: Flavius Dan Surianu, Constantin Barbulescu
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The paper has presented an application of "HYDRO" mathematical model for simulating the dynamics of hydraulic equipment in the special case of the fast loading with electric power of Raul Mare-Retezat, hydro power plant, Romania. The results of the mathematical simulation are compared with those experimentally obtained through SCADA monitoring system with which the hydro-power plant is equipped.
Cyber physical systems: aspects as a basis for robustness and openness
Authors: John A. Stankovic
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

As discussed in a recent report for which I was a co-author, "as computers and communication bandwidth become faster and cheaper, computing and communication capabilities will be embedded in all types of objects and structures in the physical environment. Applications with enormous societal impact and economic benefit will be created by harnessing these capabilities in time and across space. We refer to systems that bridge the cyber-world of computing and communications with the physical world as cyber-physical systems (CPS). The internet transformed how humans interact and communicate with one another, revolutionized how and where information is accessed, and even changed how people buy and sell in the marketplace. Similarly, CPS will transform how humans interact with and control the physical world around us. Examples of CPS include medical devices and systems, aerospace systems, transportation vehicles and intelligent highways, defense systems, robotic systems, process control, factory automation, building and environmental control and smart spaces. However, the confluence of recent key technologies is fundamentally altering how these types of systems will operate. For example, the level of uncertainty in which these systems operate is growing (hence the need for greater robustness), and pervasive wireless access is opening these systems to unprecedented dynamic and non-deterministic influences." This talk will describe this new and emerging field called CPS. The talk will focus on what is new and why we need fundamentally new approaches to face robustness and openness challenges. Aspect oriented programming will be proposed as a possible basis for key work in CPS.
Many-to-Many Communication in Radio Networks
Authors: Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
Venue: Algorithmica (2009)

Radio networks model wireless data communication when the bandwidth is limited to one wave frequency. The key restriction of such networks is mutual interference of packets arriving simultaneously at a node. The many-to-many (m2m) communication primitive involves p participant nodes from among n nodes in the network, where the distance between any pair of participants is at most d. The task is to have all the participants get to know all the input messages. We consider three cases of the m2m communication problem. In the ad-hoc case, each participant knows only its name and the values of n, p and d. In the partially centralized case, each participant knows the topology of the network and the values of p and d, but does not know the names of the other participants. In the centralized case, each participant knows the topology of the network and the names of all the participants. For the centralized m2m problem, we give deterministic protocols, for both undirected and directed networks, working in time, which is provably optimal. For the partially centralized m2m problem, we give a randomized protocol for undirected networks working in time with high probability (whp), and we show that any deterministic protocol requires time. For the ad-hoc m2m problem, we develop a randomized protocol for undirected networks that works in time whp. We show two lower bounds for the ad-hoc m2m problem. One lower bound states that any randomized protocol for the m2m ad hoc problem requires expected time. Another lower bound states that for any deterministic protocol for the m2m ad hoc problem, there is a network on which the protocol requires time when np(n)=&Omega;(n) and d>1, and that it requires &Omega;(n) time when np(n)=o(n).