ppxscal/embedding_network huggingface dataset:
ADSI Scripting: TFM, 1st edition
Authors: Cade Fassett
Venue:  (2007)

Active Directory Services Interface (ADSI) has long been one of the most complex and mysterious aspects of automating Windows administration with VBScript and the Windows Script Host. In ADSI Scripting: TFM, Cade Fassett breaks down ADSI scripting, exposing its complete functionality with plenty of real-world examples, incredibly detailed reference information, and comprehensive coverage of both the WinNT and LDAP ADSI providers. Readers who are familiar with VBScript and WSH will take their scripting skills to new levels as they learn to more thoroughly automate a variety of administrative tasks related to Active Directory, local computer security accounts, local computer resources, and much more. Included is a unique, exclusive cross-reference between the Active Directory Users & Computers graphical user interface elements and the underlying Acitve Directory schema attributes, making it easier than ever before to script nearly any aspect of various Active Directory objects. If you've been lookig to make ADSI scripting a bigger part of your administrative toolkit, ADSI Scripting: TFM is the book for you.
Ground Truth Verification Tool (GTVT) for Video Surveillance Systems
Authors: Amol Ambardekar, Mircea Nicolescu, Sergiu Dascalu
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

As cameras and storage devices have become cheaper, the number of video surveillance systems has also increased. Video surveillance was (and mostly is) done by human operators on a need-to-know basis. The advent of new algorithms from the computer vision community, and increased computational power offered by new CPUs have shown a strong possibility of automating this task. Different approaches have been proposed by computer scientists to solve the difficult problem of content recognition from video data. They use many different videos to prove their usefulness and accuracy. A careful comparison and evaluation needs to be done to find the most suitable method under given conditions. To compare the results given by video surveillance applications, the ground truth needs to be established. In the case of computer vision, the ground truth needs to be provided by humans, making it one of the most time-consuming tasks in the evaluation process. This paper presents a tool (GTVT) that allows the user to establish the ground truth for a given video. GTVT presents a user-friendly interface to perform the cumbersome task of ground truth establishment and verification.
Automated red teaming: an objective-based data farming approach for red teaming
Authors: C. L. Chua, Cpt W. C. Sim, C. S. Choo, Victor Tay
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper, we describe an objective-based Data Farming approach for red teaming called Automated Red Teaming (ART). The main idea is to develop an ART framework using Evolutionary Algorithms (EAs), Parallel Computing and Simulation, and apply it to uncover exploitable gaps in military operational concepts, complementing the Manual Red Teaming (MRT) effort. The capability of the ART framework was evaluated vis-&agrave;-vis MRT using two maritime security scenarios addressed at the International Data Farming Workshops (IDFWs) 14 and 15. The evaluation showed that, in general, results from ART were better than those obtained from MRT, some of which were non-intuitive and surprising solutions.
Rotation Map with a Controlling Segment: Basic Analysis and Application to A/D Converters
Authors: Yusuke Matsuoka, Toshimichi Saito
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper studies the rotation map with a controlling segment. As a parameter varies, the map exhibits superstable periodic orbits, chaos and rich bifurcation phenomena. The map is applicable to an A/D converter having efficient resolution characteristics. The converter can be realized as a circuit model based on a spiking neuron and the rate-coding. Presenting a test circuit, basic operation is confirmed experimentally.
Comparing Some Methods and Preconditioners for Hydropower Plant Flow Simulations
Authors: Luiz M. Carvalho, Wagner Fortes, Luc Giraud
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

We describe some features of a three-dimensional numerical simulator currently under development for studying water physico-chemical properties during the flooding of hydroelectric plants reservoirs. The work is sponsored by the Brazilian Electric Energy National Agency (ANEEL) and conducted with Furnas Centrais Elétricas S. A., the leading Brazilian power utility company. An overview of the simulator requirements is given. The mathematical model, the software modules, and engineering solutions are briefly discussed, including the finite element based transport module. We compare methods, iterative methods and preconditioners used to solve the sparse linear systems which arise from the discretization of three-dimensional partial differential equations.
Burley!
Authors: Andrew Goode
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

A young tetra fish, one of a million in her school, just wants some attention. Feeling lonely and bored, she is attracted by the manic antics of a gang of older fish who spend the hours inventing new extreme sports. She begins a quest to gain their acceptance, but at what cost?
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
Authors: A. C. Kaporis, P. G. Spirakis
Venue: Theoretical Computer Science (2009)

