ppxscal/embedding_network huggingface dataset:
Using One-Way Chains to Provide Message Authentication without Shared Secrets
Authors: Bogdan Groza
Venue: Proceedings of the Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (2006)

The objective of this paper is to propose a cryptographic protocol which provides authenticity in the exchange of information between two entities without using any shared secret and by using only oneway chains. Such a protocol may have many applications and may be of interest especially in constrained environments where computational power is limited since one-way chains may be constructed using some of the simplest cryptographic one-way functions. We propose and investigate two approaches based on one-way chains, which we call: delayed message authentication and direct message authentication. Both of them have some shortcomings and a final hybrid approach, which combines their advantages without inheriting their weaknesses, appears to be quite useful and effective.
Modular Subdivisions of Dolphin Insular Cortex: Does Evolutionary History Repeat Itself?
Authors: Paul Manger, Monika Sum, Michael Szymanski, Sam Ridgway, Leah Krubitzer
Venue: Journal of Cognitive Neuroscience (1998)

The structural organization of the insular cortex in the bottlenose dolphin was investigated by examining Nissl- and myelin-stained tissue that was sectioned coronally and tangentially. An uneven distribution of cell clusters that coincided with myelin-light zones was observed in layer II. When the present observations were compared to descriptions of modules in other animals, we found that the range of module size is restricted, while the size of the brain, particularly the neo cortex, varies dramatically.Indeed, despite the tremendous expansion of the cetacean neocortex, the size of the modules in the insular cortex is similar to that described for small-brained mammals like the mouse, suggesting that module size is evolutionarily stable across species. Selection for optimal-size processing units, in terms of the lengths of connections within and between them, is a likely source of this stability.
Reading in a Regular Orthography: An fMRI Study Investigating the Role of Visual Familiarity
Authors: Anja Ischebeck, Peter Indefrey, Nobuo Usui, Izuru Nose, Frauke Hellwig, Masato Taira
Venue: Journal of Cognitive Neuroscience (2004)

In order to separate the cognitive processes associated with phonological encoding and the use of a visual word form lexicon in reading, it is desirable to compare the processing of words presented in a visually familiar form with words in a visually unfamiliar form. Japanese Kana orthography offers this possibility. Two phonologically equivalent but visually dissimilar syllabaries allow the writing of, for example, foreign loanwords in two ways, only one of which is visually familiar. Familiarly written words, unfamiliarly written words, and pseudowords were presented in both Kana syllabaries (yielding six conditions in total) to participants during an fMRI measurement with a silent articulation task (Experiment 1) and a phonological lexical decision task (Experiment 2) using an event-related design. Consistent over two experimental tasks, the three different stimulus types (familiar, unfamiliar, and pseudoword) were found to activate selectively different brain regions previously associated with phonological encoding and word retrieval or meaning. Compatible with the predictions of the dual-route model for reading, pseudowords and visually unfamiliar words, which have to be read using phonological assembly, caused an increase in brain activity in left inferior frontal regions (BA 44/47), as compared to visually familiar words. Visually familiar and unfamiliar words were found to activate a range of areas associated with lexico-semantic processing more strongly than pseudowords, such as the left and right temporo-parietal region (BA 39/40), a region in the left middle/inferior temporal gyrus (BA 20/21), and the posterior cingulate (BA 31).
Crane double cycling in container ports: algorithms, evaluation, and planning
Authors: Carlos Daganzo
Venue:  (2005)

Loading ships as they are unloaded (double-cycling) can improve the efficiency of a quay crane and container port. This dissertation describes the double-cycling problem, and presents solution algorithms and simple formulae to estimate benefits. In Chapter 2 we focus on reducing the number of operations necessary to turn around a ship. First an intuitive lower bound is developed. We then present a greedy algorithm that was developed based on the physical properties of the problem and yields a tight upper bound. The formula for an upper bound on the greedy algorithm's performance can be used to accurately predict crane performance. The problem is also formulated as a scheduling problem, which can be solved optimally using Johnson's rule. The problem is extended to include an analysis of double-cycling when ships have deck hatches. In Chapter 3 we consider at the longer term impact of double cycling on port operations including crane, vessel, and berth productivity. We use another double cycling sequence that is operationally convenient, easy to model, and nearly optimum. We compare the performance of this sequence to those determined by a greedy algorithm, and Johnson's rule. A framework is developed for analysis, and a simple formula is developed to predict the longer term impact on turn around time. The formula is an accurate predictor of performance. We then show that double cycling can reduce the requirements for landside vehicles and drivers. We also comment on strategies for altering port operations to support double cycling such as segmenting vessel storage, and streamlining traffic flows. We show that double cycling can reduce the amount of time required to complete vessel loading and unloading operations by 10%, improving vessel, crane, and berth productivity. It can reduce by about 20% the requirement for landside vehicles and drivers. Further, for wheeled operations, we suggest a method to reduce the requirement for chassis by about 25%. In Chapter 4 we consider somewhat broader issues, including the interaction of double cycling and security regulations, as well as ship design and routing. We estimate the financial impact of the these benefits, which total approximately $70.00 per container moved, and address obstacles to implementation. The research demonstrates that double cycling can create significant efficiency gains in vessel, crane, and berth productivity while simplifying some aspects of port operations. We also offer an explanation as to why a method that offers such significant benefits at low cost has not been rapidly adopted. We demonstrate that complementary analytical methods can be used to gain broad insight, and that simple, general models, are often of more value than more complex, detailed models.
A method for access authorisation through delegation networks
Authors: Audun Jøsang, Dieter Gollmann, Richard Au
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

