To see the other types of publications on this topic, follow the link: Partial structure representations.
Journal articles on the topic 'Partial structure representations'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Partial structure representations.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Lee, Sang Hun, and Kunwoo Lee. "Partial Entity Structure: A Compact Boundary Representation for Non-Manifold Geometric Modeling." Journal of Computing and Information Science in Engineering 1, no. 4 (November 1, 2001): 356–65. http://dx.doi.org/10.1115/1.1433486.
Full textAbstract:
Non-manifold boundary representations have become very popular in recent years and various representation schemes have been proposed, as they represent a wider range of objects, for various applications, than conventional manifold representations. As these schemes mainly focus on describing sufficient adjacency relationships of topological entities, the models represented in these schemes occupy storage space redundantly, although they are very efficient in answering queries on topological adjacency relationships. To solve this problem, in this paper, we propose a compact as well as fast non-manifold boundary representation, called the partial entity structure. This representation reduces the storage size to half that of the radial edge structure, which is one of the most popular and efficient of existing data structures, while allowing full topological adjacency relationships to be derived without loss of efficiency. In order to verify the time and storage efficiency of the partial entity structure, the time complexity of basic query procedures and the storage requirement for typical geometric models are derived and compared with those of existing schemes.
2
Trapani, Camillo. "UnboundedC*-seminorms, biweights, and*-representations of partial*-algebras: A review." International Journal of Mathematics and Mathematical Sciences 2006 (2006): 1–34. http://dx.doi.org/10.1155/ijmms/2006/79268.
Full textAbstract:
The notion of (unbounded)C*-seminorms plays a relevant role in the representation theory of*-algebras and partial*-algebras. A rather complete analysis of the case of*-algebras has given rise to a series of interesting concepts like that of semifiniteC*-seminorm and spectralC*-seminorm that give information on the properties of*-representations of the given*-algebraAand also on the structure of the*-algebra itself, in particular whenAis endowed with a locally convex topology. Some of these results extend to partial*-algebras too. The state of the art on this topic is reviewed in this paper, where the possibility of constructing unboundedC*-seminorms from certain families of positive sesquilinear forms, called biweights, on a (partial)*-algebraAis also discussed.
3
Mlinar, Vladan. "Constraints on nanomaterial structure from experiment and theory: reconciling partial representations." Materials Research Express 2, no. 1 (January 2, 2015): 015015. http://dx.doi.org/10.1088/2053-1591/2/1/015015.
Full text
4
Wang, Jing, Atsushi Suzuki, Linchuan Xu, Feng Tian, Liang Yang, and Kenji Yamanishi. "Orderly Subspace Clustering." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 5264–72. http://dx.doi.org/10.1609/aaai.v33i01.33015264.
Full textAbstract:
Semi-supervised representation-based subspace clustering is to partition data into their underlying subspaces by finding effective data representations with partial supervisions. Essentially, an effective and accurate representation should be able to uncover and preserve the true data structure. Meanwhile, a reliable and easy-to-obtain supervision is desirable for practical learning. To meet these two objectives, in this paper we make the first attempt towards utilizing the orderly relationship, such as the data a is closer to b than to c, as a novel supervision. We propose an orderly subspace clustering approach with a novel regularization term. OSC enforces the learned representations to simultaneously capture the intrinsic subspace structure and reveal orderly structure that is faithful to true data relationship. Experimental results with several benchmarks have demonstrated that aside from more accurate clustering against state-of-the-arts, OSC interprets orderly data structure which is beyond what current approaches can offer.
5
Sun, Hanlin, Wei Jie, Jonathan Loo, Liang Chen, Zhongmin Wang, Sugang Ma, Gang Li, and Shuai Zhang. "Network Representation Learning Enhanced by Partial Community Information That Is Found Using Game Theory." Information 12, no. 5 (April 25, 2021): 186. http://dx.doi.org/10.3390/info12050186.
Full textAbstract:
Presently, data that are collected from real systems and organized as information networks are universal. Mining hidden information from these data is generally helpful to understand and benefit the corresponding systems. The challenges of analyzing such data include high computational complexity and low parallelizability because of the nature of complicated interconnected structure of their nodes. Network representation learning, also called network embedding, provides a practical and promising way to solve these issues. One of the foremost requirements of network embedding is preserving network topology properties in learned low-dimension representations. Community structure is a prominent characteristic of complex networks and thus should be well maintained. However, the difficulty lies in the fact that the properties of community structure are multivariate and complicated; therefore, it is insufficient to model community structure using a predefined model, the way that is popular in most state-of-the-art network embedding algorithms explicitly considering community structure preservation. In this paper, we introduce a multi-process parallel framework for network embedding that is enhanced by found partial community information and can preserve community properties well. We also implement the framework and propose two node embedding methods that use game theory for detecting partial community information. A series of experiments are conducted to evaluate the performance of our methods and six state-of-the-art algorithms. The results demonstrate that our methods can effectively preserve community properties of networks in their low-dimension representations. Specifically, compared to the involved baselines, our algorithms behave the best and are the runners-up on networks with high overlapping diversity and density.
6
Fitzgerald, D. G., and Jonathan Leech. "Dual symmetric inverse monoids and representation theory." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 64, no. 3 (June 1998): 345–67. http://dx.doi.org/10.1017/s1446788700039227.
Full textAbstract:
AbstractThere is a substantial theory (modelled on permutation representations of groups) of representations of an inverse semigroup S in a symmetric inverse monoid Ix, that is, a monoid of partial one-to-one selfmaps of a set X. The present paper describes the structure of a categorical dual Ix* to the symmetric inverse monoid and discusses representations of an inverse semigroup in this dual symmetric inverse monoid. It is shown how a representation of S by (full) selfmaps of a set X leads to dual pairs of representations in Ix and Ix*, and how a number of known representations arise as one or the other of these pairs. Conditions on S are described which ensure that representations of S preserve such infima or suprema as exist in the natural order of S. The categorical treatment allows the construction, from standard functors, of representations of S in certain other inverse algebras (that is, inverse monoids in which all finite infima exist). The paper concludes by distinguishing two subclasses of inverse algebras on the basis of their embedding properties.
7
BEN-ASHER, YOSI, and EITAN FARCHI. "COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS." International Game Theory Review 07, no. 01 (March 2005): 73–90. http://dx.doi.org/10.1142/s0219198905000399.
Full textAbstract:
We introduce a new zero-sum matrix game for modeling search in structured domains. In this game, one player tries to find a "bug" while the other tries to hide it. Both players exploit the structure of the "search" domain. Intuitively, this search game is a mathematical generalization of the well known binary search. The generalization is from searching over totally ordered sets to searching over more complex search domains such as trees, partial orders and general set systems. As there must be one row for every search strategy, and there are exponentially many ways to search even in very simple search domains, the game's matrix has exponential size ("space"). In this work we present two ways to reduce the space required to compute the Nash value (in pure strategies) of this game: • First we show that a Nash equilibrium in pure strategies can be computed by using a backward induction on the matrices of each "part" or sub structure of the search domain. This can significantly reduce the space required to represent the game. • Next, we show when general search domains can be represented as DAGs (Directed Acycliqe Graphs). As a result, the Nash equilibrium can be directly computed using the DAG. Consequently the space needed to compute the desired search strategy is reduced to O(n2) where n is the size of the search domain.
8
BEN-ASHER, YOSI, and EITAN FARCHI. "COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS." International Game Theory Review 07, no. 02 (June 2005): 171–88. http://dx.doi.org/10.1142/s0219198905000478.
Full textAbstract:
We introduce a new zero-sum matrix game for modeling search in structured domains. In this game, one player tries to find a "bug" while the other tries to hide it. Both players exploit the structure of the "search" domain. Intuitively, this search game is a mathematical generalization of the well known binary search. The generalization is from searching over totally ordered sets to searching over more complex search domains such as trees, partial orders and general set systems. As there must be one row for every search strategy, and there are exponentially many ways to search even in very simple search domains, the game's matrix has exponential size ("space"). In this work we present two ways to reduce the space required to compute the Nash value (in pure strategies) of this game: • First we show that a Nash equilibrium in pure strategies can be computed by using a backward induction on the matrices of each "part" or sub structure of the search domain. This can significantly reduce the space required to represent the game. • Next, we show when general search domains can be represented as DAGs (Directed Acycliqe Graphs). As a result, the Nash equilibrium can be directly computed using the DAG. Consequently the space needed to compute the desired search strategy is reduced to O(n2) where n is the size of the search domain.
9
Burla, M. C., M. Camalli, G. Cascarano, C. Giacovazzo, G. Polidori, R. Spagna, and D. Viterbo. "SIR88 – a direct-methods program for the automatic solution of crystal structures." Journal of Applied Crystallography 22, no. 4 (August 1, 1989): 389–93. http://dx.doi.org/10.1107/s0021889889004103.
Full textAbstract:
SIR88 is an integrated package of computer programs for the solution of crystal structures. The package is based on the estimation of one- and two-phase structure seminvariants and three- and four-phase structure invariants according to the theory of representations [Giacovazzo (1977). Acta Cryst. A33, 933–944; (1980). Acta Cryst. A36, 362–372]. The program works in all the space groups and in most cases it is able to provide the correct solution without user intervention. Some prior information like the availability of a partial structure or of pseudotranslational symmetry is easily exploited to obtain the structure solution.
10
Cepek, O., S. Gursky, and P. Kucera. "On Minimum Representations of Matched Formulas." Journal of Artificial Intelligence Research 51 (December 23, 2014): 707–23. http://dx.doi.org/10.1613/jair.4517.
Full textAbstract:
A Boolean formula in conjunctive normal form (CNF) is called matched if the system of sets of variables which appear in individual clauses has a system of distinct representatives. Each matched CNF is trivially satisfiable (each clause can be satisfied by its representative variable). Another property which is easy to see, is that the class of matched CNFs is not closed under partial assignment of truth values to variables. This latter property leads to a fact (proved here) that given two matched CNFs it is co-NP complete to decide whether they are logically equivalent. The construction in this proof leads to another result: a much shorter and simpler proof of the fact that the Boolean minimization problem for matched CNFs is a complete problem for the second level of the polynomial hierarchy. The main result of this paper deals with the structure of clause minimum CNFs. We prove here that if a Boolean function f admits a representation by a matched CNF then every clause minimum CNF representation of f is matched.
11
MCCLURE, KATHLEEN, JULIAN M. PINE, and ELENA V. M. LIEVEN. "Investigating the abstractness of children's early knowledge of argument structure." Journal of Child Language 33, no. 4 (November 2006): 693–720. http://dx.doi.org/10.1017/s0305000906007525.
Full textAbstract:
In the current debate about the abstractness of children's early grammatical knowledge, Tomasello & Abbott-Smith (2002) have suggested that children might first develop ‘weak’ or ‘partial’ representations of abstract syntactic structures. This paper attempts to characterize these structures by comparing the development of constructions around verbs in Tomasello's (1992) case study of Travis, with those of 10 children (Stage I–II) in a year-length, longitudinal study. The results show some evidence that children's early knowledge of argument structure is verb-specific, but also some evidence that children can generalize knowledge about argument structure across verbs. One way to explain these findings is to argue that children are learning limited scope formulae around high frequency subjects and objects, which serve as building blocks for more abstract structures such as S+V and V+O. The implication is that children may have some verb-general knowledge of the transitive construction as early as Stage I, but that this knowledge is still far from being fully abstract knowledge.
12
Ji, Ho-Il, Byung-Kook Kim, Ji Haeng Yu, Sung-Min Choi, Hae-Ryoung Kim, Ji-Won Son, Hae-Weon Lee, and Jong-Ho Lee. "Three dimensional representations of partial ionic and electronic conductivity based on defect structure analysis of BaZr0.85Y0.15O3−δ." Solid State Ionics 203, no. 1 (November 2011): 9–17. http://dx.doi.org/10.1016/j.ssi.2011.09.016.
Full text
13
Liu, Shuyu, Liu Yang, and Qinghua Hu. "Unsupervised Heterogeneous Transfer Learning for Partial Co-occurrence Data." International Journal on Artificial Intelligence Tools 30, no. 03 (May 2021): 2150012. http://dx.doi.org/10.1142/s0218213021500123.
Full textAbstract:
Heterogeneous transfer clustering contributes to improve the performance of target domain by using the co-occurrence data from different domains without any supervision. Existing works usually use a large of complete co-occurrence data to learn the projection functions mapping heterogeneous data to a common latent feature subspace. Given that in the real-world problems, complete and abundant co-occurrence data in the form of homogeneous transfer learning between the soured domain and target domain are hard to achieve, a heterogeneous transfer clustering method for partial co-occurrence data (HTCPC) is proposed here, to perform unsupervised learning to map the partial information obtained from the source domain onto objects in the target domain. Furthermore, to maximize the useful information to improve the clustering performance in target domain, the proposed HTCPC uses the deep matrix decomposition framework to maintain the multi-layer hidden feature representation and retain the complexity of the data hierarchy by adding the approximate orthogonal constraints, which can effectively strengthen the independence and minimal redundancy. From a series of experiments conducted on four datasets [Berkeley Drosophila Genome Project (BDGP), Devanagari Handwritten Character (DHC), Columbia University Image Library (COIL), and Notting-Hill (NH)], the results show that HTCPC outperforms the peers in the following aspects: our method constructs the hierarchical structure in the multi-layer latent representations and the proposed algorithm can reduce the redundancy and extract more useful knowledge for target domain.
14
Suppes, Patrick, Marcos Perreau-Guimaraes, and Dik Kin Wong. "Partial Orders of Similarity Differences Invariant Between EEG-Recorded Brain and Perceptual Representations of Language." Neural Computation 21, no. 11 (November 2009): 3228–69. http://dx.doi.org/10.1162/neco.2009.04-08-764.
Full textAbstract:
The idea of a hierarchical structure of language constituents of phonemes, syllables, words, and sentences is robust and widely accepted. Empirical similarity differences at every level of this hierarchy have been analyzed in the form of confusion matrices for many years. By normalizing such data so that differences are represented by conditional probabilities, semiorders of similarity differences can be constructed. The intersection of two such orderings is an invariant partial ordering with respect to the two given orders. These invariant partial orderings, especially between perceptual and brain representations, but also for comparison of brain images of words generated by auditory or visual presentations, are the focus of this letter. Data from four experiments are analyzed, with some success in finding conceptually significant invariants.
15
Mellow, J. Dean. "Connectionism, HPSG signs and SLA representations: specifying principles of mapping between form and function." Second Language Research 20, no. 2 (April 2004): 131–65. http://dx.doi.org/10.1191/0267658304sr234oa.
Full textAbstract:
A current limitation of the connectionist approach to second language acquisition (SLA) research is that it does not, to my knowledge, include complex linguistic representations. This article proposes a partial solution to this limitation by motivating and illustrating specific analyses that utilize the sign-based representations developed within Head-driven Phrase Structure Grammar (HPSG). To motivate the proposed representations, the article applies them to an analysis of four types of mappings between form and function: one-to-one, primed redundancy, nonprimed redundancy and polyfunctional. The paper summarizes representative SLA data that indicate how these mappings may appear in second language (L2) production. Key properties of HPSG analyses are discussed, indicating how they are consistent with connectionist assumptions. Sign-based representations of the four types of mappings are then provided, including several modifications to HPSG formalisms. The article concludes with a discussion of future directions.
16
Ismael, Jenann. "Rememberances, Mementos, and Time-Capsules." Royal Institute of Philosophy Supplement 50 (March 2002): 317–28. http://dx.doi.org/10.1017/s1358246100010626.
Full textAbstract:
I want to consider some features of the position put forward by Julian Barbour in The End of Time that seem to me of particular philosophical interest. At the level of generality at which I'll be concerned with it, the view is relatively easy to describe. It can be arrived at by thinking of time as decomposing in some natural way linearly ordered atomic parts, ‘moments’, and combining an observation about the internal structure of moments with an epistemological doctrine about our access to the past. The epistemological doctrine, which I'll call ‘Presentism’, following Butterfield, is the view that our access to the past is mediated by records, or local representations, of it. The observation is that the state of the world at any moment has the structure of what Barbour calls a ‘time capsule’, which is to say that it constitutes a partial record of its past, it is pregnant with interrelated mutually consistent representations of its own history.
17
BROWNLOWE, NATHAN, ASTRID AN HUEF, MARCELO LACA, and IAIN RAEBURN. "Boundary quotients of the Toeplitz algebra of the affine semigroup over the natural numbers." Ergodic Theory and Dynamical Systems 32, no. 1 (April 5, 2011): 35–62. http://dx.doi.org/10.1017/s0143385710000830.
Full textAbstract:
AbstractWe study the Toeplitz algebra 𝒯(ℕ⋊ℕ×) and three quotients of this algebra: the C*-algebra 𝒬ℕ recently introduced by Cuntz, and two new ones, which we call the additive and multiplicative boundary quotients. These quotients are universal for Nica-covariant representations of ℕ⋊ℕ× satisfying extra relations, and can be realised as partial crossed products. We use the structure theory for partial crossed products to prove a uniqueness theorem for the additive boundary quotient, and use the recent analysis of KMS states on 𝒯(ℕ⋊ℕ×) to describe the KMS states on the two quotients. We then show that 𝒯(ℕ⋊ℕ×), 𝒬ℕ and our new quotients are all interesting new examples for Larsen’s theory of Exel crossed products by semigroups.
18
Tramo, Mark Jude, Jamshed J. Bharucha, and Frank E. Musiek. "Music Perception and Cognition Following Bilateral Lesions of Auditory Cortex." Journal of Cognitive Neuroscience 2, no. 3 (July 1990): 195–212. http://dx.doi.org/10.1162/jocn.1990.2.3.195.
Full textAbstract:
We present experimental and anatomical data from a case study of impaired auditory perception following bilateral hemispheric strokes. To consider the cortical representation of sensory, perceptual, and cognitive functions mediating tonal information processing in music, pure tone sensation thresholds, spectral intonation judgments, and the associative priming of spectral intonation judgments by harmonic context were examined, and lesion localization was analyzed quantitatively using straight-line two-dimensional maps of the cortical surface reconstructed from magnetic resonance images. Despite normal pure tone sensation thresholds at 250–8000 Hz, the perception of tonal spectra was severely impaired, such that harmonic structures (major triads) were almost uniformly judged to sound dissonant; yet, the associative priming of spectral intonation judgments by harmonic context was preserved, indicating that cognitive representations of tonal hierarchies in music remained intact and accessible. Brainprints demonstrated complete bilateral lesions of the transverse gyri of Heschl and partial lesions of the right and left superior temporal gyri involving 98 and 20% of their surface areas, respectively. In the right hemisphere, there was partial sparing of the planum temporale, temporoparietal junction, and inferior parietal cortex. In the left hemisphere, all of the superior temporal region anterior to the transverse gyrus and parts of the planum temporale, temporoparietal junction, inferior parietal cortex, and insula were spared. These observations suggest that (1) sensory, perceptual, and cognitive functions mediating tonal information processing in music are neurologically dissociable; (2) complete bilateral lesions of primary auditory cortex combined with partial bilateral lesions of auditory association cortex chronically impair tonal consonance perception; (3) cognitive functions that hierarchically structure pitch information and generate harmonic expectancies during music perception do not rely on the integrity of primary auditory cortex; and (4) musical priming may be mediated by broadly tuned subcomponents of the thala-mocortical auditory system.
19
Jüttner, M., I. Rentschler, and A. Unzicker. "Shift-Invariance of Pattern Recognition in the Visual Field?" Perception 25, no. 1_suppl (August 1996): 78. http://dx.doi.org/10.1068/v96l0101.
Full textAbstract:
The classification behaviour of human observers with respect to compound Gabor signals was tested at foveal and extrafoveal retinal positions. Classification performance was analysed in terms of a probabilistic classification model recently proposed by Rentschler, Jüttner, and Caelli (1994 Vision Research34 669 – 687). The analysis allows inferences about structure and dimensionality of the individual internal representations underlying the classification task and their temporal evolution during the learning process. With this technique it was found that the internal representations of direct and eccentric viewing are intrinsically incommensurable in the sense that extrafoveal pattern representations are characterised by a lower perceptual dimension in feature space relative to the corresponding physical input signals, whereas foveal representations are not (Jüttner and Rentschler, 1996 Vision Research in press). We then addressed the question to what extent observers are capable of generalising class concepts that have been acquired at one particular retinal location to other retinal sites. We found partial generalisation with respect to spatial translation across the visual field. Moreover, there is, in the case of extrafoveal learning, a distinct asymmetry in performance with respect to the visual hemifield in which the signals were originally learned. The latter finding can be related to functional hemispheric specialisation in pattern learning and recognition.
20
Youmans, Gilbert. "The Vocabulary-Management Profile: Two Stories by William Faulkner." Empirical Studies of the Arts 12, no. 2 (July 1994): 113–30. http://dx.doi.org/10.2190/by6n-abua-em1d-rx0v.
Full textAbstract:
The Vocabulary-Management Profile (VMP) is a graph of the moving average of the number of new vocabulary words introduced over successive intervals of text. Peaks and valleys on the VMP correlate closely with narrative structure: new episodes, new settings, new characters are signaled by an increase in new vocabulary, and hence by upturns on the curve. Conversely, downturns in the VMP normally signal a continuation of the episode, description, or characterization. Higher-level boundaries in discourse (such as those between paragraphs and narrative episodes) normally correspond with deeper valleys on VMPs than do lower-level boundaries (such as those between clauses and sentences). Hence, VMPs provide surprisingly accurate graphical representations of the hierarchical structure of discourse. In general, the VMPs for “A Rose for Emily” and “Dry September” confirm this close correspondence between VMPs and narrative structure. However, VMPs are formally equivalent to unlabeled tree diagrams, and like such diagrams, they can provide only partial, not complete analogues for the structure of discourse.
21
BEHNKE, SVEN. "LEARNING ITERATIVE IMAGE RECONSTRUCTION IN THE NEURAL ABSTRACTION PYRAMID." International Journal of Computational Intelligence and Applications 01, no. 04 (December 2001): 427–38. http://dx.doi.org/10.1142/s1469026801000342.
Full textAbstract:
Successful image reconstruction requires the recognition of a scene and the generation of a clean image of that scene. We propose to use recurrent neural networks for both analysis and synthesis. The networks have a hierarchical architecture that represents images in multiple scales with different degrees of abstraction. The mapping between these representations is mediated by a local connection structure. We supply the networks with degraded images and train them to reconstruct the originals iteratively. This iterative reconstruction makes it possible to use partial results as context information to resolve ambiguities. We demonstrate the power of the approach using three examples: superresolution, fill-in of occluded parts, and noise removal/contrast enhancement. We also reconstruct images from sequences of degraded images.
22
Ismail, Amr, Mostafa Herajy, Elsayed Atlam, and Monika Heiner. "A Graphical Approach for Hybrid Simulation of 3D Diffusion Bio-Models via Coloured Hybrid Petri Nets." Modelling and Simulation in Engineering 2020 (July 30, 2020): 1–14. http://dx.doi.org/10.1155/2020/4715172.
Full textAbstract:
Three-dimensional modelling of biological systems is imperative to study the behaviour of dynamic systems that require the analysis of how their components interact in space. However, there are only a few formal tools that offer a convenient modelling of such systems. The traditional approach to construct and simulate 3D models is to build a system of partial differential equations (PDEs). Although this approach may be computationally efficient and has been employed by many researchers over the years, it is not always intuitive since it does not provide a visual depiction of the modelled systems. Indeed, a visual modelling can help to conceive a mental image which eventually contributes to the understanding of the problem under study. Coloured Hybrid Petri Nets (HPNC) are a high-level representation of classical Petri nets that offer hybrid as well as spatial modelling of biological systems. In addition to their graphical representations, HPNC models are also scalable. This paper shows how HPNC can be used to construct and simulate systems that require three-dimensional as well as hybrid (stochastic/continuous) modelling. We use calcium diffusion in three dimensions to illustrate our main ideas. More specifically, we show that creating 3D models using HPNC can yield more flexible models as the structure can be easily scaled up and down by just modifying a few parameters. This advantage of convenient model configuration facilitates the design of different experiments without the need to alter the model structure.
23
CITRINITI, J. H., and W. K. GEORGE. "Reconstruction of the global velocity field in the axisymmetric mixing layer utilizing the proper orthogonal decomposition." Journal of Fluid Mechanics 418 (September 10, 2000): 137–66. http://dx.doi.org/10.1017/s0022112000001087.
Full textAbstract:
Experimental data are presented from 138 synchronized channels of hot-wire anemometry in an investigation of the large-scale, or coherent, structures in a high Reynolds number fully developed, turbulent axisymmetric shear layer. The dynamics of the structures are obtained from instantaneous realizations of the streamwise velocity field in a single plane, x/D = 3, downstream of a round jet nozzle. The Proper Orthogonal Decomposition (POD) technique is applied to an ensemble of these realizations to determine optimal representations of the velocity field, in a mean-square sense, in terms of an orthogonal basis. The coefficients of the orthogonal functions, which describe the temporal evolution of the POD eigenfunctions, are determined by projecting instantaneous realizations of the velocity field onto the basis.Evidence is presented to show that with a partial reconstruction of the velocity field, using only the first radial POD mode, the large-scale structure is objectively educed from the turbulent field. Further, it is shown that only five azimuthal Fourier modes (0,3,4,5,6) are necessary to represent the evolution of the large-scale structure. The results of the velocity reconstruction using the POD provide evidence for azimuthally coherent structures that exist near the potential core. In addition to the azimuthal structures near the potential core, evidence is also found for the presence of counter-rotating, streamwise vortex pairs (or ribs) in the region between successive azimuthally coherent structures as well as coexisting for short periods with them. The large-scale structure cycle, which includes the appearance of the ring structure, the advection of fluid by the ribs in the braid region and their advection toward the outside of the layer by a following ring structure, repeats approximately every one integral time scale. One surprising result was that the most spatially correlated structure in the flow, the coherent ring near the potential core which ejects fluid in the streamwise direction in a volcano-like eruption, is also the one with the shortest time scale.
24
Владимиров, И. Ю., and И. Н. Макаров. "From “Hmmm…” to “Aha!”: Emotional Monitoring of Representational Change." Психология. Журнал Высшей школы экономики 17, no. 4 (December 30, 2020): 658–81. http://dx.doi.org/10.17323/1813-8918-2020-4-658-681.
Full textAbstract:
There are two common approaches to researching insight: the study of the emotional response to a solution (Aha! experience) and the study of the restructuring of representations. The relationship between them can be found by comparing functions they perform relative to each other. For the experimental investigation of insight, problems that are typically being used can be solved within a little amount of time and are highly similar in their structure. We believe that such laboratory designs of the tasks often lead to researchers missing out on the moments of impasse and initial restructuring of the search space. In the current study, using the method of multimodal corpora constructed from individual solutions, we gained partial confirmation of the key statements of the model of emotional regulation of the representational change. According to the model, an insight solution process is accompanied by emotions regulating the process of representational change. A feeling of impasse is a response to the lack of progress towards the solution. An Aha! experience appears in response to solvers performing actions that bring them a huge step closer to the solution of a problem. We believe that these emotional responses are experienced before the solution reaches consciousness and they motivate the solver to adapt their search space accordingly. The model we propose is a development of the ideas of Ya.A. Ponomarev on the role of emotions in regulating of insight problem solving andmodel of M. Ollinger and colleagues describing the phases of insight problem solving.
25
Mendoza, C., M. A. Bautista, P. Palmeri, P. Quinet, M. C. Witthoeft, and T. R. Kallman. "K-shell photoabsorption and photoionization of trace elements." Astronomy & Astrophysics 616 (August 2018): A62. http://dx.doi.org/10.1051/0004-6361/201832939.
Full textAbstract:
Context. This is the final report of a three-paper series on the K-shell photoabsorption and photoionization of trace elements (low cosmic abundance), namely F, Na, P, Cl, K, Sc, Ti, V, Cr, Mn, Co, Cu, and Zn. K lines and edges from such elements are observed in the X-ray spectra of supernova remnants, galaxy clusters, and accreting black holes and neutron stars, their diagnostic potential being limited by poor atomic data.Aims. We here complete the previously reported radiative datasets with new photoabsorption and photoionization cross sections for isoelectronic sequences with electron number 19 ≤N≤ 26. We also describe the access to and integrity and usability of the whole resulting atomic database.Methods. Target representations were obtained with the atomic structure code AUTOSTRUCTURE. Where possible, cross sections for ground-configuration states were computed with the Breit–PauliR-matrix method (BPRM) in either intermediate orLScoupling including damping (radiative and Auger) effects; otherwise and more generally, they were generated in the isolated-resonance approximation with AUTOSTRUCTURE.Results. Cross sections were computed with BPRM only for the K (N= 19) and Ca (N= 20) isoelectronic sequences, the latter inLScoupling. For the remaining sequences (21 ≤N≤ 26), AUTOSTRUCTURE was run inLS-coupling mode taking into account damping effects. Comparisons between these two methods for K-like ZnXIIand Ca-like ZnXIshow that to ensure reasonable accuracy, theLScalculations must be performed taking into account the non-fine-structure relativistic corrections. The original data structures of the BPRM and AUTOSTRUCTURE output files, namely photoabsorption and total and partial photoionization cross sections, are maintained but supplemented with files detailing the target (NT-electron system, whereNT=N− 1) representations and photon states (N-electron system).Conclusions. We conclude that because of the large target size, the photoionization of ions withN> 20 involving inner-shell excitations rapidly leads to untractable BPRM calculations, and is then more effectively treated in the isolated resonance approximation with AUTOSTRUCTURE. This latter approximation by no means involves small calculations as Auger damping must be explicitly specified in the intricate decay routes.
26
Bobaljik, Jonathan David, and Susi Wurmbrand. "Word Order and Scope: Transparent Interfaces and the ¾ Signature." Linguistic Inquiry 43, no. 3 (July 2012): 371–421. http://dx.doi.org/10.1162/ling_a_00094.
Full textAbstract:
A recurring pattern of partial correlations between word order variation and scope possibilities (the ¾ signature) supports a particular view of economy constraints in syntax, with these properties: (1) There are economy conditions (soft constraints) that value a particular type of correspondence between LF and PF representations. (2) These constraints are unidirectional: LF (broadly construed) is calculated first and determines PF (surface word order). (3) Scope rigidity is a property not of languages but of specific configurations, and the distribution of rigidity effects is (largely) predictable from independent variation in the syntactic resources of various languages. We focus here on the interaction of these three assumptions and on the role of (2) in predicting the ¾ signature effect. We contrast our proposal with Reinhart’s (2005) Interface Economy model, in which economy conditions regulate a mapping that takes overt structure as its input and yields permissible interpretations.
27
BUONO, P.-L., M. HELMER, and J. S. W. LAMB. "On the zero set of G-equivariant maps." Mathematical Proceedings of the Cambridge Philosophical Society 147, no. 3 (July 15, 2009): 735–55. http://dx.doi.org/10.1017/s0305004109990120.
Full textAbstract:
AbstractLet G be a finite group acting on vector spaces V and W and consider a smooth G-equivariant mapping f: V → W. This paper addresses the question of the zero set of f near a zero x with isotropy subgroup G. It is known from results of Bierstone and Field on G-transversality theory that the zero set in a neighbourhood of x is a stratified set. The purpose of this paper is to partially determine the structure of the stratified set near x using only information from the representations V and W. We define an index s(Σ) for isotropy subgroups Σ of G which is the difference of the dimension of the fixed point subspace of Σ in V and W. Our main result states that if V contains a subspace G-isomorphic to W, then for every maximal isotropy subgroup Σ satisfying s(Σ) > s(G), the zero set of f near x contains a smooth manifold of zeros with isotropy subgroup Σ of dimension s(Σ). We also present partial results in the case of group representations V and W which do not satisfy the conditions of our main theorem. The paper contains many examples and raises several questions concerning the computation of zero sets of equivariant maps. These results have application to the bifurcation theory of G-reversible equivariant vector fields.
28
Alarushkina, Suraya A., Andrey A. Borisov, Anna A. Voronina, Polina I. Gladun, Evgeny L. Grishunov, Saida G. Ziatdinova, Maria G. Kveladze, et al. "To see the invisible: In search of local identity of Yasenevo area in Moscow." Inter 11, no. 20 (2019): 133–63. http://dx.doi.org/10.19181/inter.2019.20.7.
Full textAbstract:
The article presents the results of complex cultural geographical research of Yasenevo area in Moscow. The research was aimed at revealing an interconnected system of unique spatial representations of this typical distant urban residential area. The methods and approaches of urban planning analysis, statistical method of ‘regional syndrome’, historical and fiction texts’ analysis and semi-structured in-depth interviews were combined together for data collection within the framework of the project, with one of the mental mapping methods (image-geographical maps) used to present the results of the study. As a result Yasenevo is represented as a ‘green’ area due to Bitsevsky park surrounding it and various small gardens and groves in the yards. It is important to mention, Yasenevo is a compact and clearly isolated area, separated by the green areas from the surroundings. It has a specific urban planning and architectural structure dating back to Soviet modernism with peculiar semicircular buildings and streets, spacious avenues and green areas inside the separated cozy quarters (‘states’). Yasenevo is imagined as a ‘young’ area. However this vision co-exists with the historical heritage of preserved and ruined former noble estates and Soviet modernism blocks. Those unique features of Yasenevo are regarded as the basics of currently only partial local identity formation, on the one hand, and as the identifiers of potential organic (identity-based) place branding, on the other hand.
29
Ashrafi, S., and M. Asadi. "Dynamic Reliability Modeling of Three-State Networks." Journal of Applied Probability 51, no. 04 (December 2014): 999–1020. http://dx.doi.org/10.1017/s0021900200011943.
Full textAbstract:
This paper is an investigation into the reliability and stochastic properties of three-state networks. We consider a single-step network consisting of n links and we assume that the links are subject to failure. We assume that the network can be in three states, up (K = 2), partial performance (K = 1), and down (K = 0). Using the concept of the two-dimensional signature, we study the residual lifetimes of the networks under different scenarios on the states and the number of failed links of the network. In the process of doing so, we define variants of the concept of the dynamic signature in a bivariate setting. Then, we obtain signature based mixture representations of the reliability of the residual lifetimes of the network states under the condition that the network is in state K = 2 (or K = 1) and exactly k links in the network have failed. We prove preservation theorems showing that stochastic orderings and dependence between the elements of the dynamic signatures (which relies on the network structure) are preserved by the residual lifetimes of the states of the network (which relies on the network ageing). Various illustrative examples are also provided.
30
Liu, Yue, Scott L. Brincat, Earl K. Miller, and Michael E. Hasselmo. "A Geometric Characterization of Population Coding in the Prefrontal Cortex and Hippocampus during a Paired-Associate Learning Task." Journal of Cognitive Neuroscience 32, no. 8 (August 2020): 1455–65. http://dx.doi.org/10.1162/jocn_a_01569.
Full textAbstract:
Large-scale neuronal recording techniques have enabled discoveries of population-level mechanisms for neural computation. However, it is not clear how these mechanisms form by trial-and-error learning. In this article, we present an initial effort to characterize the population activity in monkey prefrontal cortex (PFC) and hippocampus (HPC) during the learning phase of a paired-associate task. To analyze the population data, we introduce the normalized distance, a dimensionless metric that describes the encoding of cognitive variables from the geometrical relationship among neural trajectories in state space. It is found that PFC exhibits a more sustained encoding of the visual stimuli, whereas HPC only transiently encodes the identity of the associate stimuli. Surprisingly, after learning, the neural activity is not reorganized to reflect the task structure, raising the possibility that learning is accompanied by some “silent” mechanism that does not explicitly change the neural representations. We did find partial evidence on the learning-dependent changes for some of the task variables. This study shows the feasibility of using normalized distance as a metric to characterize and compare population-level encoding of task variables and suggests further directions to explore learning-dependent changes in the neural circuits.
31
Ashrafi, S., and M. Asadi. "Dynamic Reliability Modeling of Three-State Networks." Journal of Applied Probability 51, no. 4 (December 2014): 999–1020. http://dx.doi.org/10.1239/jap/1421763324.
Full textAbstract:
This paper is an investigation into the reliability and stochastic properties of three-state networks. We consider a single-step network consisting of n links and we assume that the links are subject to failure. We assume that the network can be in three states, up (K = 2), partial performance (K = 1), and down (K = 0). Using the concept of the two-dimensional signature, we study the residual lifetimes of the networks under different scenarios on the states and the number of failed links of the network. In the process of doing so, we define variants of the concept of the dynamic signature in a bivariate setting. Then, we obtain signature based mixture representations of the reliability of the residual lifetimes of the network states under the condition that the network is in state K = 2 (or K = 1) and exactly k links in the network have failed. We prove preservation theorems showing that stochastic orderings and dependence between the elements of the dynamic signatures (which relies on the network structure) are preserved by the residual lifetimes of the states of the network (which relies on the network ageing). Various illustrative examples are also provided.
32
Glukhov, A. P. "SOCIAL NETWORK DIGITAL LITERACY: TO THE RATIONALE OF THE CONCEPT." Bulletin of Udmurt University. Series Philosophy. Psychology. Pedagogy 30, no. 4 (December 25, 2020): 380–89. http://dx.doi.org/10.35634/2412-9550-2020-30-4-380-389.
Full textAbstract:
The article presents the results of conceptualization and research of one of the partial types of general digital literacy - social-network digital literacy, incorporated into the corpus of digital competencies of youth. A structural model of the social-network digital literacy is proposed. The task of the field stage of the research, in addition to testing the model, was to describe the specific content of the competencies and subcompetencies included in the model with identifying the degree of their priority for the respondents. In this study, among the entire body of sociological methods, preference was given to qualitative research. The study used such qualitative methods as in-depth interviews, focus groups, analysis of creative essays on the topic of digital communications. Representatives of the studentship of Tomsk universities were selected as respondents. Recruiting was based on the availability of participants, a high level of reflexivity and high network competencies. A standardized sociological survey (N = 201 respondents; in the format of an on-line survey) of student audiences of universities in Tomsk in order to identify the competencies of social network digital literacy supplemented the qualitative research. The study showed the formation among generation Z of a corpus of representations with normative coerciveness and presupposing mastery of a whole set of specific digital competencies. Such a complex of knowledge, skills and normative ethical attitudes serves as a tool for effective communication and socialization of young people in the virtual space of networks. The importance and priority for the respondents of information and media, self-presentation, affiliate, linguistic competences and security competence, incorporated by the authors into the structure of the social-network literacy model, are shown.
33
Yan, Jinpei, Yong Qi, and Qifan Rao. "LSTM-Based Hierarchical Denoising Network for Android Malware Detection." Security and Communication Networks 2018 (2018): 1–18. http://dx.doi.org/10.1155/2018/5249190.
Full textAbstract:
Mobile security is an important issue on Android platform. Most malware detection methods based on machine learning models heavily rely on expert knowledge for manual feature engineering, which are still difficult to fully describe malwares. In this paper, we present LSTM-based hierarchical denoise network (HDN), a novel static Android malware detection method which uses LSTM to directly learn from the raw opcode sequences extracted from decompiled Android files. However, most opcode sequences are too long for LSTM to train due to the gradient vanishing problem. Hence, HDN uses a hierarchical structure, whose first-level LSTM parallelly computes on opcode subsequences (we called them method blocks) to learn the dense representations; then the second-level LSTM can learn and detect malware through method block sequences. Considering that malicious behavior only appears in partial sequence segments, HDN uses method block denoise module (MBDM) for data denoising by adaptive gradient scaling strategy based on loss cache. We evaluate and compare HDN with the latest mainstream researches on three datasets. The results show that HDN outperforms these Android malware detection methods,and it is able to capture longer sequence features and has better detection efficiency than N-gram-based malware detection which is similar to our method.
34
Akram, Muhammad, Ghous Ali, and José Carlos R. Alcantud. "Parameter reduction analysis under interval-valued m-polar fuzzy soft information." Artificial Intelligence Review 54, no. 7 (June 24, 2021): 5541–82. http://dx.doi.org/10.1007/s10462-021-10027-x.
Full textAbstract:
AbstractThis paper formalizes a novel model that is able to use both interval representations, parameterizations, partial memberships and multi-polarity. These are differing modalities of uncertain knowledge that are supported by many models in the literature. The new structure that embraces all these features simultaneously is called interval-valued multi-polar fuzzy soft set (IVmFSS, for short). An enhanced combination of interval-valued m-polar fuzzy (IVmF) sets and soft sets produces this model. As such, the theory of IVmFSSs constitutes both an interval-valued multipolar-fuzzy generalization of soft set theory; a multipolar generalization of interval-valued fuzzy soft set theory; and an interval-valued generalization of multi-polar fuzzy set theory. Some fundamental operations for IVmFSSs, including intersection, union, complement, “OR”, “AND”, are explored and investigated through examples. An algorithm is developed to solve decision-making problems having data in interval-valued m-polar fuzzy soft form. It is applied to two numerical examples. In addition, three parameter reduction approaches and their algorithmic formulation are proposed for IVmFSSs. They are respectively called parameter reduction based on optimal choice, rank based parameter reduction, and normal parameter reduction. Moreover, these outcomes are compared with existing interval-valued fuzzy methods; relatedly, a comparative analysis among reduction approaches is investigated. Two real case studies for the selection of best site for an airport construction and best rotavator are studied.
35
Sun, Hanlin, Wei Jie, Zhongmin Wang, Hai Wang, and Sugang Ma. "Network Representation Learning Guided by Partial Community Structure." IEEE Access 8 (2020): 46665–81. http://dx.doi.org/10.1109/access.2020.2978517.
Full text
36
ROBSON, JO, JANE MARSHALL, TIM PRING, and SHULA CHIAT. "Phonological naming therapy in jargon aphasia: Positive but paradoxical effects." Journal of the International Neuropsychological Society 4, no. 6 (November 1998): 675–86. http://dx.doi.org/10.1017/s1355617798466153.
Full textAbstract:
This article is a single-case investigation of phonological naming therapy. The individual involved had fluent jargon speech, with neologisms, verbal paraphasias, and paragrammatisms. The jargon was underpinned by a severe anomia. Content words were rarely accessed either in spontaneous speech or naming. Single word investigations highlighted some preserved skills. Auditory comprehension, at least for concrete words, was relatively intact and although nonwords could not be repeated, words could, and at a level which was far superior to naming. The patient also had some ability to respond to phonological cues. These results suggested that phonological representations were preserved and that there were some intact semantic abilities. It seemed that the naming disorder was primarily due to an inability to access phonology from semantics. Therapy took a phonological approach. The patient was encouraged to reflect upon the syllabic structure and first phoneme of pictured targets. Subsequently, she was required to use this partial phonological knowledge as a self-cue. It was hypothesized that this therapy might equip the subject with a self-cuing naming strategy. Posttherapy investigations of naming demonstrated dramatic improvements, which generalized to untreated items. However, there was little evidence that these were due to a self cuing strategy. Performance on phonological judgment and discrimination assessments, which required conscious phonological reflection, was unchanged, and there were no signs that the patient was self-cuing during naming. Reasons for these paradoxical results are discussed. (JINS, 1998, 4, 675–686.)
37
Jensen, Jeppe Sinding. "Pascal Boyer: Den ganske historie om religion (nogensinde)." Religionsvidenskabeligt Tidsskrift, no. 43 (August 18, 2003): 52. http://dx.doi.org/10.7146/rt.v0i43.1900.
Full textAbstract:
This review article was occasioned by the publication of Pascal Boyer’s Religion Explained. The Evolutionary Origins of Religious Thought (2001), the title of which left this reviewer in some doubt and intent on investigating whether Boyer’s ambition has been fulfilled. Here, it must be noted that this reviewer is generally positive about the rewarding aspects of the ‘cognitive turn’ in the study of religion and Boyer’s earlier substantial contributions to this, but he is also wary of the fallacy of ‘partial explanation’: explaining a part does not amount to an explanation of the whole.After a presentation of the reviewer’s perspective and involvement in a research group working on religious narrative, cognition and culture, a substantial step-by-step review of the contents and structure of Boyer’s argument is presented. Then follows a discussion of the central concepts of domain specificity concerning cognitive representations and the ‘counter-intuitive’ nature of religious thought and, further, Boyer’s subsequent ideas concerning rituals and the ramifications for social formations and historical developments in what he calls ‘The Full History of All Religion (ever)’. Next, the reviewer offers some ‘critical intuitions’ and questions the return of (a new mode of) psychologism in the human sciences and Boyer’s dependence upon earlier theorizing which is not clearly noted nor acknowledged, but which has consequences for the epistemic status of his project and for those who follow the same tracks in the cognitive study of religion. It turns out that the methodology is based on extreme individualistic and scientistic attitudes, where ‘higher-order’ theoretical objects are explained (away?) by lower-order phenomena. In short, Boyer (and others) stops where culture begins and, as a consequence, religion is transformed into an epiphenomenal category without any causal effects. In the chosen theoretical perspective, religions ‘mean’ nothing; there exist ‘nothing but’ the cognitive representations of individual individuals – but in this manner, the currently dominating approach in the cognitive study of religion perpetuates a Cartesian mystique and a dubious physicalist dualism concerning the mind and the objects it ‘cognizes’. Cognitive theory is definitely an advance in the study of religion but it takes more than materialist fideism to make it convincing. The work of language, culture etc. has to be accounted for more seriously and in more detail.
38
Sakurai, K., and K. Nishimoto. "Propagator representation for partial structure character in conjugated systems." Journal of Mathematical Chemistry 3, no. 4 (December 1989): 377–82. http://dx.doi.org/10.1007/bf01169018.
Full text
39
Vallée, Thierry, and Joseph Manning. "Reconstruction of Partial Orders and List Representation as Random Structures." Electronic Notes in Theoretical Computer Science 225 (January 2009): 441–56. http://dx.doi.org/10.1016/j.entcs.2008.12.091.
Full text
40
Chisholm, James Alexander, and Sam Motherwell. "COMPACK: a program for identifying crystal structure similarity using distances." Journal of Applied Crystallography 38, no. 1 (January 19, 2005): 228–31. http://dx.doi.org/10.1107/s0021889804027074.
Full textAbstract:
A method is presented for comparing crystal structures to identify similarity in molecular packing environments. The relative position and orientation of molecules is captured using interatomic distances, which provide a representation of structure that avoids the use of space-group and cell information. The method can be used to determine whether two crystal structures are the same to within specified tolerances and can also provide a measure of similarity for structures that do not match exactly, but have structural features in common. Example applications are presented that include the identification of an experimentally observed crystal structure from a list of predicted structures and the process of clustering a list of predicted structures to remove duplicates. Examples are also presented to demonstrate partial matching. Such searches were performed to analyse the results of the third blind test for crystal structure prediction, to identify the frequency of occurrence of a characteristic layer and a characteristic hydrogen-bonded chain.
41
Ghose, Sanjoy. "Distance Representations of Consumer Perceptions: Evaluating Appropriateness by Using Diagnostics." Journal of Marketing Research 35, no. 2 (May 1998): 137–53. http://dx.doi.org/10.1177/002224379803500201.
Full textAbstract:
To understand consumer perceptions of product/market structures, marketers must choose from a wide variety of spatial and tree models. Because spatial and tree representations in general possess different distance patterns, diagnostic measures calculated from the input data of dissimilarities or similarities should be able to indicate how appropriate a certain type of representation might be for a given set of input data. In this article, the author draws from previous literature on the characteristics of diagnostic measures and representation models to develop some partial hypotheses about how well the measures might indicate the appropriateness (in terms of fit) of different models. Empirical analysis indicates that the skewness diagnostic is clearly the best predictor of the appropriateness of representation models; this finding is consistent across a variety of comparable spatial and tree models. Centrality and the reciprocity-related measure, in conjunction with skewness, are useful for specific types of space–tree pairs. The author uses the U-Method (closely related to jackknifing) of prediction, in conjunction with discriminant analysis models, to show that the diagnostics can predict the relative appropriateness of spaces versus trees with accuracy levels substantially greater than what would be expected by chance.
42
Pang, Haibo, Chengming Liu, Zhe Zhao, Guangjun Zai, and Zhanbo Li. "Scene Image Retrieval Based on Manifold Structures of Canonical Images." International Journal of Pattern Recognition and Artificial Intelligence 31, no. 03 (February 2017): 1755005. http://dx.doi.org/10.1142/s0218001417550059.
Full textAbstract:
Image retrieval methods have been dramatically developed in the last decade. In this paper, we propose a novel method for image retrieval based on manifold structures of canonical images. Firstly, we present the image normalization process to find a set of canonical images that anchors the probabilistic distributions around the real data manifolds to learn the representations that better encode the manifold structures in general high-dimensional image space. In addition, we employ the canonical images as the centers of the conditional multivariate Gaussian distributions. This approach allows to learn more detailed structures of the partial manifolds resulting in improved representation of the high level properties of scene images. Furthermore, we use the probabilistic framework of the extended model to retrieve images based on the similarity measure of reciprocal likelihood of pairs of images and the sum of likelihood of one of two images based on the other’s best distributions. We estimate our method using SUN database. In the experiments on scene image retrieval, the proposed method is efficient, and exhibits superior capabilities compared to other methods, such as GIST.
43
Krieglsteiner, Joscha, Peter Horst, and Carsten Schmidt. "Definition and representation of stiffened shell structures in the context of an integrated development process." Aircraft Engineering and Aerospace Technology 91, no. 4 (April 1, 2019): 607–19. http://dx.doi.org/10.1108/aeat-07-2018-0205.
Full textAbstract:
Purpose A novel development process aims at finding solutions for lightweight stiffened shell structures and their efficient production. To respect the strong interdependency of structural design and production planning, particularly observed for composite structures, it is of high interest to start considering production effects in early development phases. This integrated approach requires an integrated representation of structure and production. The purpose of this study is to investigate the scope of relevant data and to find a structure for its representation. Design/methodology/approach The development task is analyzed and a system of so-called solution dimensions is presented, which covers all important aspects of stiffened shell structures and their production. An integrated product data model is developed to cover all of the solution dimensions. Findings The product data model consists of five coherent partial models. It is explained how these models are defined and how they are connected to each other. An academic example of an aircraft fuselage panel is used to demonstrate the definition process. It is shown how even complex structural concepts are defined systematically. Practical implications It is explained how this integrated product data model is used in a software project for the development of aircraft fuselage structures. Originality/value The presented approach for the definition and representation of stiffened shell structures enables the developer, e.g. of aircraft fuselage, to respect the crucial criterion of manufacturability from early development phases on. Further, new design approaches, e.g. as inspired by topology optimization, can be considered.
44
Cavassane, Ricardo Peraça, and Itala Maria Loffredo D’Ottaviano. "Big Data: truth, quasi-truth or post-truth?" Acta Scientiarum. Human and Social Sciences 42, no. 3 (December 15, 2020): e56201. http://dx.doi.org/10.4025/actascihumansoc.v42i3.56201.
Full textAbstract:
In this paper we investigate if sentences presented as the result of the application of statistical models and artificial intelligence to large volumes of data – the so-called ‘Big Data’ – can be characterized as semantically true, or as quasi-true, or even if such sentences can only be characterized as probably quasi-false and, in a certain way, post-true; that is, if, in the context of Big Data, the representation of a data domain can be configured as a total structure, or as a partial structure provided with a set of sentences assumed to be true, or if such representation cannot be configured as a partial structure provided with a set of sentences assumed to be true.
45
Gaertner, J. C. "Seasonal organization patterns of demersal assemblages in the Gulf of Lions (north-western Mediterranean Sea)." Journal of the Marine Biological Association of the United Kingdom 80, no. 5 (October 2000): 777–83. http://dx.doi.org/10.1017/s0025315400002745.
Full textAbstract:
The seasonal organization patterns of demersal assemblages (fish and cephalopods) in the Gulf of Lions were investigated on the basis of a set of bottom trawl surveys. The use of Partial Triadic Analysis (PTA) provided a detailed representation of: (1) the common part of the spatial organization of demersal assemblages at seasonal scale; and (2) the seasonal variability of each species around this common structure. During the course of the study, demersal assemblages exhibited a strong seasonal stability in their organization patterns and only few species showed a strong seasonal variation in their spatial distribution. Demersal assemblages of the Gulf of Lions were structured primarily on the basis of a non depth coast–open sea gradient, which occurred from the coast to the midshelf region. The influence of depth on the structure of fish assemblages appeared to be only of limited importance and mainly restricted to the continental slope area. The PTA combined with contouring technics could be used to improve our knowledge of community structuring factors, and offers a theoretical framework to assess the reproducibility of multispecies structures.
46
Nonkané, Ibrahim. "Representation Theory of Groups and D -Modules." International Journal of Mathematics and Mathematical Sciences 2021 (February 18, 2021): 1–7. http://dx.doi.org/10.1155/2021/6613869.
Full textAbstract:
In this paper, we study a decomposition D -module structure of the polynomial ring. Then, we illustrate a geometric interpretation of the Specht polynomials. Using Brauer’s characterization, we give a partial generalization of the fact that factors of the discriminant of a finite map π : spec B ⟶ spec A generate the irreducible factors of the direct image of B under the map π .
47
Li, Guanbin, Xin Zhu, Yirui Zeng, Qing Wang, and Liang Lin. "Semantic Relationships Guided Representation Learning for Facial Action Unit Recognition." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 8594–601. http://dx.doi.org/10.1609/aaai.v33i01.33018594.
Full textAbstract:
Facial action unit (AU) recognition is a crucial task for facial expressions analysis and has attracted extensive attention in the field of artificial intelligence and computer vision. Existing works have either focused on designing or learning complex regional feature representations, or delved into various types of AU relationship modeling. Albeit with varying degrees of progress, it is still arduous for existing methods to handle complex situations. In this paper, we investigate how to integrate the semantic relationship propagation between AUs in a deep neural network framework to enhance the feature representation of facial regions, and propose an AU semantic relationship embedded representation learning (SRERL) framework. Specifically, by analyzing the symbiosis and mutual exclusion of AUs in various facial expressions, we organize the facial AUs in the form of structured knowledge-graph and integrate a Gated Graph Neural Network (GGNN) in a multi-scale CNN framework to propagate node information through the graph for generating enhanced AU representation. As the learned feature involves both the appearance characteristics and the AU relationship reasoning, the proposed model is more robust and can cope with more challenging cases, e.g., illumination change and partial occlusion. Extensive experiments on the two public benchmarks demonstrate that our method outperforms the previous work and achieves state of the art performance.
48
Harvey, Francis. "A dialectical approach to the systematic analysis of geovisual communication using Bertin’s visual variables." Abstracts of the ICA 1 (July 15, 2019): 1. http://dx.doi.org/10.5194/ica-abs-1-107-2019.
Full textAbstract:
<p><strong>Abstract.</strong> This presentation presents a dialectical approach for the analysis and synthesis of geovisual communication systems using the graphic variables of Jacques Bertin as the primary analytical structure. This approach to studying geovisual communication accounts for its dynamics and interaction. It builds primarily on semiotic concepts advanced by Roland Barthes and Umberto Eco that emphasize the interactions between author and reader and the cultural circulation of knowledge. It relies on a Kantian critical epistemology to move beyond an instrumental description of a graphics-based system of communication. The visual system of affordances made and understood with a geovisualization produces situative meaning involving signification and interpretation, which is neither static nor discrete, but transforms what is known and what can be known. These conclusions lead to theoretical insights related to prior discursive concepts of visual communication and raise some questions for future research about the socio-cognitive affordances of cartographic visualization. A practical example shows the empirical approach and initial validation.</p><p>Visual Variables Structure Communication</p><p>The seminal contributions of Roland Barthes point to the process of embedding visual meaning regarding sign, signifier, signified, sign and concept as an extension to Saussure's dyadic approach as two semiological systems, which accounts for the importance of Saussure's bar in the communication of meaning. The two systems code the knowledge of communication, accounting for the situatedness of meaning and its discursive making that connects a sign to a cultural context. Umberto Eco goes beyond Pierce’s icon, index, and symbol trichotomy of a sign through an ongoing chain of interpretative referrals. This approach starts with an active collaboration between creator and reader. It can involve multiple circumstances, cultural aspects and evolve. Visual variables structure communication in an ongoing process.</p><p>The signification of a visual variable is analogous to an atom in a communication process. The analysis of the visual variables of a graphic element in a communication systems sense commences with an analysis of these visual variables related to individual elements and complex symbols. Barthes’ functions, actions, and narrative offer a valuable framework. A synthesis follows that considers the epistemological aspects of a partial system and what its functions purport to do and what they actually do. The analytically determined relationships can be synthesized into webs of explicit and implicit meanings associated with Barthes' structure. This combination and visual intermingling of graphic representations in a geovisualization broaden then to consider their interactions and associations with creator and reader. The visual encompasses the semiotic communication of meaning. The dialectical and critical consideration of the relations and the structure of the communication leads to an improved comprehension of the affordances manifest in the graphical communication system. It also begins to account for mental aspects of perception.</p><p>A model of geovisual communication?</p><p>The theory and methods of this semiotic approach involve considering Bertin’s graphical variables as elements of a model that corresponds to the communication system. Further, the structure of the geovisualization can be modeled symbolically to take up the questions how coding and decoding take place and made reliable given the dynamics of communication and the reliance on conventions in most cartography. This presentation closes with a summary of the benefits of a semiotic approach to the analysis and teaching of geovisual communication.</p>
49
BRACKEN, PAUL. "GEOMETRIC APPROACHES TO PRODUCE PROLONGATIONS FOR NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS." International Journal of Geometric Methods in Modern Physics 10, no. 04 (March 6, 2013): 1350002. http://dx.doi.org/10.1142/s0219887813500023.
Full textAbstract:
The prolongation structure of a two-by-two problem is formulated very generally in terms of exterior differential forms on a standard representation of Pauli matrices. The differential system is general without making reference to any specific equation. An integrability condition is provided which gives by construction the equation to be investigated and whose components involve the structure constants of an SU(2) Lie algebra. Along side this, a related, different kind of prolongation, a type of Wahlquist–Estabrook prolongation, over a closed differential ideal is discussed and some applications are given.
50
Megier, Nina, and Walter T. Strunz. "Total State Dynamics in the GKSL Regime." Open Systems & Information Dynamics 24, no. 04 (December 2017): 1740014. http://dx.doi.org/10.1142/s1230161217400145.
Full textAbstract:
We develop a framework that allows us to describe the dynamics of the total state of an open quantum system and its bosonic environment in the usual Born (weak coupling) and Markov approximation. By shifting the whole time-dependence into an unnormalized s-operator of the open system, the full dynamics is captured by an s-master equation of similar structure than the well-known Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equation for the reduced dynamics. By varying the ordering parameter s (0 ≤ s ≤ 1) we obtain the partial Husimi representation (s = 0) and the partial Glauber-Sudarshan representation (s = 1) for the dynamics of the total state. For the reduced density operator the GKSL master equation can be derived easily. The case of s = 1/2, leading to a partial Wigner representation, is helpful to study the overlap of states in the total Hilbert space of system and environment.