Let M be a single s-t network of parallel links with load dependent latency functions shared by an infinite number of selfish users. This may yield a Nash equilibrium with unbounded Coordination Ratio [E. Koutsoupias, C. Papadimitriou, Worst-case equilibria, in: 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS, vol. 1563, 1999, pp. 404-413; T. Roughgarden, E. Tardos, How bad is selfish routing? in: 41st IEEE Annual Symposium of Foundations of Computer Science, FOCS, 2000, pp. 93-102]. A Leader can decrease the coordination ratio by assigning flow &alpha;r on M, and then all Followers assign selfishly the (1-&alpha;)r remaining flow. This is a Stackelberg Scheduling Instance(M,r,&alpha;),0&le;&alpha;&le;1. It was shown [T. Roughgarden, Stackelberg scheduling strategies, in: 33rd Annual Symposium on Theory of Computing, STOC, 2001, pp. 104-113] that it is weakly NP-hard to compute the optimal Leader's strategy. For any such network M we efficiently compute the minimum portion @b"M of flow r>0 needed by a Leader to induce M's optimum cost, as well as her optimal strategy. This shows that the optimal Leader's strategy on instances (M,r,@a>=@b"M) is in P. Unfortunately, Stackelberg routing in more general nets can be arbitrarily hard. Roughgarden presented a modification of Braess's Paradox graph, such that no strategy controlling &alpha;r flow can induce &le;1/&alpha; times the optimum cost. However, we show that our main result also applies to any s-t net G. We take care of the Braess's graph explicitly, as a convincing example. Finally, we extend this result to k commodities. A conference version of this paper has appeared in [A. Kaporis, P. Spirakis, The price of optimum in stackelberg games on arbitrary single commodity networks and latency functions, in: 18th annual ACM symposium on Parallelism in Algorithms and Architectures, SPAA, 2006, pp. 19-28]. Some preliminary results have also appeared as technical report in [A.C. Kaporis, E. Politopoulou, P.G. Spirakis, The price of optimum in stackelberg games, in: Electronic Colloquium on Computational Complexity, ECCC, (056), 2005].
Some practical experiences with the Pascal language
Authors: G. G. Gustafson, T. A. Johnson, G. S. Key
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

In 1976 the Naval Ocean Systems Center (NOSC) initiated the BIODAB project to determine if a high performance relational DBMS could be developed to support scientific applications.
Type I and type II fractional Brownian motions: A reconsideration
Authors: James Davidson, Nigar Hashimzade
Venue: Computational Statistics Data Analysis (2009)

The so-called type I and type II fractional Brownian motions are limit distributions associated with the fractional integration model in which pre-sample shocks are either included in the lag structure, or suppressed. There can be substantial differences between the distributions of these two processes and of functionals derived from them, so that it becomes an important issue to decide which model to use as a basis for inference. Alternative methods for simulating the type I case are contrasted, and for models close to the nonstationarity boundary, truncating infinite sums is shown to result in a significant distortion of the distribution. A simple simulation method that overcomes this problem is described and implemented. The approach also has implications for the estimation of type I ARFIMA models, and a new conditional ML estimator is proposed, using the annual Nile minima series for illustration.
A network model for the intelligent marine container tracking
Authors: Abbas Asosheh, Arash Afshinfar, Mahmoud Kharrat, Naghmeh Ramezani
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

Nowadays companies are putting more and more emphasis on making their supply chains, leaner and leaner. From a supply chain perspective carriers and shippers are always looking to increase their profitability and Container Tracking (CT) assists them in reducing their costs and saves their time regarding customer service improvement. On the other hand, every consignee needs to be informed of the last position and situation of his/her cargo. In this paper different methods in cargo tracking in shipping companies based on Satellite, Radio Frequency Identifier (RFID), and Global System for Mobile communications (GSM) will be discussed. Eventually an End to End integrated and intelligent tracking method will be introduced regarding to customers' requests and needs. The availability and cost of the different methods and customer requirements in the proposed model are key parameters. According to this model an expedite and efficient, End to End, container cargos from first stage (Release to shipper) to the last stage (Return by consignee) in destination will be considered.
Behavioral Animation Model for Real-Time Crowd Simulation
Authors: He Xiao, Chunlin He
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

We present a generic model which can handle different aspects of crowd simulation and provide the animator with the ability to author different scenarios. In our model, we adopt multi-level behavior hierarchy based on rules, finite state machines (FSM) for controlling groups’ or agents’ behavior, which can provide simple crowd behaviors, as well as complex ones. At the same time, behaviors can be both programmed and autonomous, also composed on the fly for enabling agents respond to changing environment appropriately. We demonstrate our model through manifest the crowd simulation including the predator and prey flocks.
Robust principal axes determination for point-based shapes using least median of squares
Authors: Yu-Shen Liu, Karthik Ramani
Venue: Computer-Aided Design (2009)