Owners of systems and resources usually want to control who can access them. This must be based on having a process for authorising certain parties, combined with mechanisms for enforcing that only authorised parties are actually able to access those systems and resources. In distributed systems, the authorisation process can include negative authorisation (e.g. black listing), and delegation of authorisation rights, which potentially can lead to conflicts. This paper describes a method for giving authorisations through a delegation network, and where each delegation and authorisation is expressed in the form of a belief measure. An entity's total authorisation for a given resource object and access type can be derived by analysing the delegation network using subjective logic. Access decisions are made by comparing the derived authorisation measure with required threshold levels, which makes authorisations non-categorical. By setting the threshold level higher than the assigned measure of a single authorisation, it is possible to require multiple authorisations for accessing specifc resources. The model is simple, intuitive and algebraic.
Viewpoint Tour Mechanism Based on Resource Space View
Authors: Jin Liu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Based on the Resource Space Model, this paper proposes a view mechanism for finding and reusing legacy Resource Spaces according to users' idiosyncratic resource interests. It establishes flexible restructuring mechanism of legacy Resource Spaces in the distributed interconnection environment. As a viewpoint organization strategy, the resource subject tree is proposed as an effective way for discovering desired resource space views. A case study of the proposed approach is presented.
Relations between the Neural Bases of Dynamic Auditory Processing and Phonological Processing: Evidence from fMRI
Authors: Russell A. Poldrack, Elise Temple, Athanassios Protopapas, Srikantan Nagarajan, Paula Tallal, Michael Merzenich, John D. E. Gabrieli
Venue: Journal of Cognitive Neuroscience (2001)

Functional magnetic resonance imaging (fMRI) was used to examine how the brain responds to temporal compression of speech and to determine whether the same regions are also involved in phonological processes associated with reading. Recorded speech was temporally compressed to varying degrees and presented in a sentence verification task. Regions involved in phonological processing were identified in a separate scan using a rhyming judgment task with pseudowords compared to a lettercase judgment task. The left inferior frontal and left superior temporal regions (Broca's and Wernicke's areas), along with the right inferior frontal cortex, demonstrated a convex response to speech compression; their activity increased as compression increased, but then decreased when speech became incomprehensible. Other regions exhibited linear increases in activity as compression increased, including the middle frontal gyri bilaterally. The auditory cortices exhibited compression-related decreases bilaterally, primarily reflecting a decrease in activity when speech became incomprehensible. Rhyme judgments engaged two left inferior frontal gyrus regions (pars triangularis and pars opercularis), of which only the pars triangularis region exhibited significant compression-related activity. These results directly demonstrate that a subset of the left inferior frontal regions involved in phonological processing is also sensitive to transient acoustic features within the range of comprehensible speech.
Modelling layer 2 and layer 3 device bandwidths using B-node theory
Authors: S. Cikara, S. P. Maj, D. T. Shaw
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist to measure and/or predict these performance characteristics. "Rule-of-Thumb" is subjective and based on prior experience, typically offering little mathematical rigour. Benchmarks use different scales and units, with comparative results possibly requiring further interpretation. Stochastic modelling uses complex mathematics which can be problematic and difficult to understand and conceptualise to the typical network administrator. As such, the specific technique employed depends on the problem domain and the cost of getting it wrong.Bandwidth-Nodes (B-Nodes) are a high-level bandwidth-centric abstraction used to de-couple and control the complexity of a particular technology from the underlying implementation. Devices and/or technologies can be modelled as an individual node or as a collection of nodes, describing the overall function and interactions between both the sub-systems and the operating environment.This paper uses a simple, common measurement method to calculate the theoretical maximum bandwidth of a single and/or collection of B-Nodes. It demonstrates that the efficiency of B-Nodes can be decomposed and shown as a product of all efficiencies contained within that node. Sub-optimal operation and device efficiency and its effect on bandwidth is also introduced. These are empirically validated and incorporated into the B-Node formula, allowing the bandwidth of a network to be calculated to a first approximation for a variety of devices and technologies. Hence, the anticipated performance of a network given a technical specification can be easily and quickly determined.
Application of A Remote Surveillance System with Mobile Phone-Enhanced User Interface
Authors: Yoshiro Imai, Yuichi Sugiue, Yukio Hori, Shin'ichi Masuda
Venue: Proceedings of the International Conference on Mobile Business (2006)

