ppxscal/embedding_network huggingface dataset:
New simple methods of tuning three-term controllers for dead-time processes
Authors: K. G. Arvanitis, G. D. Pasgianos, G. Kalogeropoulos
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

New simple methods are presented for tuning three-term controllers for dead-time processes. The methods are based on appropriate manipulations of the exponential dead-time term in the denominator of the closed-loop transfer function for a servo problem, and, subsequently, on appropriately matching the coefficients of corresponding powers of s in the numerators of the resulting transfer functions and those in their denominators. This technique gives simple algebraic systems of equations for the controller parameters. The proposed methods are universal and can readily be applied to a wide variety of linear process models with time delay. Simulation results show that our methods provide improved performances as compared to the most recent tuning methods. Moreover, the controller settings obtained by the proposed methods give a robust performance for uncertainty in the process model parameters.
Predicting customer choice in services using discrete choice analysis
Authors: R. Verma, G. R. Plaschka, B. Hanlon, A. Livingston, K. Kalcher
Venue: IBM Systems Journal (2008)

This paper presents an overview of the science and art of discrete choice modeling for service sector applications. With the ongoing momentum of service science, management, and engineering, the discrete choice modeling approach provides a sophisticated tool kit for assessing the needs and preferences of service customers. We provide directions for designing and executing discrete choice studies for services and discuss several examples for a number of industries including health care, financial services, retail, hospitality, and online services. We conclude with a discussion of the many managerial implications of the discrete choice approach.
An SSO-Capable Distributed RBAC Model with High Availability across Administrative Domain
Authors: Sekpon Juntapremjitt, Somchart Fugkeaw, Piyawit Manpanpanich
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper proposes a novel design and implementation of distributed RBAC (dRBAC) and Single Sign-On (SSO) system that spans over multiple administrative domains with high availability. The core idea is based on Multi-Agent Systems (MAS) technique owing to its modularity, autonomy, distributedness, flexibility, and scalability. All agents serve their specific purposes. Leveraging agents simplifies high availability. PKI is used for trust enablement between intra- and inter-domain agent communications. The Security Assertion Markup Language (SAML) is adopted for supporting the exchange of authentication and authorization information in the architecture. The approach supports strong two-factor authentication with X.509 digital certificate. The authorization scheme is based on the Privilege Management Infrastructure (PMI). Finally, we reported our extended implementation status and demonstrated that our proposed model is efficient and flexible to implement in the multiple SSO and PKI domains.
Addressing cold-start problem in recommendation systems
Authors: Xuan Nhat Lam, Thuc Vu, Trong Duc Le, Anh Duc Duong
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Recommender systems for automatically suggested items of interest to users have become increasingly essential in fields where mass personalization is highly valued. The popular core techniques of such systems are collaborative filtering, content-based filtering and combinations of these. In this paper, we discuss hybrid approaches, using collaborative and also content data to address cold-start - that is, giving recommendations to novel users who have no preference on any items, or recommending items that no user of the community has seen yet. While there have been lots of studies on solving the item-side problems, solution for user-side problems has not been seen public. So we develop a hybrid model based on the analysis of two probabilistic aspect models using pure collaborative filtering to combine with users' information. The experiments with MovieLen data indicate substantial and consistent improvements of this model in overcoming the cold-start user-side problem.
Factorizations and characterizations of induced-hereditary and compositive properties
Authors: Alastair Farrugia, Peter Mihók, R. Bruce Richter, Gabriel Semanivšin
Venue: Journal of Graph Theory (2005)

An Erratum has been published for this article in Journal of Graph Theory 50:261, 2005. A graph property (i.e., a set of graphs) is hereditary (respectively, induced-hereditary) if it is closed under taking subgraphs (resp., induced-subgraphs), while the property is additive if it is closed under disjoint unions. If ${\cal P}$ and ${\cal Q}$ are properties, the product ${\cal P}\circ {\cal Q}$ consists of all graphs G for which there is a partition of the vertex set of G into (possibly empty) subsets A and B with G[A] $\in {\cal P}$ and G[B] $\in {\cal Q}$. A property is reducible if it is the product of two other properties, and irreducible otherwise. We show that very few reducible induced-hereditary properties have a unique factorization into irreducibles, and we describe them completely. On the other hand, we give a new and simpler proof that additive hereditary properties have a unique factorization into irreducible additive hereditary properties [J. Graph Theory 33 (2000), 44&ndash;53]. We also introduce analogs of additive induced-hereditary properties, and characterize them in the style of Scheinerman [Discrete Math. 55 (1985), 185&ndash;193]. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 49: 11&ndash;27, 2005 Most of the results presented here are part of the first author's Ph.D. thesis, written under the supervision of the third. The first author's doctoral studies in Canada were fully funded by the Canadian government through a Canadian Commonwealth Scholarship.
Robust Recursive H∞ DOA Estimation Using Spatial Forward Linear Predictor
Authors: Ann-Chen Chang, Chun Hsu, Ing-Jiunn Su
Venue: Wireless Personal Communications: An International Journal (2008)