A robust technique for determining the principal axes of a 3D shape represented by a point set, possibly with noise, is presented. We use techniques from robust statistics to guide the classical principal component analysis (PCA) computation. Our algorithm is based on a robust statistics method: least median of squares (LMS), for outlier detection. Using this method, an outlier-free major region of the shape is extracted, which ignores the effect on other minor regions regarded as the outliers of the shape. In order to effectively approximate the LMS optimization, the forward search technique is utilized. We start from a small outlier-free subset robustly chosen as the major region, where an octree is used for accelerating computation. Then the region is iteratively increased by adding samples at a time. Finally, by treating the points on minor regions as outliers, we are able to define the principal axes of the shape as one of the major region. One of the advantages of our algorithm is that it automatically disregards outliers and distinguishes the shape as the major and minor regions during the principal axes determination without any extra segmentation procedure. The presented algorithm is simple and effective and gives good results for point-based shapes. The application on shape alignment is considered for demonstration purpose.
Transformational government: basics and key issues
Authors: Marijn Janssen, William S. Shu
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

So far, the transformation of public administration has been limited, with technology simply reinforcing its current structures. However, to realize adaptive, transparent, accountable, efficient and agile government providing demand-driven service provisioning at low cost, more radical changes are needed. In this light therefore, transformational government has often been identified as the next challenge for e-government. This tutorial and workshop are aimed at contributing to the understanding of the scope of the issues in transformational government and approaches to transformation. In the tutorial an overview of transformational government basics is given which covers the whole range, from governance and organization to technology and implementation. During the workshop four papers will be presented, complemented by a discussion of the transformational aspects of e-governments. The papers consider a devolution reference model for e-governance, adaptability through strategic IT planning, and applications linked to community-based poverty reduction and tax administration.
Multivariate order statistics via multivariate concomitants
Authors: Barry C. Arnold, Enrique Castillo, José María Sarabia
Venue: Journal of Multivariate Analysis (2009)

Let X@?"1,...,X@?"n denote a set of n independent identically distributed k-dimensional absolutely continuous random variables. A general class of complete orderings of such random vectors is supplied by viewing them as concomitants of an auxiliary random variable. The resulting definitions of multivariate order statistics subsume and extend orderings that have been previously proposed such as norm ordering and N-conditional ordering. Analogous concepts of multivariate record values and multivariate generalized order statistics are also described.
On the modeling of resistance in graphene nanoribbon (GNR) for future interconnect applications
Authors: Tamer Ragheb, Yehia Massoud
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

In this paper, we present a comprehensive model for the resistance in graphene nanoribbon (GNR) interconnects. We use the recent experimental and theoretical results to model the impact of stacking of graphene layers in multi-layer GNR interconnects. We compare the resistance of GNR interconnects with both single-walled carbon nanotube (SWCNT) bundle interconnects and conventional copper interconnects. Our simulation results demonstrate the performance superiority of multi-layer GNR interconnects over conventional copper interconnects at small widths (< 15 nm). Consequently, multi-layer GNR interconnects demonstrate a great potential to replace conventioanl copper interconnects in future technologies.
A Flash-Based Mobile Learning System for Learning English as Second Language
Authors: Firouz B. Anaraki
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

This paper explains the development of a Flash-Based mobile learning system for learning English as a second language (FML4ESL). Adobe Flash CS3 was used to develop this system which works on smart mobile phones and PDAs that support Adobe Flash Lite. Twelve English lessons were developed for this system. University students at Assumption University tried out this system using their mobile devices for a period of 4 weeks. A pretest, posttest, and surveys were used to evaluate the effectiveness and usability of this system.
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
Authors: Eduardo Mesa Barrameda, Shantanu Das, Nicola Santoro
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

We consider the problem of uniformly dispersing mobile robotic sensors in a simply connected orthogonal space of unknown shape. The mobile sensors are injected into the space from one or more entry points and rely only on sensed local information within a restricted radius. Unlike the existing solution, we allow the sensors to be asynchronous and show how, even in this case, the sensors can uniformly fill the unknown space, avoiding any collisions and without using any explicit communication, endowed with only O(1) bits of persistent memory and O(1) visibility radius. Our protocols are memory- and radius- optimal; in fact, we show that filling is impossible without persistent memory (even if visibility is unlimited); and that it is impossible with less visibility than that used by our algorithms (even if memory is unbounded).
Mosfet Modeling for Circuit Analysis And Design
Authors: Marcio C. Schneider
Venue:  (2007)