A surveillance system has been developed to apply into many fields. Services of the system are available for clients with not only PCs but also mobile devices, especially cellular phones. Our system will provide remote monitoring facilities as well as remote controlling ones. With services of remote controlling camera, clients can take a suitable look at target objects through adjustment of network camera. The system is evaluated on the viewpoint of response time between server of the system and cellular phone of mobile client. Both of remote monitoring facility and controlling one are measured so that they will be suitable enough for clients to operate their appliances by means of remote controlling facility after they take looks at external states of the target appliances. Applications of our surveillance system is reported such as remote monitoring service of school for distant parents and remote reservation service of stores for daily customers. With our surveillance system, the above applications will be useful and fruitful for customers as well as employer of system, namely, service provider of those applications.
Mobile Agent Architecture Integration for a Wireless Sensor Medical Application
Authors: John Herbert, John O'Donoghue, Gao Ling, Kai Fei, Chien-Liang Fok
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Wireless sensor nodes are used to monitor patient vital signs in a medical application. To ensure proper patient care is provided, real-time patient data must be managed correctly in the context of relevant patient information and medical knowledge. The Data Management System (DMS) is an agent-based architecture that aims to provide flexible, effective data management within a Wireless Patient Sensor Network (WPSN). The DMS is built primarily on the sophisticated JADE agent platform. JADE runs on resource-rich platforms such as servers, PCs, PDAs and high-end mobile phones. The lightweight Agilla agent platform can run on resource constrained sensor nodes. An integrated mobile agent based architecture combining Jade and Agilla is presented. This makes best use of the more sophisticated agent platform for high-level functionality and the lighter agent middleware for low-level sensor data collection. The resulting system is a unified agent architecture that runs on heterogeneous platforms on a wireless network.
Exploiting general coefficient representation for the optimal sharing of partial products in MCMs
Authors: Eduardo Costa, Paulo Flores, José Monteiro
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

We propose a new algorithm that maximizes he sharing of partial terms in Multiple Cons an Multiplication (MCM) operations under a general number representation for the coefficients. MCM operations are required by many algorithms in digital signal processing and have been the subject of extensive research. By making no assumptions as to the number representation, the algorithm described in his paper is able to perform a better search for the optimal sharing of partial terms than previous methods based on MSD or CSD representations. We have applied our algorithm for the hardware minimization of FIR filers.The results show that we can ob ain solutions that require between 20% to 50% less hardware when compared agains he solutions using he MSD representation.
Decentralized Consistency Checking in Cross-organizationalWorkflows
Authors: Andreas Wombacher
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Service Oriented Architectures facilitate loosely coupled composed services, which are established in a decentralized way. One challenge for such composed services is to guarantee consistency, i.e., deadlock-freeness. This paper presents a decentralized approach to consistency checking, which utilizes only bilateral views of the composed service based on a synchronous communication model.
Supporting Mobile Language Learning outside Classrooms
Authors: Hiroaki Ogata, Chengjiu Yin, Rosa G. Paredes J., Nobuji A. Saito, Yoneo Yano, Yasuko Oishi, Takahito Ueda
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The continuous development of wireless and mobile technologies has allowed the creation of an additional platform for supporting learning, one that can be embedded in the same physical space in which the learning is taking place. This paper describes a computer supported ubiquitous learning environment for language learning, called LOCH (Languagelearning Outside the Classroom with Handhelds). In the environment, the teacher assigns field activities to the students, who go around the town to fulfill them and share their individual experiences. The main aim of this project, called One Day Trip with PDA, was to integrate the knowledge acquired in the classroom and the real needs of the students in their daily life.
Modes of the homogeneous chain dynamics
Authors: Katica Hedrih
Venue: Signal Processing (2006)