This letter deals with robust direction of arrival (DOA) estimation based on the recursive H ¿ algorithm for the forward linear predictor. This recursive H ¿ criterion is different from traditional H 2 estimation criterions which minimize the squared prediction error. The forward linear predictor with recursive H ¿ algorithm is a worst case optimization approach, which minimizes the total effect of the worst disturbances on the prediction error. Some computer simulation examples are provided for illustrating the effectiveness of the proposed method.
Dynamic Analysis of Skin Temperature Distribution Exerted by Elastic Pants
Authors: Ping Xiao, Wen-bin Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

To obtain the surface skin temperature distribution of lower body under the static or dynamic condition and effects of skin pressure on the surface temperature, we used infrared thermograph to measure the surface skin temperature of healthy female. Six healthy females were served as subjects. The experiment, including static parts without pants and movement parts with wearing elastic pants, was executed in a climate chamber where the temperature was 21°C and a relative humidity was 60%. In static experiment, skin temperature ranged from 27.4 to 30.95°C. In wear trial, the values of skin pressure ranged from 0.82 to 1.70 kPa. It was found that wearing elastic pants reduced the skin temperature of lower body. If the skin pressure was bigger, the surface temperature of body region covered by pants would be decreased significantly. In addition, there was significant difference of surface temperature in center back waist and crotch regions under dynamic state.
Dynamic Channel Assignment for Wireless Mesh Networks Using Clustering
Authors: Sadeq Ali Makram, Mesut Günes, Amine Kchiche, Martin Krebs
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The aggregate capacity of wireless mesh networks can be improved significantly by equipping each node with multiple interfaces and by using multiple channels in order to reduce the effect of interference. Since the number of available channels is limited, it is desired to allocate and reallocate channels on-demand. In this paper, a Cluster Channel Assignment (CCA)approach is proposed, to maximize the aggregate throughput by exploiting spatial reuse and local dynamic switching of the channels. A clustering approach is employed in order to maximize the network capacity while minimizing the interference and taking advantage of the possibility of reuse of channels among clusters.
Training restricted Boltzmann machines using approximations to the likelihood gradient
Authors: Tijmen Tieleman
Venue: Proceedings of the 25th international conference on Machine learning (2008)

A new algorithm for training Restricted Boltzmann Machines is introduced. The algorithm, named Persistent Contrastive Divergence, is different from the standard Contrastive Divergence algorithms in that it aims to draw samples from almost exactly the model distribution. It is compared to some standard Contrastive Divergence and Pseudo-Likelihood algorithms on the tasks of modeling and classifying various types of data. The Persistent Contrastive Divergence algorithm outperforms the other algorithms, and is equally fast and simple.
The Desocialization of the Courts, Sentencing Decision Support and Plea Bargaining
Authors: Andrew Vincent, John Zeleznikow
Venue: International Review of Law, Computers and Technology (2007)

This article details the authors' attempts to construct a sentencing information system for use in the County Court in the Australian state of Victoria. Particular attention is given to the idea of desocialization of the courts and methods of constructing sentencing information systems. The authors envisage a system that can assist legal aid lawyers to better advise their clients about possible sentencing outcomes as a result of either plea bargain or trial. Advisory systems in this area need to reflect the actual sentencing practice and decision making processes that judges use in reaching their sentences.
Gate voltage and geometry dependence of the series resistance and of the carrier mobility in FinFET devices
Authors: P. Magnone, V. Subramanian, B. Parvais, A. Mercha, C. Pace, M. Dehan, S. Decoutere, G. Groeseneken, F. Crupi, S. Pierro
Venue: Microelectronic Engineering (2008)

In this work, we investigate the gate voltage and the geometry dependence of the series resistance and the carrier mobility in n-type and p-type FinFETs. A significant gate voltage dependence of the series resistance is observed, which is ascribed to the conduction modulation of the LDD region under the gate. The fin width dependence of the series resistance is investigated and two simple methods of normalization are compared. Mobility data in narrow (W"f"i"n=30nm) and wide fin (W"f"i"n=3@mm) have been compared. N-FinFETs show a higher mobility compared to the p-FinFET in both cases, but for narrow fins the difference is reduced since the mobility on the sidewalls improves for holes but degrades for electrons. We show that without taking into account the gate voltage dependence of the series resistance the mobility is significantly underestimated.
Retractable contract network for empowerment in workforce scheduling
Authors: Edward P. K. Tsang, Tim Gosling, Botond Virginas, Chris Voudouris, Gilbert Owusu, W. Liu
Venue: Multiagent and Grid Systems (2008)