This is the first book dedicated to the next generation of MOSFET models. Addressed to circuit designers with an in-depth treatment that appeals to device specialists, the book presents a fresh view of compact modeling, having completely abandoned the regional modeling approach.
Task Muddiness, Intelligence Metrics, and the Necessity of Autonomous Mental Development
Authors: Juyang Weng
Venue: Minds and Machines (2009)

This paper introduces a concept called task muddiness as a metric for higher intelligence. Task muddiness is meant to be inclusive and expendable in nature. The intelligence required to execute a task is measured by the composite muddiness of the task described by multiple muddiness factors. The composite muddiness explains why many challenging tasks are muddy and why autonomous mental development is necessary for muddy tasks. It facilitates better understanding of intelligence, what the human adult mind can do, and how to build a machine to acquire higher intelligence. The task-muddiness indicates a major reason why a higher biological mind is autonomously developed from autonomous, simple-to-complex experience. The paper also discusses some key concepts that are necessary for understanding the mind and intelligence, such as intelligence metrics, the mode a task is conveyed to the task executor, a human and a machine being a joint task performer in the traditional artificial intelligence (AI), a developmental agent (human or machine) being a sole task performer, and the need for autonomy in task-nonexplicit learning.
A P-Lingua Programming Environment for Membrane Computing
Authors: Daniel Díaz-Pernil, Ignacio Pérez-Hurtado, Mario J. Pérez-Jiménez, Agustín Riscos-Núñez
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

A new programming language for membrane computing, P-Lingua, is developed in this paper. This language is not designed for a specific simulator software. On the contrary, its purpose is to offer a general syntactic framework that could define a unified standard for membrane computing, covering a broad variety of models. At the present stage, P-Lingua can only handle P systems with active membranes, although the authors intend to extend it to other models in the near future.P-Lingua allows to write programs in a friendly way, as its syntax is very close to standard scientific notation, and parameterized expressions can be used as shorthand for sets of rules. There is a built-in compiler that parses these human-style programs and generates XML documents that can be given as input to simulation tools, while different plugins can be designed to produce specific adequate outputs for existing simulators.Furthermore, we present in this paper an integrated development environment that plays the role of an interface where P-Lingua programs can be written and compiled. We also present a simulator for the class of recognizer P systems with active membranes, and we illustrate it by following the writing, compiling and simulating processes with a family of P systems solving the SAT problem.
Identification of the parameters of a convection diffusion system
Authors: I. V. Sergienko, V. S. Deineka
Venue: Cybernetics and Systems Analysis (2009)

Computational algorithms are proposed for the realization of gradient methods based on the solution of direct and conjugate problems in weak formulations for some complex inverse problems of the recovery of parameters of multicomponent parabolic distributed systems. The approach proposed makes it unnecessary to set up Lagrange functionals in explicit form and to use the Green function.
A Dynamic Orchestration Model for Future Internet Applications
Authors: Giuseppe Avellino, Mike Boniface, Barbara Cantalupo, Justin Ferris, Nikolaos Matskanis, Bill Mitchell, Mike Surridge
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

Society and business are demanding systems that can securely and cost-effectively exploit opportunities presented by an Internet of Services. To achieve this goal a system must dynamically adapt to its environment and consider multiple and shifting stakeholder concerns such as application functionality, policies and business processes. In this paper we describe a dynamic orchestration model called the Virtual Infrastructure Model (VIM) which allows consumers to develop service-oriented systems that adapt to the needs of different business actors. It is based on the idea that adaptive workflow and dynamic binding to services can facilitate abstraction of both business processes and requisite interactions with the underlying infrastructure. Key requirements for federated orchestration are addressed including runtime service binding, secure and accountable dynamic procurement, infrastructure adaption, and separation of stakeholder concerns. The VIM is a fundamental component of the Next Generation Grid Architecture developed in the context of the EU funded NextGRID project.
Interval type-2 fuzzy membership function generation methods for pattern recognition
Authors: Byung-In Choi, Frank Chung-Hoon Rhee
Venue: Information Sciences: an International Journal (2009)

Type-2 fuzzy sets (T2 FSs) have been shown to manage uncertainty more effectively than T1 fuzzy sets (T1 FSs) in several areas of engineering [4,6-12,15-18,21-27,30]. However, computing with T2 FSs can require undesirably large amount of computations since it involves numerous embedded T2 FSs. To reduce the complexity, interval type-2 fuzzy sets (IT2 FSs) can be used, since the secondary memberships are all equal to one [21]. In this paper, three novel interval type-2 fuzzy membership function (IT2 FMF) generation methods are proposed. The methods are based on heuristics, histograms, and interval type-2 fuzzy C-means. The performance of the methods is evaluated by applying them to back-propagation neural networks (BPNNs). Experimental results for several data sets are given to show the effectiveness of the proposed membership assignments.