This paper presents a study of modes of homogeneous mechanical chain dynamics for different kinds of homogenous connection between material mass particles in the chain, and by different chain boundary conditions. The application of these results for describing of mechanical properties of real materials is very useful. Also, by using phenomenological maps and mathematical analogy, and the previous study of modes of the homogeneous mechanical chain dynamics, it is possible to present a study of modes of the homogeneous mechanical multiplate or multibeam complex sandwich system dynamics. The finite number of coupled fractional-order differential equations of creep vibrations of a creeping connected multimaterial particle homogeneous chain system have been derived. The material particles are constrained by standard creep light elements. The constitutive relations of a stress-strain state of the standard creep light elements are expressed through members of the fractional-order derivatives. By using Laplace transform method, the Laplace transform of the analytical solution of system coupled fractional-differential equations of corresponding dynamical free creep dynamical processes are obtained. Also, by using trigonometric method system determinants are obtained in the suitable form for application to the inverse Laplace transforms.By using inverse Laplace transform, time series functions are obtained as a particular mode component. By using visualization of these separated components, an analysis of the dynamical creep component processes in material particle displacements has been achieved. Also, an analysis and comparison between signals in the corresponding homogeneous chains with ideal elastic or viscoelastic standard light elements between material particles are pointed out.
Prediction-Based QoS Management for Real-Time Data Streams
Authors: Yuan Wei, Vibha Prasad, Sang H. Son, John A. Stankovic
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

With the emergence of large wired and wireless sensor networks, many real-time applications need to operate on continuous unbounded data streams. At the same time, many of these systems have inherent timing constraints. Providing deadline guarantees for queries over dynamic data streams is a challenging problem due to bursty data stream arrival rates and time-varying stream contents. In this paper, we propose a predictionbased Quality-of-Service (QoS) management scheme for periodic queries over dynamic data streams. Our QoS management scheme features novel query workload estimators, which predict the query workload using execution time profiling and input data sampling, and adjusts the query QoS levels based on online query execution time prediction. We implement our QoS management algorithm on a real-time data stream query system prototype called RTStream. Our experimental evaluation of the scheme shows that our query workload estimator performs very well even with workload fluctuations and our QoS management scheme yields better overall system utility than the existing approaches for QoS management.
Accelerating private-key cryptography via multithreading on symmetric multiprocessors
Authors: P. Dongara, T. N. Vijaykumar
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

Achieving high performance in cryptographic processing is important due to the increasing connectivity among today's computers. Despite steady improvements in microprocessor and system performance, private-key cipher implementations continue to be slow. Irrespective of the cipher used, the main reason for the low performance is lack of parallelism, which fundamentally comes from encryption modes such as the Cipher Block Chaining (CBC) mode. In CBC, each plaintext block is XOR'ed with the previous ciphertext block and then encrypted, essentially inducing a tight recurrence through the ciphertext blocks. To deliver high performance while maintaining high level of security assurance in real systems, the cryptography community has proposed Interleaved Cipher Block Chaining (ICBC) mode. In four-way interleaved chaining, the first, fifth, and every fourth block thereafter are encrypted in CBC mode; the second, sixth, and every fourth block thereafter are encrypted as another stream, and so on. Thus, interleaved chaining loosens the recurrence imposed by CBC, enabling the multiple encryption streams to be overlapped. The number of interleaved chains can be chosen to balance performance and adequate chaining to get good data diffusion. While ICBC was originally proposed to improve hardware encryption rates by employing multiple encryption chips in parallel, this is the first paper to evaluate ICBC via multithreading commonly-used ciphers on a symmetric multiprocessor (SMP). ICBC allows exploiting the full processing power of SMPs, which spend many cycles in cryptographic processing as medium-scale servers today, and will do so as chip-multiprocessor clients in the future. Using the Wisconsin Wind Tunnel II, we show that our multithreaded ciphers achieve encryption rates of 92 Mbytes/s on a 16-processor SMP at 1 GHz, reaching a factor of almost 10 improvement oiler a uniprocessor, which achieves 9 Mbytes/s.
A unitary Hessenberg QR-based algorithm via semiseparable matrices
Authors: Luca Gemignani
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, we present a novel method for solving the unitary Hessenberg eigenvalue problem. In the first phase, an algorithm is designed to transform the unitary matrix into a diagonal-plus-semiseparable form. Then we rely on our earlier adaptation of the QR algorithm to solve the dpss eigenvalue problem in a fast and robust way. Exploiting the structure of the problem enables us to yield a quadratic time using a linear memory space. Nonetheless the algorithm remains robust and converges as fast as the customary QR algorithm. Numerical experiments confirm the effectiveness and the robustness of our approach.