This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It is motivated by BT's workforce scheduling problem, in which multiple service providers have to serve multiple service buyers. The service providers and buyers all attempt to maximize their own utility. The overall problem is a multi-objective optimization problem; for example, one has to maximize completion rates and service quality and minimize travelling distances. Although the work is motivated by BT's business operations, the aim is to develop a general negotiation protocol for staff empowerment. Standard contract net is a practical strategy in distributed scheduling where agents may have conflicting objectives. In this paper, we have introduced a retractable contract net protocol, RECONNET, which supports hill-climbing in the space of schedules. It is built upon a job-release and compensation mechanism. A system based on RECONNET has been implemented for BT's workforce scheduling problem. The software, which we call ASMCR, allows the management to exert full control over the company's multiple objectives. The manager generates a Pareto set of solutions by defining, for each buyer and seller, the weights given to each objective. ASMCR gives service buyers and sellers ownership of their problem and freedom to maximize their performance under the criteria defined by the management. ASMCR was tested on real-sized problems and demonstrated to meet BT's operational time requirement. It has full potential to be further developed for tackling BT's workforce scheduling problem.
A frame knowledge system for managing financial decision knowledge
Authors: Weissor Shiue, Sheng-Tun Li, Kuan-Ju Chen
Venue: Expert Systems with Applications: An International Journal (2008)

Managing decision knowledge or expertise from domain experts is one of the most exciting challenges in today's knowledge management field. The nature of decision knowledge in determining a firm's financial health is context-dependent, intangible, and tacit in nature. Knowledge-based systems (KBS) have been recognized as a successful paradigm for managing financial decision knowledge attributed to possessing capabilities of reasoning and enhancing the consistency of decision-making. However, most present KBS adopt rules as the knowledge representation scheme, which cannot express the expert's knowledge construct systematically when dealing with more numerous and disordered knowledge connotations. In addition, the standalone nature of the systems hinders them from deploying onto heterogeneous platforms and cannot accommodate to the emerging Web-enabled environment. To reduce these flaws, this study proposes a frame knowledge system in which the structural and procedural decision knowledge is encapsulated so that unnecessary interference can be avoided. A protocol analysis, before encapsulation, is conducted to elicit the tacit and unstructured knowledge from a senior CPA we cooperated with. The deployment and Web enabling issue is tackled by using Jess and Java interoperable computing. With these combined, it is possible to prompt the understandability, accessibility, and reusability of KBS. The effectiveness of the proposed system is validated in supporting the expert's decision-making by conducting an empirical experimentation on 537 companies listed in the Taiwan Stock Exchange Corporation.
Mathematical Analysis of Swarm Robots Foraging Based on Division Strategy
Venue: Proceedings of the 2007 International Conference on Computational Intelligence and Security Workshops (2007)

The mathematical model of swarm robotic system can predict the collective behavior of the system, analyze the effect that individual characteristic has on the collective behavior, which can guide the improvement of individual control strategy. The mathematical model of foraging based on division strategy is proposed, which is composed of a series of coupled differential rate equations. The mathematical model is used to analyze the time evolution of the number of robots in different states and the number of undelivered foods. The performance of foraging based on homogeneous strategy and division strategy is investigated utilizing mathematical models. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Job submission to grid computing environments
Authors: R. P. Bruin, T. O. H. White, A. M. Walker, K. F. Austen, M. T. Dove, R. P. Tyer, P. A. Couch, I. T. Todorov, M. O. Blanchard
Venue: Concurrency and Computation: Practice Experience (2008)

The problem of enabling scientist users to submit jobs to grid computing environments will eventually limit the usability of grids. The eMinerals project has tackled this problem by developing the 'my_condor_submit' (MCS) tool, which provides a simple scriptable interface to Globus, a flexible interaction with the storage resource broker, metascheduling with load balancing within a grid environment, and automatic metadata harvesting. This paper provides an overview of MCS together with a use case. We also describe the use of MCS within parameter-sweep studies. Copyright &copy; 2008 John Wiley Sons, Ltd.
BRAIN GENE ONTOLOGY AND SIMULATION SYSTEM (BGOS) FOR A BETTER UNDERSTANDING OF THE BRAIN
Authors: Nikola Kasabov, Vishal Jain, Paulo C. M. Gottgtroy, Lubica Benuskova, Frances Joseph
Venue: Cybernetics and Systems (2007)

This article presents some preliminary results on a brain-gene ontology project that is concerned with the collection and the presentation, in a form of ontology, of various concepts, facts, data, software simulators, graphs, videos, animations, and other information forms, related to brain functions, brain diseases, their genetic basis and the relationship between all of them. The first version of the brain-gene ontology (BGO) has been completed as a structure and as an initial implementation in the Protégé ontology-building environment. The BGO allows users to: navigate through the rich information space of brain functions and brain diseases, brain related genes and their activities in certain parts of the brain and their relation to brain diseases; to run simulations; to download data that can be used in a software machine learning environment such as WEKA and NeuCom to train prediction or classification models; to visualize relationship information; to add some new information as the BGO has an evolving structure. The BGO is designed to facilitate active learning and research in the areas of bioinformatics, neuroinformatics, information engineering, and knowledge management. Different parts of it can be used by different users, from a school level to postgraduate and PhD student level. A further development of the BGO is discussed, where more data and information will be added, that will include both a higher level information on cognitive functions and consciousness, and a lower level quantum information.
WiMax Security
Authors: Mahmoud Nasreldin, Heba Aslan, Magdy El-Hennawy, Adel El-Hennawy
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Broadband wireless access security becomes more complicated when wireless devices are added to the network. Threats are ranked according to the level of risk they present. Authentication in WiMax (IEEE 802.16) will be examined using different protocols. This paper reflects to most recent work of the IEEE and WiMax forums and it can be used to prioritize future research directions in Wireless security.
Visualization Criticism
Authors: Robert Kosara, Fritz Drury, Lars Erik Holmquist, David H. Laidlaw
Venue: IEEE Computer Graphics and Applications (2008)

Criticism of designs and ideas is an important tool in art and design—and it can also be used to great effect in visualization teaching and research. We describe the basics of critiquing in visual art, where the goal is to teach the students to see and to articulate their ideas and concerns. The use of criticism in teaching shows how this concept can be applied for more active classroom interaction and discussion. In response to a visualization critique example, we also offer a critique of critiquing: what are the pitfalls, when can criticism actually harm the design process? Finally, we argue that critiquing strengthens the theoretical foundation of visualization, and is really only an extension of an activity we are all familiar with—peer reviewing.
A two-class parallel system with general service times of the parallel class
Authors: D. Filippopoulos, H. Karatza
Venue: Journal of Computer and System Sciences (2008)

A parallel system with two job classes is analyzed. Type-1 jobs require one server for their execution and have exponentially distributed service times while type-2 jobs need two servers and have general service times. The model consists of a single queue served by two servers that may work either independently or in parallel. It is assumed that all jobs are rigid and share the servers according to pure space sharing. We provide closed-form expressions, exact as well as approximate, for various performance measures of interest. The approximate formula is found to be extremely accurate for various distributions of the service times of type-2 jobs. Furthermore, the maximal occupancy of the servers as well as the maximal throughput are examined. Finally, numerical results to investigate the impact of each parameter on system performance are conducted.
Improving long range and high magnification face recognition: Database acquisition, evaluation, and enhancement
Authors: Yi Yao, Besma R. Abidi, Nathan D. Kalka, Natalia A. Schmid, Mongi A. Abidi
Venue: Computer Vision and Image Understanding (2008)

In this paper, we describe a face video database, UTK-LRHM, acquired from long distances and with high magnifications. Both indoor and outdoor sequences are collected under uncontrolled surveillance conditions. To our knowledge, it is the first database to provide face images from long distances (indoor: 10-16m and outdoor: 50-300m). The corresponding system magnifications range from 3x to 20x for indoor and up to 284x for outdoor. This database has applications in experimentations with human identification and authentication in long range surveillance and wide area monitoring. Deteriorations unique to long range and high magnification face images are investigated in terms of face recognition rates based on the UTK-LRHM database. Magnification blur is shown to be a major degradation source, the effect of which is quantified using a novel blur assessment measure and alleviated via adaptive deblurring algorithms. A comprehensive processing algorithm, including frame selection, enhancement, and super-resolution is introduced for long range and high magnification face images with a large variety of resolutions. Experimental results using face images of the UTK-LRHM database demonstrate a significant improvement in recognition rates after assessment and enhancement of degradations.
Getting the message across: visual attention, aesthetic design and what users remember
Authors: Alistair Sutcliffe, Abdallah Namoune
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

An investigation into user attention and design quality in websites is described. The investigation combined reported attention to areas of interest, with free memory recall and a questionnaire to assess whether areas of interest that users attended to were also remembered and rated well in terms of aesthetic design and usability. Users' memory of areas of interest and design features agreed reasonably well with their reported attention. The sites which were rated more attractive overall had an open layout, extensive use of animations which drew users' attention, and good aesthetic design ratings. Aesthetics was the more important determinant for overall attractiveness; whereas content, brand and usability were more important for overall preference. Based on the analysis, design guidelines for directing user attention are proposed.